Bregman Proximal Point Algorithm Revisited: A New Inexact Version and Its Inertial Variant
From MaRDI portal
Publication:5093643
DOI10.1137/20M1360748zbMath1496.90108arXiv2105.10370MaRDI QIDQ5093643
Publication date: 29 July 2022
Published in: SIAM Journal on Optimization (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2105.10370
Numerical mathematical programming methods (65K05) Nonlinear programming (90C30) Optimality conditions and duality in mathematical programming (90C46) Optimality conditions for minimax problems (49K35)
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Computational Optimal Transport: With Applications to Data Science
- Smooth minimization of non-smooth functions
- Approximation accuracy, gradient methods, and error bound for structured convex optimization
- Primal-dual first-order methods with \({\mathcal {O}(1/\varepsilon)}\) iteration-complexity for cone programming
- Multiplicative iterative algorithms for convex programming
- An iterative row-action method for interval convex programming
- Approximate iterations in Bregman-function-based proximal algorithms
- Proximal minimization algorithm with \(D\)-functions
- Enlargement of monotone operators with applications to variational inequalities
- Introductory lectures on convex optimization. A basic course.
- A hybrid approximate extragradient-proximal point algorithm using the enlargement of a maximal monotone operator
- Error bounds for proximal point subproblems and associated inexact proximal point algorithms
- A simplified view of first order methods for optimization
- An interior-proximal method for convex linearly constrained problems and its extension to variational inequalities
- Accelerated Bregman proximal gradient methods for relatively smooth convex optimization
- On the efficient computation of a generalized Jacobian of the projector over the Birkhoff polytope
- Perturbed Fenchel duality and first-order methods
- An Inexact Hybrid Generalized Proximal Point Algorithm and Some New Results on the Theory of Bregman Functions
- A UNIFIED FRAMEWORK FOR SOME INEXACT PROXIMAL POINT ALGORITHMS*
- An Accelerated Hybrid Proximal Extragradient Method for Convex Optimization and Its Implications to Second-Order Methods
- Accelerated and Inexact Forward-Backward Algorithms
- On the Complexity of the Hybrid Proximal Extragradient Method for the Iterates and the Ergodic Mean
- Convergence Analysis of a Proximal-Like Minimization Algorithm Using Bregman Functions
- On the Convergence of the Proximal Point Algorithm for Convex Minimization
- New Proximal Point Algorithms for Convex Minimization
- Entropic Proximal Mappings with Applications to Nonlinear Programming
- Monotone Operators and the Proximal Point Algorithm
- Augmented Lagrangians and Applications of the Proximal Point Algorithm in Convex Programming
- Variational Analysis
- Convergence of Proximal-Like Algorithms
- Proximal Minimization Methods with Generalized Bregman Functions
- Catalyst Acceleration for First-order Convex Optimization: from Theory to Practice
- First Order Methods Beyond Convexity and Lipschitz Gradient Continuity with Applications to Quadratic Inverse Problems
- Relatively Smooth Convex Optimization by First-Order Methods, and Applications
- Nonlinear Proximal Point Algorithms Using Bregman Functions, with Applications to Convex Programming
- Entropy-Like Proximal Methods in Convex Programming
- Convergence Rate Analysis of Nonquadratic Proximal Methods for Convex and Linear Programming
- Interior Gradient and Proximal Methods for Convex and Conic Optimization
- Proximité et dualité dans un espace hilbertien
- Convex Analysis
- A Descent Lemma Beyond Lipschitz Gradient Continuity: First-Order Methods Revisited and Applications
