First-order methods of smooth convex optimization with inexact oracle

Mathematical Programming

Volumn 146, Issue 1-2, 2014, Pages 37-75

  Devolder, Olivier ^a   Glineur, François ^a   Nesterov, Yurii ^a  

^a UNIVERSITÉ CATHOLIQUE DE LOUVAIN   (Belgium)

Author keywords

Complexity bounds; Fast gradient methods; First order methods; Gradient methods; Inexact oracle; Smooth convex optimization

Indexed keywords

GRADIENT METHODS;

AUGMENTED LAGRANGIANS; COMPLEXITY BOUNDS; COMPLEXITY ESTIMATES; FAST GRADIENT METHODS; FIRST-ORDER METHODS; INEXACT ORACLE; MOREAU-YOSIDA REGULARIZATION; SMOOTHING TECHNIQUES;

CONVEX OPTIMIZATION;

EID: 84905567870     PISSN: 00255610     EISSN: 14364646     Source Type: Journal    
DOI: 10.1007/s10107-013-0677-5     Document Type: Article

References (20)

1. Baes, M.: Estimate Sequence Methods: Extensions and Approximations. IFOR Internal report, ETH Zurich, Switzerland (2009)
2. Correa, R.; Lemarechal, C.: Convergence of some algorithms for convex minimization. Math. Program. Ser. A 62, 261-275 (1993)
3. D'Aspremont, A.: Smooth optimization with approximate gradient. SIAM J. Optim. 19, 1171-1183 (2008)
4. Devolder, O.; Glineur, F.; Nesterov, Y.: Double smoothing technique for large-scale linearly constrained convex optimization. SIAM J. Optim. 22(2), 702-727 (2012)
5. Hintermuller, M.: A proximal bundle method based on approximative subgradient. Comput. Optim. Appl. 20, 245-266 (2001)
6. Kiwiel, K.: A proximal bundel method with approximative subgradient linearization. SIAM J. Optim. 16, 1007-1023 (2006)
7. Khachiyan, L.; Nemirovskii, A.; Nesterov, Y.: Optimal methods of convex programming and polynomial methods of linear programming. In: Elster, H. (ed.) Modern Mathematical Methods of Optimization, pp. 75-115. Akademie Verlag, Berlin (1993)
8. Lan, G.: An optimal method for stochastic composite optimization. Math. Program. Ser. A 133(1-2), 365-397 (2012)
9. Nedic, A.; Bertsekas, D.: The effect of deterministic noise in subgradient methods. Math. Program. Ser. A 125, 75-99 (2010)
10. Nemirovskii, A.; Nesterov, Y.: Optimal methods for smooth convex minimization. Zh. Vichisl. Mat. Fiz. (In Russian) 25(3), 356-369 (1985)
11. Nemirovskii, A.; Yudin, D.: Problem Complexity and Method Efficiency in Optimization. Wiley, New York (1983)
12. Nesterov, Y.: A method for unconstrained convex minimization with the rate of convergence of O (1 k 2). Doklady AN SSSR 269, 543-547 (1983)
13. Nesterov, Y.: On an approach to the construction of optimal methods of minimization of smooth convex function. Èkonom. i. Mat. Metody (In Russian) 24, 509-517 (1988)
14. Nesterov, Y.: Introductory Lectures on Convex Optimization: A Basic Course. Kluwer, Dordrecht (2004)
15. Nesterov, Y.: Smooth minimization of non-smooth functions. Math. Program. Ser. A 103, 127-152 (2005)
16. Nesterov, Y.: Excessive gap technique in nonsmooth convex minimization. SIAM J. Optim. 16, 235-249 (2005)
17. Nesterov, Y.: Smoothing technique and its applications in semidefinite optimization. Math. Program. A 110, 245-259 (2007)
18. Nesterov, Y.: Gradient methods for minimizing composite objective function. Math. Program. Ser. B. doi: 10.1007/s10107-012-0629-5 (2012)
19. Polyak, B.T.: Introduction to Optimization. Optimization Software Inc, New York (1987)
20. Shor, N.Z.: Minimization Methods for Non-Differentiable Functions. Springer Series in Computational Mathematics. Springer, Berlin (1985)