Universal intermediate gradient method for convex problems with inexact oracle
From MaRDI portal
(Redirected from Publication:5865342)
Abstract: In this paper, we propose new first-order methods for minimization of a convex function on a simple convex set. We assume that the objective function is a composite function given as a sum of a simple convex function and a convex function with inexact H"older-continuous subgradient. We propose Universal Intermediate Gradient Method. Our method enjoys both the universality and intermediateness properties. Following the paper by Y. Nesterov (Math.Prog., 2015) on Universal Gradient Methods, our method does not require any information about the H"older parameter and constant and adjusts itself automatically to the local level of smoothness. On the other hand, in the spirit of the preprint by O. Devolder, F.Glineur, and Y. Nesterov (CORE DP 2013/17), our method is intermediate in the sense that it interpolates between Universal Gradient Method and Universal Fast Gradient Method. This allows to balance the rate of convergence of the method and rate of the oracle error accumulation. Under additional assumption of strong convexity of the objective, we show how the restart technique can be used to obtain an algorithm with faster rate of convergence.
Recommendations
- Stochastic intermediate gradient method for convex problems with stochastic inexact oracle
- Universal gradient methods for convex optimization problems
- Stochastic intermediate gradient method for convex optimization problems
- First-order methods of smooth convex optimization with inexact oracle
- A universal modification of the linear coupling method
Cites work
- scientific article; zbMATH DE number 3790208 (Why is no real title available?)
- A stable alternative to Sinkhorn's algorithm for regularized optimal transport
- Accelerated primal-dual gradient descent with linesearch for convex, nonconvex, and nonsmooth optimization problems
- Adaptive restart of accelerated gradient methods under local quadratic growth condition
- An optimal method for stochastic composite optimization
- Deterministic and stochastic primal-dual subgradient algorithms for uniformly convex minimization
- Dual approaches to the minimization of strongly convex functionals with a simple structure under affine constraints
- Fast gradient descent for convex minimization problems with an oracle producing a ( , L)-model of function at the requested point
- Fast primal-dual gradient method for strongly convex minimization problems with linear constraints
- First-order methods of smooth convex optimization with inexact oracle
- Generalized uniformly optimal methods for nonlinear programming
- Gradient methods for minimizing composite functions
- Gradient methods for problems with inexact model of the objective
- Optimal methods of smooth convex minimization
- Restarting the accelerated coordinate descent method with a rough strong convexity estimate
- Smooth Optimization with Approximate Gradient
- Stochastic intermediate gradient method for convex optimization problems
- Stochastic intermediate gradient method for convex problems with stochastic inexact oracle
- The ordered subsets mirror descent optimization method with applications to tomography
- Universal gradient methods for convex optimization problems
- Universal method of searching for equilibria and stochastic equilibria in transportation networks
Cited in
(17)- A universal modification of the linear coupling method
- First-order methods of smooth convex optimization with inexact oracle
- Inexact model: a framework for optimization and variational inequalities
- Multistage transportation model and sufficient conditions for its potentiality
- Improved exploitation of higher order smoothness in derivative-free optimization
- scientific article; zbMATH DE number 7726319 (Why is no real title available?)
- An accelerated method for derivative-free smooth stochastic convex optimization
- Accelerated Bregman gradient methods for relatively smooth and relatively Lipschitz continuous minimization problems
- Stochastic intermediate gradient method for convex problems with stochastic inexact oracle
- Universal Conditional Gradient Sliding for Convex Optimization
- On optimal universal first-order methods for minimizing heterogeneous sums
- Generalized mirror prox algorithm for monotone variational inequalities: Universality and inexact oracle
- Accelerated gradient methods with absolute and relative noise in the gradient
- Gradient-Free Methods with Inexact Oracle for Convex-Concave Stochastic Saddle-Point Problem
- The Walrasian equilibrium and centralized distributed optimization in terms of modern convex optimization methods on the example of resource allocation problem
- Intermediate gradient methods with relative inexactness
- Adaptive primal-dual methods with an inexact oracle for relatively smooth optimization problems and their applications to recovering low-rank matrices
This page was built for publication: Universal intermediate gradient method for convex problems with inexact oracle
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5865342)
