Cover Image

Adaptive Algorithms for Relatively Lipschitz Continuous Convex Optimization Problems

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Stonyakin, Fedor, Titov, Alexander, Alkousa, Mohammad, Savchuk, Oleg, Gasnikov, Alexander
Format:	Preprint
Published:	2021
Subjects:	Optimization and Control
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

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

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)

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

Higher Degree Inexact Model for Optimization problems
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)

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

Optimal Convergence Rate for Mirror Descent Methods with special Time-Varying Step Sizes Rules
by: Alkousa, Mohammad, 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)

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

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

Stochastic Decentralized Optimization of Non-Smooth Convex and Convex-Concave Problems over Time-Varying Networks
by: Divilkovskiy, Maxim, et al.
Published: (2025)

Power of Generalized Smoothness in Stochastic Convex Optimization: First- and Zero-Order Algorithms
by: Lobanov, Aleksandr, et al.
Published: (2025)

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)

Adaptive Stepsize Selection in Decentralized Convex Optimization
by: Kuruzov, Ilya, et al.
Published: (2025)

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

A Parameter-free Decentralized Algorithm for Composite Convex Optimization
by: Chen, Xiaokai, et al.
Published: (2025)

About some works of Boris Polyak on convergence of gradient methods and their development
by: Ablaev, Seydamet, et al.
Published: (2023)

Accelerated Zero-Order SGD Method for Solving the Black Box Optimization Problem under "Overparametrization" Condition
by: Lobanov, Aleksandr, et al.
Published: (2023)

Lower Bounds and Optimal Algorithms for Non-Smooth Convex Decentralized Optimization over Time-Varying Networks
by: Kovalev, Dmitry, et al.
Published: (2024)

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

Acceleration Exists! Optimization Problems When Oracle Can Only Compare Objective Function Values
by: Lobanov, Aleksandr, et al.
Published: (2024)

The Black-Box Optimization Problem: Zero-Order Accelerated Stochastic Method via Kernel Approximation
by: Lobanov, Aleksandr, et al.
Published: (2023)

Median Clipping for Zeroth-order Non-Smooth Convex Optimization and Multi-Armed Bandit Problem with Heavy-tailed Symmetric Noise
by: Kornilov, Nikita, et al.
Published: (2024)

Norm-Constrained Flows and Sign-Based Optimization: Theory and Algorithms
by: Leplat, Valentin, et al.
Published: (2025)

Optimization in complex spaces with the Mixed Newton Method
by: Bakhurin, Sergey, et al.
Published: (2022)

Linear Convergence Rate in Convex Setup is Possible! Gradient Descent Method Variants under $(L_0,L_1)$-Smoothness
by: Lobanov, Aleksandr, et al.
Published: (2024)

Stochastic Weakly Convex Optimization Beyond Lipschitz Continuity
by: Gao, Wenzhi, et al.
Published: (2024)

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

Decentralized Optimization with Mixed Affine Constraints
by: Yarmoshik, Demyan, et al.
Published: (2026)

Lower and upper bounds of the convergence rate of gradient methods with composite noise in gradient
by: Vasin, Artem, et al.
Published: (2026)

Dual Smoothing for Decentralized Optimization
by: Rogozin, Alexander, et al.
Published: (2025)

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

Sign Operator for Coping with Heavy-Tailed Noise in Non-Convex Optimization: High Probability Bounds Under $(L_0, L_1)$-Smoothness
by: Kornilov, Nikita, et al.
Published: (2025)

Local SGD for Near-Quadratic Problems: Improving Convergence under Unconstrained Noise Conditions
by: Sadchikov, Andrey, et al.
Published: (2024)

Distributed Saddle-Point Problems: Lower Bounds, Near-Optimal and Robust Algorithms
by: Beznosikov, Aleksandr, et al.
Published: (2020)

A Parameter-Free Zeroth-Order Algorithm for Decentralized Stochastic Convex Optimization
by: Chen, Jiawei, et al.
Published: (2026)

Decentralized Distributed Optimization for Saddle Point Problems
by: Rogozin, Alexander, et al.
Published: (2021)

Decentralized Optimization with Coupled Constraints
by: Yarmoshik, Demyan, et al.
Published: (2024)

An Adaptive Smoothing Algorithm for Non-Lipschitz Optimization on Manifolds with Complexity Guarantees
by: Wang, Lei, et al.
Published: (2026)