Identifying structure of nonsmooth convex functions by the bundle technique

SIAM Journal on Optimization

Volumn 20, Issue 2, 2009, Pages 820-840

  Daniilidis, Aris ^a   Sagastizábal, Claudia ^b,c   Solodov, Mikhail ^c  

^a UNIVERSITAT AUTÒNOMA DE BARCELONA   (Spain)

^b CEPEL   (Brazil)

^c IMPA   (Brazil)

Author keywords

Bundle method; Nonsmooth convex optimization; Partial smoothness; Primal dual gradient structure; Proximal point; VU decomposition

Indexed keywords

BUNDLE METHODS; GRADIENT STRUCTURE; NON-SMOOTH; NONSMOOTH CONVEX OPTIMIZATION; PRIMAL-DUAL; PROXIMAL POINTS; VU-DECOMPOSITION;

FUNCTIONS; OPTIMIZATION;

CONVEX OPTIMIZATION;

EID: 70450219115     PISSN: 10526234     EISSN: None     Source Type: Journal    
DOI: 10.1137/080729864     Document Type: Article

References (27)

1. J. F. BONNANS, J. C. GILBERT, C. LEMARÉCHAL, AND C. SAGASTIZÁBAL, Numerical Optimization: Theoretical and Practical Aspects, 2nd ed., Springer-Verlag, Berlin, 2006.
2. X. CHEN AND M. FUKUSHIMA, Proximal quasi-Newton methods for nondifferentiable convex optimization, Math. Program., 85 (1999), pp. 313-334.
3. R. CORREA AND C. LEMARÉCHAL, Convergence of some algorithms for convex minimization, Math. Program., 62 (1993), pp. 261-275.
4. A. DANIILIDIS, W. HARE, AND J. MALICK, Geometrical interpretation of the predictor-corrector type algorithms in structured optimization problems, Optimization, 55 (2006), pp. 481-503.
5. E. D. DOLAN AND J. J. MORÉ, Benchmarking optimization software with performance profiles, Math. Program., 91 (2002), pp. 201-213.
6. R. FLETCHER, S. LEYFFER, D. RALPH, AND S. SCHOLTES, Local convergence of SQP methods for mathematical programs with equilibrium constraints, SIAM J. Optim., 17 (2006), pp. 259-286.
7. W. HARE, Nonsmooth Optimization with Smooth Substructure, Ph. D. thesis, Department of Mathematics, Simon Fraser University, Burnaby, BC, Canada, 2003.
8. W. L. HARE AND A. S. LEWIS, Identifying active manifolds, Algorithmic Oper. Res., 2 (2007), pp. 75-82.
9. W. HARE AND C. SAGASTIZÁBAL, Benchmark of some nonsmooth optimization solvers for computing nonconvex proximal points, Pac. J. Optim., 3 (2006), pp. 545-573.
10. W. HARE AND C. SAGASTIZÁBAL, Computing proximal points of nonconvex functions, Math. Program., 116 (2009), pp. 221-258.
11. J.-B. HIRIART-URRUTY AND C. LEMARÉCHAL, Convex Analysis and Minimization Algorithms, Springer-Verlag, Berlin, 1993.
12. K. C. KIWIEL, Methods of Descent for Nondifferentiable Optimization, Lecture Notes in Math. 1133, Springer-Verlag, Berlin, 1985.
13. C. LEMARÉCHAL, Lagrangian relaxation, in Computational Combinatorial Optimization, Lecture Notes in Comput. Sci. 2241, Springer-Verlag, Berlin, 2001, pp. 112-156.
14. C. LEMARÉCHAL, F. OUSTRY, AND C. SAGASTIZÁBAL, The u-Lagrangian of a convex function, Trans. Amer. Math. Soc., 352 (2000), pp. 711-729.
15. C. LEMARÉCHAL AND C. SAGASTIZÁBAL, An approach to variable metric bundle methods, in System Modelling and Optimization, Lecture Notes in Control and Inform. Sci. 197, J. Henry and J.-P. Yvon, eds., Springer-Verlag, Berlin, 1994, pp. 144-162.
16. C. LEMARÉCHAL AND C. SAGASTIZÁBAL, Variable metric bundle methods: From conceptual to implementable forms, Math. Program., 76 (1997), pp. 393-410.
17. A. S. LEWIS, Active sets, nonsmoothness, and sensitivity, SIAM J. Optim., 13 (2002), pp. 702-725.
18. J. MALICK AND S. MILLER, Newton methods for nonsmooth convex minimization: Connection among U-Lagrangian, Riemannian Newton and SQP methods, Math. Program., 104 (2004), pp. 609-633.
19. R. MIFFLIN, A quasi-second-order proximal bundle algorithm, Math. Program., 73 (1996), pp. 51-72.
20. R. MIFFLIN AND C. SAGASTIZÁBAL, On vu-theory for functions with primal-dual gradient structure, SIAM J. Optim., 11 (2000), pp. 547-571.
21. R. MIFFLIN AND C. SAGASTIZÁBAL, Proximal points are on the fast track, J. Convex Anal., 9 (2002), pp. 563-579.
22. R. MIFFLIN AND C. SAGASTIZÁBAL, Primal-dual gradient structured functions: Second-order results; links to epi-derivatives and partly smooth functions, SIAM J. Optim., 13 (2003), pp. 1174-1194.
23. R. MIFFLIN AND C. SAGASTIZÁBAL, VU-SMOOTHNESS AND PROXIMAL POINT RESULTS FOR SOME NONCONVEX FUNCTIONS, Optim. Methods Softw., 19 (2004), pp. 463-478.
24. R. MIFFLIN AND C. SAGASTIZÁBAL, A VU-algorithm for convex minimization, Math. Program., 104 (2005), pp. 583-608.
25. L. QI AND X. CHEN, A preconditioning proximal Newton's method for nondifferentiable convex optimization, Math. Program., 76 (1995), pp. 411-430.
26. A. SHAPIRO, On a class of nonsmooth composite functions, Math. Oper. Res., 28 (2003), pp. 677-692.
27. S. J. WRIGHT, Identifiable surfaces in constrained optimization, SIAM J. Control Optim., 31 (1993), pp. 1063-1079.