Nesterov, Yurii
[UCL]
In this paper we present a new approach for constructing subgradient schemes for different types of nonsmooth problems with convex structure. Our methods are primal-dual since they are always able to generate a feasible approximation to the optimum of an appropriately formulated dual problem. Besides other advantages, this useful feature provides the methods with a reliable stopping criterion. The proposed schemes differ from the classical approaches (divergent series methods, mirror descent methods) by presence of two control sequences. The first sequence is responsible for aggregating the support functions in the dual space, and the second one establishes a dynamically updated scale between the primal and dual spaces. This additional flexibility allows to guarantee a boundedness of the sequence of primal test points even in the case of unbounded feasible set (however, we always assume the uniform boundedness of subgradients). We present the variants of subgradient schemes for nonsmooth convex minimization, minimax problems, saddle point problems, variational inequalities, and stochastic optimization. In all situations our methods are proved to be optimal from the view point of worst-case black-box lower complexity bounds.
- Auslender A. and Teboulle M. (2005). Interior projection-like methods for monotone variational inequalities. Math. Program. 104(1): 39–68
- Andersen S.P., de Palma A. and Thisse J.-F. (1992). Discrete choice theory of product differentiation. MIT Press, Cambridge
- Anstreicher, K., Wolsey, L.: On dual solutions in subgradient optimization. Math. Program. (in press)
- Beck A. and Teboulle M. (2003). Mirror descent and nonlinear projected subgradient methods for convex optimization. Oper. Res. Lett. 31: 167–175
- Ben-Tal Aharon, Margalit Tamar, Nemirovski Arkadi, The Ordered Subsets Mirror Descent Optimization Method with Applications to Tomography, 10.1137/s1052623499354564
- Ermoliev Yu.M. (1966). Methods for solving nonlinear extremal problems. Kibernetika 4: 1–17
- Hiriart-Urruty. J.-B., Lemarecha, C.: Convex analysis and minimization algorithms, vol. I–II. Springer, Berlin (1993)
- Nemirovski Arkadi, Prox-Method with Rate of Convergence O(1/t) for Variational Inequalities with Lipschitz Continuous Monotone Operators and Smooth Convex-Concave Saddle Point Problems, 10.1137/s1052623403425629
- Nemirovski A. and Yudin D. (1983). Problem Complexity and Method Efficiency in Optimization. Wiley,
- Nesterov Yurii, Introductory Lectures on Convex Optimization, ISBN:9781461346913, 10.1007/978-1-4419-8853-9
- Nesterov Yu. (2005). Smooth minimization of nonsmooth functions (CORE Discussion Paper #2003/12, CORE 2003). Math. Program. 103(1): 127–152
- Nesterov Yu., Excessive Gap Technique in Nonsmooth Convex Minimization, 10.1137/s1052623403422285
- Nesterov, Yu.: Dual extrapolation and its applications for solving variational inequalities and related problems (CORE Discussion Paper #2003/68, CORE 2003). Math. Program. doi: 10.1007/s10107-006-0034-z
- Nesterov, Yu., Vial, J.-Ph.: Confidence level solutions for stochastic programming. CORE Discussion Paper #2000/13, CORE 2000
- Ortega J.M. and Reinboldt W.C. (1970). Iterative Solution of Nonlinear Equations in Several Variables. Academic Press, New York
- Polyak B.T. (1967). A general method of solving extremum problems. Soviet Mat. Dokl. 8: 593–597
- Shor Naum Zuselevich, Minimization Methods for Non-Differentiable Functions, ISBN:9783642821202, 10.1007/978-3-642-82118-9
| Bibliographic reference |
Nesterov, Yurii. Primal-dual subgradient methods for convex problems. In: Mathematical Programming, Vol. 120, no. 1, p. 221-259 (August 2009) |
| Permanent URL |
http://hdl.handle.net/2078.1/94935 |
