Cover Image

Lipschitz-Free Mirror Descent Methods for Relatively Strongly Convex Functions with/without Absolute and Relative Inexactness

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Alkousa, Mohammad S., Stonyakin, Fedor S.
Format:	Preprint
Published:	2026
Subjects:	Optimization and Control
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

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

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

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

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

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

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

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

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

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

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

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

A New Inexact Gradient Descent Method with Applications to Nonsmooth Convex Optimization
by: Khanh, Pham Duy, et al.
Published: (2023)

Inexact Bregman Proximal Gradient Method and its Inertial Variant with Absolute and Partial Relative Stopping Criteria
by: Yang, Lei, et al.
Published: (2021)

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

Investigating Variance Definitions for Mirror Descent with Relative Smoothness
by: Hendrikx, Hadrien
Published: (2024)

ripALM: A Relative-Type Inexact Proximal Augmented Lagrangian Method for Linearly Constrained Convex Optimization
by: Zhu, Jiayi, et al.
Published: (2024)

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

An Inexact Bregman Proximal Difference-of-Convex Algorithm with Two Types of Relative Stopping Criteria
by: Yang, Lei, et al.
Published: (2024)

A Relative Inexact Proximal Gradient Method with an Explicit Linesearch
by: Bello-Cruz, Yunier, et al.
Published: (2024)

Convergence Analysis of a Relative-type Inexact Preconditioned Proximal ALM for Convex Nonlinear Programming
by: Yang, Lei, et al.
Published: (2025)

The Method of Ellipcenters for Strongly Convex Functions
by: Bello-Cruz, Yunier
Published: (2026)

Nonasymptotic Analysis of Accelerated Methods With Inexact Oracle Under Absolute Error Bound
by: Liu, Yin, et al.
Published: (2024)

Two Innovations in Inexact Augmented Lagrangian Methods for Convex Optimization
by: Eckstein, Jonathan, et al.
Published: (2025)

Distributed and Inexact Proximal Gradient Method for Online Convex Optimization
by: Bastianello, Nicola, et al.
Published: (2020)

Frictionless Hamiltonian Descent and Coordinate Hamiltonian Descent for Strongly Convex Quadratic Problems
by: Wang, Jun-Kun
Published: (2024)

Inexact and Implementable Accelerated Newton Proximal Extragradient Method for Convex Optimization
by: Huang, Ziyu, et al.
Published: (2024)

Riemannian Inexact Gradient Descent for Quadratic Discrimination
by: Talwar, Uday, et al.
Published: (2025)

Convergence of First-Order Algorithms with Momentum from the Perspective of an Inexact Gradient Descent Method
by: Khanh, Pham Duy, et al.
Published: (2025)

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

An Inexact General Descent Method with Applications in Differential Equation-Constrained Optimization
by: Macedo, Humberto Gimenes, et al.
Published: (2025)

Accelerated Mirror Descent for Non-Euclidean Star-convex Functions
by: Lezane, Clement, et al.
Published: (2024)

Mirror-Free Proximal Methods
by: Vyas, Abhijeet, et al.
Published: (2026)

Adaptive Accelerated Gradient Descent Methods for Convex Optimization
by: Xu, Zeyi, et al.
Published: (2026)

Restart-Free (Accelerated) Gradient Sliding Methods for Strongly Convex Composite Optimization
by: Wu, Xinming, et al.
Published: (2026)

Robust Learning Meets Quasar-Convex Optimization: Inexact High-Order Proximal-Point Methods
by: Kabgani, Alireza, et al.
Published: (2026)

D-ripALM: A Tuning-friendly Decentralized Relative-Type Inexact Proximal Augmented Lagrangian Method
by: Zhu, Jiayi, et al.
Published: (2026)

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

A Proximal Descent Method for Minimizing Weakly Convex Optimization
by: Liao, Feng-Yi, et al.
Published: (2025)

An Inexact Proximal Framework for Nonsmooth Riemannian Difference-of-Convex Optimization
by: Jiang, Bo, et al.
Published: (2025)

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