Cover Image

Convergence Rate Bounds for the Mirror Descent Method: IQCs, Popov Criterion and Bregman Divergence

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Li, Mengmou, Laib, Khaled, Hatanaka, Takeshi, Lestas, Ioannis
Format:	Preprint
Published:	2023
Subjects:	Optimization and Control
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

First-Order Projected Algorithms With the Same Linear Convergence Rate Bounds as Their Unconstrained Counterparts
by: Li, Mengmou, et al.
Published: (2025)

Popov Mirror-Prox Method for Variational Inequalities
by: Chakraborty, Abhishek, et al.
Published: (2025)

Economic Capacity Withholding Bounds of Competitive Energy Storage Bidders
by: Qin, Xin, et al.
Published: (2024)

Exponential Convergence of Augmented Primal-dual Gradient Algorithms for Partially Strongly Convex Functions
by: Li, Mengmou, et al.
Published: (2024)

Dictionary-Restricted First-Order Descent Methods: Bounds and Convergence Rates
by: Berasategui, Miguel, et al.
Published: (2026)

Optimal Convergence Rate for Mirror Descent Methods with special Time-Varying Step Sizes Rules
by: Alkousa, Mohammad, et al.
Published: (2024)

Control of AC-AC interlinking converters for multi-grids
by: Watson, Jeremy, et al.
Published: (2024)

An Optimal Control Interpretation of Augmented Distributed Optimization Algorithms
by: Hallinan, Liam, et al.
Published: (2025)

Popov Mirror-Prox for solving Variational Inequalities
by: Chakraborty, Abhishek, et al.
Published: (2024)

Almost Sure Convergence and Non-asymptotic Concentration Bounds for Stochastic Mirror Descent Algorithm
by: Paul, Anik Kumar, et al.
Published: (2024)

Taming Nonconvex Stochastic Mirror Descent with General Bregman Divergence
by: Fatkhullin, Ilyas, et al.
Published: (2024)

Net-Zero Energy House-oriented Linear Programming for the Sizing Problem of Photovoltaic Panels and Batteries
by: Carnerero, A. Daniel, et al.
Published: (2024)

Last Iterate Convergence of Popov Method for Non-monotone Stochastic Variational Inequalities
by: Vankov, Daniil, et al.
Published: (2023)

On the Convergence of Policy Mirror Descent with Temporal Difference Evaluation
by: Liu, Jiacai, et al.
Published: (2025)

On the Convergence of Policy in Unregularized Policy Mirror Descent
by: Lin, Dachao, et al.
Published: (2022)

Robust Sublinear Convergence Rates for Iterative Bregman Projections
by: Peyré, Gabriel
Published: (2026)

Implicit Bias and Convergence of Matrix Stochastic Mirror Descent
by: Akhtiamov, Danil, et al.
Published: (2026)

Robust Analysis of Almost Sure Convergence of Zeroth-Order Mirror Descent Algorithm
by: Paul, Anik Kumar, et al.
Published: (2023)

Beyond Quadratic Costs in LQR: Bregman Divergence Control
by: Hassibi, Babak, et al.
Published: (2025)

Convergence of Policy Mirror Descent Beyond Compatible Function Approximation
by: Sherman, Uri, et al.
Published: (2025)

Accelerated Mirror Descent Method through Variable and Operator Splitting
by: Chen, Long, et al.
Published: (2026)

A Proof of the Exact Convergence Rate of Gradient Descent
by: Kim, Jungbin
Published: (2024)

Finite-Time Optimization via Scaled Gradient-Momentum Flows
by: Zhou, Yu, et al.
Published: (2026)

The Popov's Algorithm with Optimal Bounded Stepsize for Generalized Monotone Variational Inequalities
by: Nguyen, Nhung Hong, et al.
Published: (2026)

Lipschitz-Free Mirror Descent Methods for Non-Smooth Optimization Problems
by: Yuan, Bowen, et al.
Published: (2025)

Primal-dual Accelerated Mirror-Descent Method for Constrained Bilinear Saddle-Point Problems
by: Li, Weijian, et al.
Published: (2024)

Convergence Properties of Natural Gradient Descent for Minimizing KL Divergence
by: Datar, Adwait, et al.
Published: (2025)

Online Nonconvex Bilevel Optimization with Bregman Divergences
by: Bohne, Jason, et al.
Published: (2024)

LeAP-SSN: A Semismooth Newton Method with Global Convergence Rates
by: Alphonse, Amal, et al.
Published: (2025)

Robust $\mathcal{H}_\infty$ Observer Design via Finsler's Lemma and IQCs
by: Bhattacharya, Raktim, et al.
Published: (2026)

Mirror Descent for Deterministic Optimal Control
by: Feng, Ye, et al.
Published: (2026)

Convergence Analysis of Stochastic Saddle Point Mirror Descent Algorithm -- A Projected Dynamical View Point
by: Paul, Anik Kumar, et al.
Published: (2024)

Mirror Descent Methods with Weighting Scheme for Outputs for Constrained Variational Inequality Problems
by: Alkousa, Mohammad S., et al.
Published: (2025)

A Proof of Exact Convergence Rate of Gradient Descent. Part I. Performance Criterion $\Vert \nabla f(x_N)\Vert^2/(f(x_0)-f_*)$
by: Kim, Jungbin
Published: (2024)

Small-Gain Theorem Based Distributed Prescribed-Time Convex Optimization For Networked Euler-Lagrange Systems
by: Zuo, Gewei, et al.
Published: (2024)

The Essential Best and Average Rate of Convergence of the Exact Line Search Gradient Descent Method
by: Yu, Thomas
Published: (2023)

Optimal control of stochastic networks of $M/M/\infty$ queues with linear costs
by: Carratelli, Giovanni Pugliese, et al.
Published: (2025)

Global Convergence and Rate Analysis of the Steepest Descent Method for Uncertain Multiobjective Optimization via a Robust Optimization Approach
by: Kumar, Shubham, et al.
Published: (2025)

A Canonical Structure for Constructing Projected First-Order Algorithms With Delayed Feedback
by: Li, Mengmou, et al.
Published: (2026)

Open Problem: Anytime Convergence Rate of Gradient Descent
by: Kornowski, Guy, et al.
Published: (2024)