Universal intermediate gradient method for convex problems with inexact oracle
From MaRDI portal
Publication:5865342
DOI10.1080/10556788.2019.1711079zbMath1493.90132arXiv1712.06036OpenAlexW2998975330WikidataQ126332543 ScholiaQ126332543MaRDI QIDQ5865342
Pavel Dvurechensky, Dmitry Kamzolov, Alexander V. Gasnikov
Publication date: 13 June 2022
Published in: Optimization Methods and Software (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1712.06036
Convex programming (90C25) Minimax problems in mathematical programming (90C47) Abstract computational complexity for mathematical programming problems (90C60)
Related Items (8)
The Walrasian equilibrium and centralized distributed optimization in terms of modern convex optimization methods on the example of resource allocation problem ⋮ Generalized mirror prox algorithm for monotone variational inequalities: Universality and inexact oracle ⋮ Improved exploitation of higher order smoothness in derivative-free optimization ⋮ An Accelerated Method for Derivative-Free Smooth Stochastic Convex Optimization ⋮ Accelerated gradient methods with absolute and relative noise in the gradient ⋮ Multistage transportation model and sufficient conditions for its potentiality ⋮ Unnamed Item ⋮ Inexact model: a framework for optimization and variational inequalities
Uses Software
Cites Work
- Unnamed Item
- Gradient methods for minimizing composite functions
- First-order methods of smooth convex optimization with inexact oracle
- An optimal method for stochastic composite optimization
- Universal gradient methods for convex optimization problems
- Stochastic intermediate gradient method for convex problems with stochastic inexact oracle
- Dual approaches to the minimization of strongly convex functionals with a simple structure under affine constraints
- Gradient methods for problems with inexact model of the objective
- Fast gradient descent for convex minimization problems with an oracle producing a \(( \delta, L)\)-model of function at the requested point
- Restarting the accelerated coordinate descent method with a rough strong convexity estimate
- Accelerated primal-dual gradient descent with linesearch for convex, nonconvex, and nonsmooth optimization problems
- Universal method of searching for equilibria and stochastic equilibria in transportation networks
- Generalized uniformly optimal methods for nonlinear programming
- Stochastic intermediate gradient method for convex optimization problems
- A stable alternative to Sinkhorn's algorithm for regularized optimal transport
- The Ordered Subsets Mirror Descent Optimization Method with Applications to Tomography
- Deterministic and stochastic primal-dual subgradient algorithms for uniformly convex minimization
- Fast Primal-Dual Gradient Method for Strongly Convex Minimization Problems with Linear Constraints
- Smooth Optimization with Approximate Gradient
- Optimal methods of smooth convex minimization
- Adaptive restart of accelerated gradient methods under local quadratic growth condition
This page was built for publication: Universal intermediate gradient method for convex problems with inexact oracle
