We study the exact Euclidean ball-proximal point method for proper, closed, convex functions, where each iteration minimizes the objective over a ball centered at the current point. Retaining the objective gap in the decrease of squared distance yields sharper bounds on objective values, stationarity, and the symmetric...
BroxGD is proposed, a projection-free sister method to projected gradient descent for constrained optimization for constrained optimization that expects to find many applications and inspire numerous extensions, much like projected gradient descent.
Peter Richtárik, Kaja Gruntkowska, Han-Min Li· 0 citations
It is shown that, whenever the ball radius does not exceed the Polyak radius, the Local LMO step is the Euclidean projection of the current iterate onto the intersection of the feasible set with a half-space that separates the iterate from the solution set; this projection is nonetheless computable by a linear oracle a...
Peter Richtárik, Ammar Mahran· 0 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.