Copertina

Optimal Convergence Rate for Mirror Descent Methods with special Time-Varying Step Sizes Rules

Fuente: arXiv

Salvato in:

Dettagli Bibliografici
Autori principali:	Alkousa, Mohammad, Stonyakin, Fedor, Abdo, Asmaa, Alcheikh, Mohammad
Natura:	Preprint
Pubblicazione:	2024
Soggetti:	Optimization and Control
Accesso online:	Acceder al recurso
Tags:	Aggiungi Tag Nessun Tag, puoi essere il primo ad aggiungerne!!

Documenti analoghi

Higher Degree Inexact Model for Optimization problems
di: Alkousa, Mohammad, et al.
Pubblicazione: (2024)

Lipschitz-Free Mirror Descent Methods for Relatively Strongly Convex Functions with/without Absolute and Relative Inexactness
di: Alkousa, Mohammad S., et al.
Pubblicazione: (2026)

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

Gradient-Type Methods For Decentralized Optimization Problems With Polyak-Łojasiewicz Condition Over Time-Varying Networks
di: Kuruzov, Ilya, et al.
Pubblicazione: (2022)

Mirror Descent-Type Algorithms for the Variational Inequality Problem with Functional Constraints
di: Alkousa, Mohammad S., et al.
Pubblicazione: (2026)

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

Universal methods for variational inequalities: deterministic and stochastic cases
di: Klimza, Anton, et al.
Pubblicazione: (2024)

Adaptive Algorithms for Relatively Lipschitz Continuous Convex Optimization Problems
di: Stonyakin, Fedor, et al.
Pubblicazione: (2021)

On Some Versions of Subspace Optimization Methods with Inexact Gradient Information
di: Kuruzov, Ilya, et al.
Pubblicazione: (2024)

Adaptive Variant of Frank-Wolfe Method for Relative Smooth Convex Optimization Problems
di: Vyguzov, Alexander, et al.
Pubblicazione: (2024)

Convergence Rate Bounds for the Mirror Descent Method: IQCs, Popov Criterion and Bregman Divergence
di: Li, Mengmou, et al.
Pubblicazione: (2023)

On Solving Minimization and Min-Max Problems by First-Order Methods with Relative Error in Gradients
di: Vasin, Artem, et al.
Pubblicazione: (2025)

Analysis of Gradient Descent with Varying Step Sizes using Integral Quadratic Constraints
di: Padmanabhan, Ram, et al.
Pubblicazione: (2022)

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

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

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

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

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

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

Adaptive Open-Loop Step-Sizes for Accelerated Convergence Rates of the Frank-Wolfe Algorithm
di: Wirth, Elias, et al.
Pubblicazione: (2025)

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

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

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

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

Accelerated Affine-Invariant Convergence Rates of the Frank-Wolfe Algorithm with Open-Loop Step-Sizes
di: Wirth, Elias, et al.
Pubblicazione: (2023)

Accelerated Bregman gradient methods for relatively smooth and relatively Lipschitz continuous minimization problems
di: Savchuk, O. S., et al.
Pubblicazione: (2024)

On quasi-convex smooth optimization problems by a comparison oracle
di: Gasnikov, A. V., et al.
Pubblicazione: (2024)

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

Adaptive Step Sizes for Preconditioned Stochastic Gradient Descent
di: Köhne, Frederik, et al.
Pubblicazione: (2023)

Block Coordinate Descent Methods for Structured Nonconvex Optimization with Nonseparable Constraints: Optimality Conditions and Global Convergence
di: Yuan, Zhijie, et al.
Pubblicazione: (2024)

Optimal Primal-Dual Algorithm with Last iterate Convergence Guarantees for Stochastic Convex Optimization Problems
di: Boob, Digvijay, et al.
Pubblicazione: (2024)

On the Convergence of Projected Policy Gradient for Any Constant Step Sizes
di: Liu, Jiacai, et al.
Pubblicazione: (2023)

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

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

Accelerated Objective Gap and Gradient Norm Convergence for Gradient Descent via Long Steps
di: Grimmer, Benjamin, et al.
Pubblicazione: (2024)

AGDA+: Proximal Alternating Gradient Descent Ascent Method with a Nonmonotone Adaptive Step-Size Search for Nonconvex Minimax Problems
di: Zhang, Xuan, et al.
Pubblicazione: (2024)

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

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

A Fully Adaptive Frank-Wolfe Algorithm for Relatively Smooth Problems and Its Application to Centralized Distributed Optimization
di: Vyguzov, A. A., et al.
Pubblicazione: (2025)

Frank-Wolfe Algorithms for (L0, L1)-smooth functions
di: Vyguzov, A. A., et al.
Pubblicazione: (2025)