Cover Image

On Some Versions of Subspace Optimization Methods with Inexact Gradient Information

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Kuruzov, Ilya, Stonyakin, Fedor
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

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

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

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)

A Line-search-free Method for Adaptive Decentralized Optimization
by: Chen, Xiaokai, et al.
Published: (2026)

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

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

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

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

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

Inexactly Smooth Performance Estimation and New Optimized Gradient Methods
by: Zoll, Aaron, et al.
Published: (2026)

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

Adaptive Decentralized Composite Optimization via Three-Operator Splitting
by: Chen, Xiaokai, et al.
Published: (2026)

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

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

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

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

A Relative Inexact Proximal Gradient Method with an Explicit Linesearch
by: Bello-Cruz, Yunier, 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)

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

Efficient Gradient Tracking Algorithms for Distributed Optimization Problems with Inexact Communication
by: Zhao, Shengchao, et al.
Published: (2025)

Subspace Quasi-Newton Method with Gradient Approximation
by: Miyaishi, Taisei, et al.
Published: (2024)

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

An Inexact Preconditioned Zeroth-order Proximal Method for Composite Optimization
by: Liu, Shanglin, et al.
Published: (2024)

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

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)

Inexact Accelerated Proximal Gradient Method Revisit: An Economical Variant via Shadow Points
by: Yang, Lei, et al.
Published: (2025)

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

OFF (Proximal) Newton-type Methods with Inexact Derivatives for Unconstrained Optimization
by: Zhu, Hong
Published: (2025)

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

An Inexact Variable Metric Proximal Gradient-subgradient Algorithm for a Class of Fractional Optimization Problems
by: Yang, Lei, et al.
Published: (2025)

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

Distributed Derivative-Free Optimization Using Inexact ADMM and Trust-Region Methods
by: Fasiku, Damilola, et al.
Published: (2025)

Inexact and Stochastic Gradient Optimization Algorithms with Inertia and Hessian Driven Damping
by: Choudhary, Harsh, et al.
Published: (2025)

From Inexact Gradients to Byzantine Robustness: Acceleration and Optimization under Similarity
by: Gaucher, Renaud, et al.
Published: (2026)

Improved Analysis of Restarted Accelerated Gradient and Augmented Lagrangian Methods via Inexact Proximal Point Frameworks
by: Burns, Matthew X., et al.
Published: (2026)

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

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

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