Gradient methods for minimizing composite functions

@article{Nesterov2013GradientMF,
  title={Gradient methods for minimizing composite functions},
  author={Y. Nesterov},
  journal={Mathematical Programming},
  year={2013},
  volume={140},
  pages={125-161}
}
  • Y. Nesterov
  • Published 2013
  • Mathematics, Computer Science
  • Mathematical Programming
In this paper we analyze several new methods for solving optimization problems with the objective function formed as a sum of two terms: one is smooth and given by a black-box oracle, and another is a simple general convex function with known structure. Despite the absence of good properties of the sum, such problems, both in convex and nonconvex cases, can be solved with efficiency typical for the first part of the objective. For convex problems of the above structure, we consider primal and… Expand
An adaptive accelerated proximal gradient method and its homotopy continuation for sparse optimization
An optimal randomized incremental gradient method
Accelerated Regularized Newton Methods for Minimizing Composite Convex Functions
A FISTA-type accelerated gradient algorithm for solving smooth nonconvex composite optimization problems
Efficiency of minimizing compositions of convex functions and smooth maps
Primal-dual fast gradient method with a model
Complexity bounds for primal-dual methods minimizing the model of objective function
  • Y. Nesterov
  • Mathematics, Computer Science
  • Math. Program.
  • 2018
MOCCA: Mirrored Convex/Concave Optimization for Nonconvex Composite Functions
...
1
2
3
4
5
...

References

SHOWING 1-10 OF 32 REFERENCES
Gradient methods for minimizing composite objective function
Accelerating the cubic regularization of Newton’s method on convex problems
  • Y. Nesterov
  • Mathematics, Computer Science
  • Math. Program.
  • 2008
Rounding of convex sets and efficient gradient methods for linear programming problems
  • Y. Nesterov
  • Mathematics, Computer Science
  • Optim. Methods Softw.
  • 2008
A generalized proximal point algorithm for certain non-convex minimization problems
Introductory Lectures on Convex Optimization - A Basic Course
Smooth minimization of non-smooth functions
  • Y. Nesterov
  • Mathematics, Computer Science
  • Math. Program.
  • 2005
Just relax: convex programming methods for identifying sparse signals in noise
  • J. Tropp
  • Mathematics, Computer Science
  • IEEE Transactions on Information Theory
  • 2006
Iterative solution of nonlinear equations in several variables
Atomic Decomposition by Basis Pursuit
...
1
2
3
4
...