We propose an extension of a special form of gradient descent --- in the literature known as linearised Bregman iteration --- to a larger class of non-convex functions. We replace the classical (squared) two norm metric in the...
The optimisation of nonsmooth, nonconvex functions without access to
gradients is a particularly challenging problem that is frequently encountered,
for example in model parameter optimisation problems. Bilevel optimisation...
We propose an extension of a special form of gradient descent --- in the literature known as linearised Bregman iteration --- to a larger class of non-convex functions. We replace the classical (squared) two norm metric in the...