Bundle-level type methods uniformly optimal for smooth and nonsmooth convex optimization
Author:
- 29 December 2013
- journal article
- research article
- Published by Springer Nature in Mathematical Programming
- Vol. 149 (1-2) , 1-45
Abstract
No abstract availableKeywords
All Related Versions
This publication has 29 references indexed in Scilit:
- Validation analysis of mirror descent stochastic approximation methodMathematical Programming, 2011
- An optimal method for stochastic composite optimizationMathematical Programming, 2011
- Primal-dual first-order methods with ${\mathcal {O}(1/\epsilon)}$ iteration-complexity for cone programmingMathematical Programming, 2009
- Excessive Gap Technique in Nonsmooth Convex MinimizationSIAM Journal on Optimization, 2005
- Smooth minimization of non-smooth functionsMathematical Programming, 2004
- Non-euclidean restricted memory level method for large-scale convex optimizationMathematical Programming, 2004
- Prox-Method with Rate of Convergence O(1/t) for Variational Inequalities with Lipschitz Continuous Monotone Operators and Smooth Convex-Concave Saddle Point ProblemsSIAM Journal on Optimization, 2004
- Monte Carlo bounding techniques for determining solution quality in stochastic programsOperations Research Letters, 1999
- An extension of davidon methods to non differentiable problems1975
- Newton's method for convex programming and Tchebycheff approximationNumerische Mathematik, 1959