Image de couverture de livre

Accelerated Bregman gradient methods for relatively smooth and relatively Lipschitz continuous minimization problems

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Savchuk, O. S., Alkousa, M. S., Shushko, A. S., Vyguzov, A. A., Stonyakin, F. S., Pasechnyuk, D. A., Gasnikov, A. V.
Format:	Preprint
Publié:	2024
Sujets:	Optimization and Control
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

Adaptive Algorithms for Relatively Lipschitz Continuous Convex Optimization Problems
par: Stonyakin, Fedor, et autres
Publié: (2021)

Frank-Wolfe Algorithms for (L0, L1)-smooth functions
par: Vyguzov, A. A., et autres
Publié: (2025)

On quasi-convex smooth optimization problems by a comparison oracle
par: Gasnikov, A. V., et autres
Publié: (2024)

A Fully Adaptive Frank-Wolfe Algorithm for Relatively Smooth Problems and Its Application to Centralized Distributed Optimization
par: Vyguzov, A. A., et autres
Publié: (2025)

Universal methods for variational inequalities: deterministic and stochastic cases
par: Klimza, Anton, et autres
Publié: (2024)

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

Higher Degree Inexact Model for Optimization problems
par: Alkousa, Mohammad, et autres
Publié: (2024)

Adaptive Variant of Frank-Wolfe Method for Relative Smooth Convex Optimization Problems
par: Vyguzov, Alexander, et autres
Publié: (2024)

Gradient-Type Methods For Decentralized Optimization Problems With Polyak-Łojasiewicz Condition Over Time-Varying Networks
par: Kuruzov, Ilya, et autres
Publié: (2022)

Mirror Descent-Type Algorithms for the Variational Inequality Problem with Functional Constraints
par: Alkousa, Mohammad S., et autres
Publié: (2026)

About some works of Boris Polyak on convergence of gradient methods and their development
par: Ablaev, Seydamet, et autres
Publié: (2023)

Mirror Descent Methods with Weighting Scheme for Outputs for Constrained Variational Inequality Problems
par: Alkousa, Mohammad S., et autres
Publié: (2025)

Optimal Convergence Rate for Mirror Descent Methods with special Time-Varying Step Sizes Rules
par: Alkousa, Mohammad, et autres
Publié: (2024)

Lipschitz-Free Mirror Descent Methods for Non-Smooth Optimization Problems
par: Yuan, Bowen, et autres
Publié: (2025)

On Solving Minimization and Min-Max Problems by First-Order Methods with Relative Error in Gradients
par: Vasin, Artem, et autres
Publié: (2025)

Lower and upper bounds of the convergence rate of gradient methods with composite noise in gradient
par: Vasin, Artem, et autres
Publié: (2026)

OPTAMI: Global Superlinear Convergence of High-order Methods
par: Kamzolov, Dmitry, et autres
Publié: (2024)

Linesearch-free adaptive Bregman proximal gradient for convex minimization without relative smoothness
par: Ou, Hongjia, et autres
Publié: (2025)

Bregman Proximal Method for Efficient Communications under Similarity
par: Beznosikov, Aleksandr, et autres
Publié: (2023)

The Mirror-Prox Sliding Method for Non-smooth decentralized saddle-point problems
par: Kuruzov, Ilya, et autres
Publié: (2022)

Bregman Finito/MISO for nonconvex regularized finite sum minimization without Lipschitz gradient continuity
par: Latafat, Puya, et autres
Publié: (2021)

Convergence analysis of nonmonotone proximal gradient methods under local Lipschitz continuity and Kurdyka--Łojasiewicz property
par: Jia, Xiaoxi, et autres
Publié: (2024)

Randomized gradient-free methods in convex optimization
par: Gasnikov, Alexander, et autres
Publié: (2022)

Moving higher-order Taylor approximations method for smooth constrained minimization problems
par: Nabou, Yassine, et autres
Publié: (2024)

Integral control of the proximal gradient method for unbiased sparse optimization
par: Cerone, V., et autres
Publié: (2025)

Delay-tolerant distributed Bregman proximal algorithms
par: Chraibi, S., et autres
Publié: (2024)

Strengthening the finite characterizations of smooth min-max games
par: Krivchenko, Valery, et autres
Publié: (2026)

A nonmonotone extrapolated proximal gradient-subgradient algorithm beyond global Lipschitz gradient continuity
par: Yang, Lei, et autres
Publié: (2025)

Worst-case convergence analysis of relatively inexact gradient descent on smooth convex functions
par: Vernimmen, Pierre, et autres
Publié: (2025)

Convergence of the momentum method for semialgebraic functions with locally Lipschitz gradients
par: Josz, Cédric, et autres
Publié: (2023)

On Some Versions of Subspace Optimization Methods with Inexact Gradient Information
par: Kuruzov, Ilya, et autres
Publié: (2024)

Accelerated Zero-Order SGD Method for Solving the Black Box Optimization Problem under "Overparametrization" Condition
par: Lobanov, Aleksandr, et autres
Publié: (2023)

Efficient sparse probability measures recovery via Bregman gradient
par: Pan, Jianting, et autres
Publié: (2024)

Bregman three-operator splitting methods
par: Jiang, Xin, et autres
Publié: (2022)

Nesterov's method of dichotomy via Order Oracle: The problem of optimizing a two-variable function on a square
par: Chervonenkis, Boris, et autres
Publié: (2024)

Lifting and partial smoothing for stationary HJB equations and related control problems in infinite dimensions
par: Bolli, Gabriele, et autres
Publié: (2025)

Vaĭnberg--Brègman relative entropy and quasinonexpansive operators
par: Kostecki, Ryshard-Pavel
Publié: (2025)

Newton methods beyond Hessian Lipschitz continuity: A nonlinear preconditioning approach
par: Bodard, Alexander, et autres
Publié: (2026)

Feedback control of Lagrange multipliers for non-smooth constrained optimization
par: Cerone, V., et autres
Publié: (2026)

Acceleration Exists! Optimization Problems When Oracle Can Only Compare Objective Function Values
par: Lobanov, Aleksandr, et autres
Publié: (2024)