New Computational Guarantees for Solving Convex Optimization Problems with First Order Methods, via a Function Growth Condition Measure

B. Polyak, Sharp minima , Proceedings of the IIASA Workshop on Generalized Lagrangians and Their Applications, Laxenburg, Austria. Institute of Control Sciences Lecture Notes, Moscow, 1979

1979

Earlier work this paper cites.

A. S. Nemirovsky and D. B. Yudin, Problem complexity and method efficiency in optimization , Wiley, New York, 1983

1983

Earlier work this paper cites.

B. Polyak, Introduction to optimization , Optimization Software, Inc., New York, 1987

1987

Earlier work this paper cites.

Alexander Shapiro, Perturbation theory of nonlinear programs when the set of optimal solutions is not a singleton , Applied Mathematics and Optimization 18

1988

Earlier work this paper cites.

Michael C. Ferris, Finite termination of the proximal point algorithm , Mathematical Programming 50

1991

Earlier work this paper cites.

J. V. Burke and M.C. Ferris, Weak sharp minima in mathematical programming , SIAM Journal on Control and Optimization 31

1993

Earlier work this paper cites.

J. Frederic Bonnans and Alexander D. Ioffe, Quadratic growth and stability in convex programming problems with multiple solutions , Tech. report, INRIA Research Report RR-2403, 1994

1994

Earlier work this paper cites.

James V. Burke and Michael C. Ferris, A Gauss-Newton method for convex composite optimization , Mathematical Programming 71

1995

Cited alongside, same era.

Abderrahim Jourani, Hoffman’s error bound, local controllability, and sensitivity analysis , SIAM Journal on Control and Optimization 38

2000

Cited alongside, same era.

James V. Burke, Adrian S. Lewis, and Michael L. Overton, Optimal stability and eigenvalue multiplicity , Foundations of Computational Mathematics 1

2001

Cited alongside, same era.

James V. Burke and Sien Deng, Weak sharp minima revisited, part I: basic theory , Control and Cybernetics 31

2002

Cited alongside, same era.

Y.E. Nesterov, Introductory lectures on convex optimization: a basic course , Kluwer Academic Publishers, Boston, 2003

2003

Cited alongside, same era.

Yurii Nesterov, Smoothing technique and its applications in semidefinite optimization , Mathematical Programming 110

2007

Later among the works it cites.

P. Tseng, On accelerated proximal gradient methods for convex-concave optimization , Tech. report, May 21, 2008

2008

Later among the works it cites.

Trevor Hastie, Robert Tibshirani, and Jerome Friedman, Elements of statistical learning , second ed., Springer Series in Statistics, Springer, New York, 2009

2009

Later among the works it cites.

Amir Beck and Marc Teboulle, Smoothing and first order methods: A unified framework , SIAM Journal on Optimization 22

2012

Later among the works it cites.

Brendan O’Donoghue and Emmanuel Candes, Adaptive restart for accelerated gradient schemes , Foundations of Computational Mathematics 15

2013

Later among the works it cites.