Cover Image

Higher Degree Inexact Model for Optimization problems

Fuente: arXiv

Saved in:

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

Similar Items

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

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 Algorithms for Relatively Lipschitz Continuous Convex Optimization Problems
by: Stonyakin, Fedor, et al.
Published: (2021)

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

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

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

Adaptive Variant of Frank-Wolfe Method for Relative Smooth Convex Optimization Problems
by: Vyguzov, Alexander, 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)

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

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

Lipschitz-Free Mirror Descent Methods for Non-Smooth Optimization Problems
by: Yuan, Bowen, 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)

Decentralized Inexact Cubic Newton Method with Consensus Procedure
by: Agafonov, Artem, et al.
Published: (2026)

Adaptive Regularized Newton Method with Inexact Hessian
by: Shestakov, Aleksandr, et al.
Published: (2025)

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

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

Stochastic Decentralized Optimization of Non-Smooth Convex and Convex-Concave Problems over Time-Varying Networks
by: Divilkovskiy, Maxim, 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)

The Mirror-Prox Sliding Method for Non-smooth decentralized saddle-point problems
by: Kuruzov, Ilya, et al.
Published: (2022)

Exploring Jacobian Inexactness in Second-Order Methods for Variational Inequalities: Lower Bounds, Optimal Algorithms and Quasi-Newton Approximations
by: Agafonov, Artem, et al.
Published: (2024)

Speeding up the Goemans-Williamson randomized procedure by difference-of-convex optimization
by: Salloum, Hadi, et al.
Published: (2025)

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)

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)

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

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

Nesterov's method of dichotomy via Order Oracle: The problem of optimizing a two-variable function on a square
by: Chervonenkis, Boris, et al.
Published: (2024)

Bilevel Learning with Inexact Stochastic Gradients
by: Salehi, Mohammad Sadegh, et al.
Published: (2024)

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

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

Gradient-free algorithm for saddle point problems under overparametrization
by: Statkevich, Ekaterina, et al.
Published: (2024)

Fast Inexact Bilevel Optimization for Analytical Deep Image Priors
by: Salehi, Mohammad Sadegh, et al.
Published: (2025)

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

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

An Inexact Conditional Gradient Method for Constrained Bilevel Optimization
by: Abolfazli, Nazanin, et al.
Published: (2023)

Strengthening the finite characterizations of smooth min-max games
by: Krivchenko, Valery, et al.
Published: (2026)