Convergence rate bounds for the mirror descent method: IQCs, Popov criterion and Bregman divergence
From MaRDI portal
Publication:6659264
DOI10.1016/j.automatica.2024.111973MaRDI QIDQ6659264
Mengmou Li, Takeshi Hatanaka, Ioannis Lestas, Khaled Laib
Publication date: 8 January 2025
Published in: Automatica (Search for Journal in Brave)
Could not fetch data.
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Zames-Falb multipliers for absolute stability: from O'Shea's contribution to convex searches
- Equivalence between classes of multipliers for slope-restricted nonlinearities
- Passivity of nonlinearity incremental systems: application to PI stabilization of nonlinear RLC circuits
- Parameter-dependent Lyapunov functions and the discrete-time Popov criterion for robust analysis
- On the Kalman-Yakubovich-Popov lemma
- Stability analysis with Popov multipliers and integral quadratic constraints
- Optimal distributed stochastic mirror descent for strongly convex optimization
- Secant and Popov-like conditions in power network stability
- Mirror descent and nonlinear projected subgradient methods for convex optimization.
- A generalization of the Popov criterion
- Nonlinear systems.
- Convex optimization: algorithms and complexity
- Exponential Decay Rate Conditions for Uncertain Linear Systems Using Integral Quadratic Constraints
- Stability Analysis With Dissipation Inequalities and Integral Quadratic Constraints
- Analysis and Design of Optimization Algorithms via Integral Quadratic Constraints
- System analysis via integral quadratic constraints
- Bregman Storage Functions for Microgrid Control
- Relatively Smooth Convex Optimization by First-Order Methods, and Applications
- A variational perspective on accelerated methods in optimization
- Ergodic Mirror Descent
- On Stochastic Subgradient Mirror-Descent Algorithm with Weighted Averaging
- A Less Conservative Stability Criterion for Discrete-Time Lur'e Systems With Sector and Slope Restrictions
- The Proximal Augmented Lagrangian Method for Nonsmooth Composite Optimization
- All multipliers for repeated monotone nonlinearities
- Dual Space Preconditioning for Gradient Descent
- The Information Geometry of Mirror Descent
- New results for analysis of systems with repeated nonlinearities
This page was built for publication: Convergence rate bounds for the mirror descent method: IQCs, Popov criterion and Bregman divergence
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6659264)