An optimal algorithm for constrained differentiable convex optimization

SIAM Journal on Optimization

Volumn 23, Issue 4, 2013, Pages 1939-1955

  Gonzaga, Clóvis C ^a   Karas, Elizabeth W ^b   Rossetto, Diane R ^c  

^a FEDERAL UNIVERSITY OF SANTA CATARINA   (Brazil)

^b FEDERAL UNIVERSITY OF PARANÁ   (Brazil)

^c UNIVERSITY OF SÃO PAULO   (Brazil)

Author keywords

Constrained convex optimization; Optimal method

Indexed keywords

ADAPTIVE PROCEDURE; COMPLEXITY ANALYSIS; CONSTRAINED CONVEX OPTIMIZATIONS; CONVEX OPTIMIZATION PROBLEMS; GEOMETRIC APPROACHES; LIPSCHITZ CONSTANT; OPTIMAL METHODS; STRONG CONVEXITIES;

CONVEX OPTIMIZATION; OPTIMIZATION;

ALGORITHMS;

EID: 84892875549     PISSN: 10526234     EISSN: None     Source Type: Journal    
DOI: 10.1137/110836602     Document Type: Article

References (11)

1. A. Auslender and M. Teboulle, Interior gradient and proximal methods for convex and conic optimization, SIAM J. Optim., 16 (2006), pp. 697-725.
2. D. P. Bertsekas, Nonlinear Programming, Athena Scientific, Belmont, MA, 1995.
3. E. G. Birgin, J. M. Martínez, and M. Raydan, Algorithm SPG-software for convexconstrained optimization, ACM Trans. Math. Software, 27 (2001), pp. 340-349.
4. E. D. Dolan and J. J. Moré, Benchmarking optimization software with performance profiles, Math. Program. Ser. A, 91 (2002), pp. 201-213.
5. C. C. Gonzaga and E. W. Karas, Fine tuning Nesterov's steepest descent algorithm for differentiable convex programming, Math. Program. Ser. A, 138 (2013), pp. 141-166.
6. C. T. Kelley, Iterative Methods for Optimization, SIAM, Philadelphia, 1999.
7. G. Lan, Z. Lu, and R. D. C. Monteiro, Primal-dual first-order methods with O(1/∈) iterationcomplexity for cone programming, Math. Program. Ser. A, 126 (2011), pp. 1-29.
8. A. S. Nemirovsky and D. B. Yudin, Problem Complexity and Method Efficiency in Optimization, John Wiley, New York, 1983.
9. Y. Nesterov, Introductory Lectures on Convex Optimization. A Basic Course, Kluwer Academic, Boston, 2004.
10. Y. Nesterov, Gradient methods for minimizing composite objective function, Math. Program. Ser. B, 140 (2013), pp. 125-161.
11. D. R. Rossetto, Tópicos em métodos ótimos para otimização convexa, Ph.D. thesis, Department of Applied Mathematics, University of São Paulo, Brazil, 2012.