Stochastic intermediate gradient method for convex problems with stochastic inexact oracle
From MaRDI portal
Publication:727222
DOI10.1007/s10957-016-0999-6zbMath1351.90150OpenAlexW2514921637MaRDI QIDQ727222
Pavel Dvurechensky, Alexander V. Gasnikov
Publication date: 6 December 2016
Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10957-016-0999-6
Related Items (25)
Inexact coordinate descent: complexity and preconditioning ⋮ Efficient numerical methods for entropy-linear programming problems ⋮ Generalized mirror prox algorithm for monotone variational inequalities: Universality and inexact oracle ⋮ An Accelerated Method for Derivative-Free Smooth Stochastic Convex Optimization ⋮ Dual approaches to the minimization of strongly convex functionals with a simple structure under affine constraints ⋮ Subgradient ellipsoid method for nonsmooth convex problems ⋮ Accelerated gradient methods with absolute and relative noise in the gradient ⋮ Hyperfast second-order local solvers for efficient statistically preconditioned distributed optimization ⋮ PAC learning halfspaces in non-interactive local differential privacy model with public unlabeled data ⋮ Stochastic regularized Newton methods for nonlinear equations ⋮ First-order methods for convex optimization ⋮ Unifying framework for accelerated randomized methods in convex optimization ⋮ Recent theoretical advances in decentralized distributed convex optimization ⋮ Composite convex optimization with global and local inexact oracles ⋮ Universal method for stochastic composite optimization problems ⋮ Fast gradient descent for convex minimization problems with an oracle producing a \(( \delta, L)\)-model of function at the requested point ⋮ An accelerated directional derivative method for smooth stochastic convex optimization ⋮ Decentralized and parallel primal and dual accelerated methods for stochastic convex programming problems ⋮ Computing the Best Approximation over the Intersection of a Polyhedral Set and the Doubly Nonnegative Cone ⋮ Unnamed Item ⋮ Robust Accelerated Gradient Methods for Smooth Strongly Convex Functions ⋮ Inexact model: a framework for optimization and variational inequalities ⋮ Universal intermediate gradient method for convex problems with inexact oracle ⋮ Smoothed Variable Sample-Size Accelerated Proximal Methods for Nonsmooth Stochastic Convex Programs ⋮ Convex optimization with inexact gradients in Hilbert space and applications to elliptic inverse problems
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Gradient methods for minimizing composite functions
- First-order methods of smooth convex optimization with inexact oracle
- Validation analysis of mirror descent stochastic approximation method
- Introductory lectures on convex optimization. A basic course.
- Deterministic and stochastic primal-dual subgradient algorithms for uniformly convex minimization
- Robust Stochastic Approximation Approach to Stochastic Programming
- Optimal Stochastic Approximation Algorithms for Strongly Convex Stochastic Composite Optimization I: A Generic Algorithmic Framework
- Optimal Stochastic Approximation Algorithms for Strongly Convex Stochastic Composite Optimization, II: Shrinking Procedures and Optimal Algorithms
This page was built for publication: Stochastic intermediate gradient method for convex problems with stochastic inexact oracle
