Adaptive limited memory bundle method for bound constrained large-scale nonsmooth optimization

Optimization

Volumn 59, Issue 6, 2010, Pages 945-962

  Karmitsa, N ^a   Makela M M ^a  

^a UNIVERSITY OF TURKU   (Finland)

Author keywords

Box constraints; Bundle methods; Large scale optimization; Limited memory methods; Nondifferentiable programming; Variable metric methods

Indexed keywords

EID: 77954839752     PISSN: 02331934     EISSN: 10294945     Source Type: Journal    
DOI: 10.1080/02331930902884398     Document Type: Article

References (35)

1. A.V. Aho, J.E. Hopcroft, and J.D. Ullman, The Design and Analysis of Computer Algorithms, Addison-Wesley Publishing Company, Inc., Reading, MA, 1974.
2. A. Ben-Tal and A. Nemirovski, Non-Euclidean restricted memory level method for large-scale convex optimization, Math. Prog. 102 (2005), pp. 407-456.
3. R.H. Byrd, P. Lu, J. Nocedal, and C. Zhu, A limited memory algorithm for bound constrained optimization, SIAM J. Sci. Comput. 16 (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. Prog. 63 (1994), pp. 129-156.
5. F.H. Clarke, Optimization and Nonsmooth Analysis, Wiley-Interscience, New York, 1983.
6. 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. Num. Anal. 25 (1988), pp. 433-460.
7. 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 (1988), pp. 399-430.
8. E.D. Dolan and J.J. Moré, Benchmarking optimization software with performance profiles, Math. Prog. 91 (2002), pp. 201-213.
9. R. Fletcher, Practical Methods of Optimization, 2nd ed., John Wiley and Sons, Chichester, 1987.
10. J.-C. Gilbert and C. Lemarechal, Some numerical experiments with variable-storage quasi-Newton algorithms, Math. Prog. 50 (1989), pp. 407-435.
11. D.E. Goldberg, Genetic Algorithms in Search, Optimization, and Machine Learning, Addison-Wesley Publishing Company, Inc, Reading, MA, 1998.
12. M. Haarala, Large-scale nonsmooth optimization: Variable metric bundle method with limited memory. PhD thesis, Department of Mathematical Information Technology, University of Jyvaskyla, 2004.
13. M. Haarala, K. Miettinen, and M.M. Mäkelä, New limited memory bundle method for large-scale nonsmooth optimization, Opt. Meth. Softw. 19 (2004), pp. 673-692.
14. N. Haarala, K. Miettinen, and M.M. Makela, Globally convergent limited memory bundle method for large-scale nonsmooth optimization, Math. Prog. A 109 (2007), pp. 181-205.
15. J.-B. Hiriart-Urruty and C. Lemarechal, Convex Analysis and Minimization Algorithms II, Springer-Verlag, Berlin, 1993.
16. T. Kärkkäinen, K. Majava, and M.M. Mäkelä, Comparison of formulations and solution methods for image restoration problems, Inverse Prob. 17 (2001), pp. 1977-1995.
17. K.C. Kiwiel, Methods of Descent for Nondifferentiable Optimization. Lecture Notes in Mathematics Vol. 1133, Springer-Verlag, Berlin, 1985.
18. K.C. Kiwiel, A method of linearizations for linearly constrained nonconvex nonsmooth minimization, Math. Prog. 34 (1986), pp. 175-187.
19. K.C. Kiwiel, A constraint linearization method for nondifferentiable convex minimization, Numeriche Mathematik 51 (1987), pp. 395-414.
20. K.C. Kiwiel, A projection-proximal bundle method for convex nondifferentiable minimization, in Ill-posed Variational Problems and Regularization Techniques M. Théra and R. Tichatschke, eds., Lecture Notes in Economics and Mathematical Systems 477, Springer-Verlag, Berlin, 1999, pp. 137-150.
21. K.C. Kiwiel, A proximal-projection bundle method for Lagrangian relaxation, including semidefinite programming, SIAM J. Optimization 17 (2006), pp. 1015-1034.
22. C. Lemaréchal, Nondifferentiable optimization. in Optimization, G.L. Nemhauser, A.H.G. Rinnooy Kan, and M.J. Todd, eds., Elsevier North-Holland, Inc., New York, 1989, pp. 529-572.
23. C. Lemarechal, 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-281.
24. D.C. Liu and J. Nocedal, On the limited memory BFGS method for large scale optimization, Math. Prog. 45 (1989), pp. 503-528.
25. L. Luksan and J. Vlcek, Globally convergent variable metric method for convex nonsmooth unconstrained minimization, J. Optimization Theory Appl. 102 (1999), pp. 593-613.
26. M.M. Makela, 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.
27. M.M. Makela, M. Miettinen, L. Lukšan, and J. Vlček, Comparing nonsmooth nonconvex bundle methods in solving hemivariational inequalities, J. Global Optimization 14 (1999), pp. 117-135.
28. M.M. Mäkelä and P. Neittaanmäki, Nonsmooth Optimization: Analysis and Algorithms with Applications to Optimal Control, World Scientific Publishing Co, Singapore, 1992.
29. R. Mifflin, A modification and an extension of Lemaréchal's algorithm for nonsmooth minimization, Math. Prog. Stud. 17 (1982), pp. 77-90.
30. Z. Naniewicz and P.D. Panagiotopoulos, Mathematical Theory of Hemivariational Inequalities and Applications, Marcel Dekker, New York, 1995.
31. J. Nocedal, Updating quasi-Newton matrices with limited storage, Math. Comput. 35 (1980), pp. 773-782.
32. P.D. Panagiotopoulos, Hemivariational Inequalities, Springer-Verlag, New York, 1993.
33. E.R. Panier, An active set method for solving linearly constrained nonsmooth optimization problems, Math. Prog. 37 (1987), pp. 269-292.
34. H. Schramm and J. Zowe, A version of the bundle idea for minimizing a nonsmooth function: Conceptual idea, convergence analysis, numerical results, SIAM J. Optimization 2 (1992), pp. 121-152.
35. J. Vlček and L. Luksan, Globally convergent variable metric method for nonconvex nondifferentiable unconstrained minimization, J. Optimization Theory Appl. 111 (2001), pp. 407-430.