Intermediate gradient methods with relative inexactness

DOI10.1007/S10957-025-02809-YMaRDI QIDQ6933691zbMATH OpenFDO

Authors Nikita Kornilov, Mohammad S. Alkousa, Eduard Gorbunov, F. S. Stonyakin, Pavel Dvurechensky, A. V. Gasnikov

Publication date 4 September 2025

Published in Journal of Optimization Theory and Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/S10957-025-02809-Y

zbMATH Keywords

accelerated methodsinexact gradientintermediate methodperformance estimation problemrelative noise

Mathematics Subject Classification ID

Large-scale problems in mathematical programming (90C06) Convex programming (90C25) Nonlinear programming (90C30)

Cites work

• A first order method for solving convex bilevel optimization problems
• A frequency-domain analysis of inexact gradient methods
• A proximal trust-region method for nonsmooth optimization with inexact function and gradient evaluations
• Accelerated gradient methods with absolute and relative noise in the gradient
• An optimal gradient method for smooth strongly convex minimization
• Convex optimization with inexact gradients in Hilbert space and applications to elliptic inverse problems
• First-order methods of smooth convex optimization with inexact oracle
• scientific article; zbMATH DE number 4015993 (Why is no real title available?)
• scientific article; zbMATH DE number 3871041 (Why is no real title available?)
• scientific article; zbMATH DE number 5176444 (Why is no real title available?)
• Inexact model: a framework for optimization and variational inequalities
• Lectures on convex optimization
• Lectures on stochastic programming. Modeling and theory
• Nonlinear programming
• On the worst-case complexity of the gradient method with exact line search for smooth strongly convex functions
• Performance of first-order methods for smooth convex minimization: a novel approach
• Simple and optimal methods for stochastic variational inequalities. I: Operator extrapolation
• Smooth Optimization with Approximate Gradient
• Smooth strongly convex interpolation and exact worst-case performance of first-order methods
• Stochastic intermediate gradient method for convex problems with stochastic inexact oracle
• Stochastic Optimization with Decision-Dependent Distributions
• The regularizing properties of the adjoint gradient method in ill-posed problems
• Universal intermediate gradient method for convex problems with inexact oracle
• Universal method for stochastic composite optimization problems

Cited in

(1)

• An inexact first-order descent method with general directions: theory and applications to DE-constrained optimization

This page was built for publication: Intermediate gradient methods with relative inexactness

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6933691)