Bregman Proximal Point Algorithm Revisited: A New Inexact Version and Its Inertial Variant

Accelerated Bregman proximal gradient methods for relatively smooth convex optimization

(2021) Filip Hanzely et al.   COMPUTATIONAL OPTIMIZATION AND APPLICATIONS

A simplified view of first order methods for optimization

(2018) Marc Teboulle   MATHEMATICAL PROGRAMMING

Relatively Smooth Convex Optimization by First-Order Methods, and Applications

(2018) Haihao Lu et al.   SIAM JOURNAL ON OPTIMIZATION

First Order Methods Beyond Convexity and Lipschitz Gradient Continuity with Applications to Quadratic Inverse Problems

(2018) Jérôme Bolte et al.   SIAM JOURNAL ON OPTIMIZATION

On the efficient computation of a generalized Jacobian of the projector over the Birkhoff polytope

(2018) Xudong Li et al.   MATHEMATICAL PROGRAMMING

A Descent Lemma Beyond Lipschitz Gradient Continuity: First-Order Methods Revisited and Applications

(2017) Heinz H. Bauschke et al.   MATHEMATICS OF OPERATIONS RESEARCH

An Accelerated Hybrid Proximal Extragradient Method for Convex Optimization and Its Implications to Second-Order Methods

(2013) Renato D. C. Monteiro et al.   SIAM JOURNAL ON OPTIMIZATION

Accelerated and Inexact Forward-Backward Algorithms

(2013) Silvia Villa et al.   SIAM JOURNAL ON OPTIMIZATION

Approximation accuracy, gradient methods, and error bound for structured convex optimization

(2010) Paul Tseng   MATHEMATICAL PROGRAMMING

On the Complexity of the Hybrid Proximal Extragradient Method for the Iterates and the Ergodic Mean

(2010) Renato D. C. Monteiro et al.   SIAM JOURNAL ON OPTIMIZATION

Primal-dual first-order methods with $${\mathcal {O}(1/\epsilon)}$$ iteration-complexity for cone programming

(2009) Guanghui Lan et al.   MATHEMATICAL PROGRAMMING