Limited memory bundle method for large bound constrained nonsmooth optimization: Convergence analysis

Optimization Methods and Software

Volumn 25, Issue 6, 2010, Pages 895-916

  Karmitsa, Napsu ^a   Mäkelä, Marko M ^a  

^a UNIVERSITY OF TURKU   (Finland)

Author keywords

box constraints; bundle methods; global convergence; large scale optimization; limited memory methods; nondifferentiable programming

Indexed keywords

BOX CONSTRAINTS; BUNDLE METHODS; GLOBAL CONVERGENCE; LARGE-SCALE OPTIMIZATION; LIMITED-MEMORY METHODS; NON-DIFFERENTIABLE PROGRAMMING;

CONSTRAINED OPTIMIZATION;

EID: 77955578397     PISSN: 10556788     EISSN: 10294937     Source Type: Journal    
DOI: 10.1080/10556780902842495     Document Type: Conference Paper

References (34)

1. A. Ben-Tal and A. Nemirovski, Non-Euclidean restricted memory level method for large-scale convex optimization, Math. Program. 102(3) (2005), pp. 407-456.
2. A. Bihain, Optimization of upper semidifferentiable functions, J. Optim. Theory Appl. 4 (1984), pp. 545-568.
3. R.H. Byrd, P. Lu, J. Nocedal, and C.Zhu, A limited memory algorithm for bound constrained optimization, SIAM J. Sci. Comput. 16(5) (1995), pp. 1190-1208.
4. R.H. Byrd, J. Nocedal, and R.B. Schnabel, Representations of quasi-Newton matrices and their use in limited memory methods, Math. Program. 63 (1994), pp. 129-156.
5. F.H. Clarke, Optimization and Nonsmooth Analysis,Wiley-Interscience, NewYork, 1983.
6. F.H. Clarke, Y.S. Ledyaev, R.J. Stern, and P.R.Wolenski, Nonsmooth Analysis and Control Theory, Springer, New York, 1998.
7. A.R. Conn, N.I.M. Gould, and P.L. Toint, Global convergence of a class of trust region algorithms for optimization with simple bounds, SIAM J. Numer. Anal. 25(2) (1988), pp. 433-460.
8. A.R. Conn, N.I.M. Gould, and P.L.Toint, Testing a class of methods for solving minimization problems with simple bounds on the variables, Math. Comput. 50(182) (1988), pp. 399-430.
9. E.D. Dolan and J.J. Moré, Benchmarking optimization software with performance profiles,Math. Program. 91 (2002), pp. 201-213.
10. R. Fletcher, Practical Methods of Optimization, 2nd ed., JohnWiley and Sons, Chichester, 1987.
11. J.-C. Gilbert and C. Lemaréchal, Some numerical experiments with variable-storage quasi-Newton algorithms,Math. Program. 45 (1989), pp. 407-435.
12. M. Haarala, Large-scale nonsmooth optimization: Variable metric bundle method with limited memory, Ph.D. thesis, Department of Mathematical Information Technology, University of Jyväskylä, 2004.
13. M. Haarala, K. Miettinen, and M.M. Mäkelä, New limited memory bundle method for large-scale nonsmooth optimization, Optim. Methods Softw. 19(6) (2004), pp. 673-692.
14. N. Haarala, K. Miettinen, and M.M. Mäkelä, Globally convergent limited memory bundle method for large-scale nonsmooth optimization, Math. Program. 109(1) (2007), pp. 181-205.
15. J.-B. Hiriart-Urruty and C. Lemaréchal, Convex Analysis and Minimization Algorithms I, Springer-Verlag, Berlin, 1993.
16. J.-B. Hiriart-Urruty and C. Lemaréchal, Convex Analysis and Minimization Algorithms II, Springer-Verlag, Berlin, 1993.
17. T. Kärkkäinen, K. Majava, and M.M. Mäkelä, Comparison of formulations and solution methods for image restoration problems, Inverse Problems 17(6) (2001), pp. 1977-1995.
18. N. Karmitsa and M.M. Mäkelä, Globally convergent limited memory bundle algorithm for nondifferentiable programming subject to box constraints, TUCS Tech. Rep. No.882, Turku Centre for Computer Science, Turku, 2008.
19. N. Karmitsa and M.M. Mäkelä, Adaptive limited memory bundle method for bound constrained large-scale nonsmooth optimization, Optimization (to appear).
20. K.C. Kiwiel, Methods of Descent for Nondifferentiable Optimization, Lecture Notes in Mathematics Vol. 1133, Springer-Verlag, Berlin, 1985.
21. C. Lemaréchal, J.-J.Strodiot, and A. Bihain, On a bundle algorithm for nonsmooth optimization, in Nonlinear Programming, O.L. Mangasarian, R.R. Mayer, and S.M. Robinson, eds., Academic Press, New York, 1981, pp. 285-1281
22. D.C. Liu and J. Nocedal, On the limited memory BFGS method for large scale optimization, Math. Program. 45 (1989), pp. 503-528.
23. L. Lukšan and J. Vlček, Globally convergent variable metric method for convex nonsmooth unconstrained minimization, J. Optim. Theory Appl. 102(3) (1999), pp. 593-613.
24. M.M. Mäkelä, Survey of bundle methods for nonsmooth optimization, Optim. Methods Softw. 17(1) (2002), pp. 1-29.
25. M.M. Mäkelä, Multiobjective proximal bundle method for nonconvex nonsmooth optimization: Fortran subroutine MPBNGC 2.0, Reports of the Department of Mathematical Information Technology Series B, Scientific Computing B. 13/2003, University of Jyväskylä, Jyväskylä, 2003.
26. M.M. Mäkelä and P. Neittaanmäki, Nonsmooth Optimization: Analysis and Algorithms with Applications to Optimal Control,World Scientific Publishing Co., Singapore, 1992.
27. R. Mifflin, A modification and an extension of Lemaréchal's algorithm for nonsmooth minimization, Math. Program. Study 17 (1982), pp. 77-90.
28. E.S. Mistakidis and G.E. Stavroulakis, Nonconvex Optimization in Mechanics: Smooth and Nonsmooth Algorithms, Heuristics and Engineering Applications by the F.E.M., Kluwer Academic Publishers, Dordrecht, 1998.
29. J.J. Moreau, P.D. Panagiotopoulos, and G. Strang, eds., Topics in Nonsmooth Mechanics, Birkhäuser Verlag, Basel, 1988.
30. J. Nocedal, Updating quasi-Newton matrices with limited storage, Math. Comput. 35(151) (1980), pp. 773-782.
31. J. Outrata, M. Kočvara, and J. Zowe, Nonsmooth Approach to Optimization ProblemsWith Equilibrium Constraints: Theory, Applications and Numerical Results, Kluwer Academic Publisher, Dordrecht, 1998.
32. E.R. Panier, An active set method for solving linearly constrained nonsmooth optimization problems, Math. Program. 37 (1987), pp. 269-292.
33. H. Schramm and J. Zowe, A version of the bundle idea for minimizing a nonsmooth function: Conceptual idea, convergence analysis, numerical results, SIAM J. Optim. 2(1) (1992), pp. 121-152.
34. J. Vlček and L. Lukšan, Globally convergent variable metric method for nonconvex nondifferentiable unconstrained minimization, J. Optim. Theory Appl. 111(2) (2001), pp. 407-430.