The rate of convergence of Bregman proximal methods: local geometry versus regularity versus sharpness

DOI10.1137/23M1580218MaRDI QIDQ6573018FDOQ6573018

Authors: Franck Iutzeler, Jérôme Malick, Panayotis Mertikopoulos 

Publication date: 16 July 2024

Published in: SIAM Journal on Optimization (Search for Journal in Brave)

Recommendations

• Accelerated Bregman proximal gradient methods for relatively smooth convex optimization
• On the linear convergence of a Bregman proximal point algorithm
• On the convergence rate of entropic proximal optimization methods
• On Dual Convergence and the Rate of Primal Convergence of Bregman’s Convex Programming Method
• Dual convergence of the proximal point method with Bregman distances for linear programming

zbMATH Keywords

variational inequalitiesconvergence speedBregman proximal methodsLegendre exponent

Mathematics Subject Classification ID

Numerical optimization and variational techniques (65K10) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33)

Cites Work

• Introductory lectures on convex optimization. A basic course.
• Title not available (Why is that?)
• Primal-dual subgradient methods for convex problems
• Mirror descent and nonlinear projected subgradient methods for convex optimization.
• Interior projection-like methods for monotone variational inequalities
• Lectures on modern convex optimization. Analysis, algorithms, and engineering applications
• Robust Stochastic Approximation Approach to Stochastic Programming
• Title not available (Why is that?)
• Prox-Method with Rate of Convergence O(1/t) for Variational Inequalities with Lipschitz Continuous Monotone Operators and Smooth Convex-Concave Saddle Point Problems
• Convex Analysis
• Finite-Dimensional Variational Inequalities and Complementarity Problems
• Possible generalization of Boltzmann-Gibbs statistics.
• Title not available (Why is that?)
• Game theory
• Proximal Minimization Methods with Generalized Bregman Functions
• The Nonstochastic Multiarmed Bandit Problem
• Title not available (Why is that?)
• Convergence Analysis of a Proximal-Like Minimization Algorithm Using Bregman Functions
• Online learning and online convex optimization
• Title not available (Why is that?)
• Solving variational inequalities with stochastic mirror-prox algorithm
• Hessian Riemannian Gradient Flows in Convex Programming
• Convex optimization: algorithms and complexity
• Regularization techniques for learning with matrices
• Title not available (Why is that?)
• A modification of the Arrow-Hurwicz method for search of saddle points
• Projected reflected gradient methods for monotone variational inequalities
• A modification of Karmarkar's linear programming algorithm
• Relatively smooth convex optimization by first-order methods, and applications
• A descent lemma beyond Lipschitz gradient continuity: first-order methods revisited and applications
• Learning in games with continuous action sets and unknown payoff functions
• Learning in games via reinforcement and regularization
• Stochastic games

This page was built for publication: The rate of convergence of Bregman proximal methods: local geometry versus regularity versus sharpness

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6573018)