Comparing different nonsmooth minimization methods and software

Optimization Methods and Software

Volumn 27, Issue 1, 2012, Pages 131-153

  Karmitsa, N ^a   Bagirov, A ^b   Makela M M ^a  

^a UNIVERSITY OF TURKU   (Finland)

^b UNIVERSITY OF BALLARAT   (Australia)

Author keywords

bundle methods; nondifferentiable optimization; numerical performance; subgradient methods

Indexed keywords

BLACK BOX METHOD; BUNDLE METHODS; DIFFERENT SIZES; MAIN GROUP; MINIMIZATION METHODS; NON-DIFFERENTIABLE OPTIMIZATION; NON-SMOOTH; NONCONVEX PROBLEM; NONSMOOTH OPTIMIZATION; NUMERICAL PERFORMANCE; PIECEWISE LINEAR; QUADRATIC PROBLEM; SUBGRADIENT METHODS; TEST SETS;

OPTIMIZATION; PIECEWISE LINEAR TECHNIQUES;

NUMERICAL METHODS;

EID: 84855936518     PISSN: 10556788     EISSN: 10294937     Source Type: Journal    
DOI: 10.1080/10556788.2010.526116     Document Type: Article

References (52)

1. S. Äyrämö, Knowledge mining using robust clustering, Ph.D. thesis, University of Jyväskylä, Department of Mathematical Information Technology, 2006.
2. A.M. Bagirov, Continuous subdifferential approximations and their applications, J. Math. Sci. 115(5) (2003), pp. 2567-2609. (Pubitemid 36446917)
3. A.M. Bagirov and A.N. Ganjehlou, A quasisecant method for minimizing nonsmooth functions, Optim. Methods Softw. 25(1) (2010), pp. 3-18.
4. A.M. Bagirov, B. Karasozen, and M. Sezer, Discrete gradient method: A derivative free method for nonsmooth optimization, J. Optim. Theory Appl. 137 (2008), pp. 317-334.
5. A. Beck and M. Teboulle, Mirror descent and nonlinear projected subgradient methods for convex optimization, Oper. Res. Lett. 31(3) (2003), pp. 167-175.
6. 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. (Pubitemid 40536649)
7. A. Bihain, Optimization of upper semidifferentiable functions, J. Optim. Theory Appl. 4 (1984), pp. 545-568.
8. P.S. Bradley, U.M. Fayyad, and O.L. Mangasarian, Mathematical programming for data mining: Formulations and challenges, INFORMS J. Comput. 11 (1999), pp. 217-238.
9. J.V. Burke, A.S. Lewis, and M.L. Overton, A robust gradient sampling algorithm for nonsmooth, nonconvex optimization, SIAM J. Optim. 15 (2005), pp. 751-779. (Pubitemid 41156914)
10. 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.
11. F.H. Clarke, Optimization and Nonsmooth Analysis,Wiley-Interscience, NewYork, 1983.
12. F.H. Clarke,Y.S. Ledyaev, R.J. Stern, and P.R. Wolenski, Nonsmooth Analysis and Control Theory, Springer, New York, 1998.
13. V.F. Demyanov, A.M. Bagirov, and A.M. Rubinov, A method of truncated codifferential with application to some problems of cluster analysis, J. Global Optim. 23(1) (2002), pp. 63-80.
14. E.D. Dolan and J.J. Moré, Benchmarking optimization software with performance profiles,Math. Program. 91 (2002), pp. 201-213. (Pubitemid 44744777)
15. A. Fuduli, M. Gaudioso, and G. Giallombardo, A DC piecewise affine model and a bundling technique in nonconvex nonsmooth minimization, Optim. Methods Softw. 19(1) (2004), pp. 89-102.
16. A. Fuduli, M. Gaudioso, and G. Giallombardo, Minimizing nonconvex nonsmooth functions via cutting planes and proximity control, SIAM J. Optim. 14(3) (2004), pp. 743-756. (Pubitemid 39073310)
17. M. Gaudioso and M.F. Monaco, Variants to the cutting plane approach for convex nondifferentiable optimization, Optimization 25 (1992), pp. 65-75.
18. M. Haarala, Large-scale nonsmooth optimization: Variable metric bundle method with limited memory, Ph.D. thesis, University of Jyväskylä, Department of Mathematical Information Technology, 2004.
19. 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.
20. 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. (Pubitemid 44874471)
21. W. Hare and C. Sagastizábal, A redistributed proximal bundle method for nonconvex optimization, 2009. Available at http://www.optimization- online.org/DB-HTML/2009/04/2273.html, 2009 (14 April 2010).
22. J. Haslinger and P. Neittaanmäki, Finite Element Approximation for Optimal Shape, Material and Topology Design, 2nd ed., JohnWiley and Sons, Chichester, 1996.
23. J.-B. Hiriart-Urruty and C. Lemaréchal, Convex Analysis and Minimization Algorithms II, Springer-Verlag, Berlin, 1993.
24. F. Kappel and A. Kuntsevich, An implementation of Shor's r-algorithm, Comput. Optim. Appl. 15 (2000), pp. 193-205.
25. T. Kärkkäinen and E. Heikkola, Robust formulations for training multilayer perceptrons, Neural Comput. 16 (2004), pp. 837-862. (Pubitemid 38318134)
26. N. Karmitsa, A. Bagirov, and M.M. Mäkelä, Empirical and theoretical comparisons of several nonsmooth minimization methods and software, TUCS Tech. Rep. No. 959, Turku Centre for Computer Science, Turku, 2009. Available at http://tucs.fi/publications/insight.php?id=tKaBaMa09a.
27. N. Karmitsa, M.M. Mäkelä, and M.M. Ali, Limited memory interior point bundle method for large inequality constrained nonsmooth minimization, Appl. Math. Comput. 198(1) (2008), pp. 382-400.
28. K.C. Kiwiel, Methods of Descent for Nondifferentiable Optimization, Lecture Notes in Mathematics 1133, Springer-Verlag, Berlin, 1985.
29. K.C. Kiwiel, Proximity control in bundle methods for convex nondifferentiable minimization, Math. Program. 46 (1990), pp. 105-122.
30. A. Kuntsevich and F. Kappel, SolvOpt-the Solver for Local Nonlinear Optimization Problems, Karl-Franzens University of Graz, Graz, Austria, 1997.
31. C. Lemaréchal, Nondifferentiable optimization, in Optimization, G.L. Nemhauser, A.H.G. Rinnooy Kan, and M.J. Todd, eds., Elsevier North-Holland, Inc., NewYork, 1989, pp. 529-572.
32. L. Lukšan, Dual method for solving a special problem of quadratic programming as a subproblem at linearly constrained nonlinear minmax approximation, Kybernetika 20 (1984), pp. 445-457.
33. L. Lukšan, M. Tuma, M. Šiška, J. Vlcek, and N. Ramešová, UFO, 2002. Interactive system for universal functional optimization, Tech. Rep. 883, Institute of Computer Science, Academy of Sciences of the Czech Republic, Prague, 2002.
34. L. Lukšan and J. Vlcek, A bundle-Newton method for nonsmooth unconstrained minimization, Math. Program. 83 (1998), pp. 373-391. (Pubitemid 128431420)
35. L. Lukšan and J. Vlcek, Globally convergent variable metric method for convex nonsmooth unconstrained minimization, J. Optim. Theory Appl. 102(3) (1999), pp. 593-613.
36. L. Lukšan and J. Vlcek, NDA: Algorithms for nondifferentiable optimization, Tech. Rep. 797, Institute of Computer Science, Academy of Sciences of the Czech Republic, Prague, 2000.
37. L. Lukšan and J. Vlcek, Test problems for nonsmooth unconstrained and linearly constrained optimization, Tech. Rep. 798, Institute of Computer Science, Academy of Sciences of the Czech Republic, Prague, 2000.
38. M.M. Mäkelä, Survey of bundle methods for nonsmooth optimization, Optim. Methods Softw. 17(1) (2002), pp. 1-29. (Pubitemid 35242106)
39. 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.
40. M.M. Mäkelä and P. Neittaanmäki, Nonsmooth Optimization: Analysis and Algorithms with Applications to Optimal Control,World Scientific Publishing Co., Singapore, 1992.
41. M.M. Mäkelä, M. Miettinen, L. Lukšan, and J. Vlcek, Comparing nonsmooth nonconvex bundle methods in solving hemivariational inequalities, J. Global Optim. 14 (1999), pp. 117-135. (Pubitemid 129617289)
42. K. Miettinen and M.M. Mäkelä, Synchronous approach in interactive multiobjective optimization, Eur. J. Oper. Res. 170(3) (2006), pp. 909-922. (Pubitemid 41607644)
43. E.S. Mistakidis and G.E. Stavroulakis, Nonconvex optimization in mechanics, in Smooth and Nonsmooth Algorithms, Heuristics and Engineering Applications by the F.E.M., Kluwer Academic Publishers, Dordrecht, 1998.
44. J.J. Moreau, P.D. Panagiotopoulos, and G. Strang (eds), Topics in Nonsmooth Mechanics, BirkhäuserVerlag, Basel, 1988.
45. D. Noll, O. Prot, andA. Rondepierre, A proximity control algorithm to minimize nonsmooth and nonconvex functions, Pac. J. Optim. 4(3) (2008), pp. 571-604.
46. J. Outrata, M. Köcvara, and J. Zowe, Nonsmooth Approach to Optimization Problems with Equilibrium Constraints. Theory, Applications and Numerical Results, Kluwert Academic Publisher, Dordrecht, 1998.
47. S.M. Robinson, Linear convergence of epsilon-subgradient descent methods for a class of convex functions, Math. Program. 86 (1999), pp. 41-50.
48. C. Sagastizábal and M. Solodov, An infeasible bundle method for nonsmooth convex constrained optimization without a penalty function or a filter, SIAM J. Optim. 16(1) (2005), pp. 146-169. (Pubitemid 43268546)
49. 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.
50. N.Z. Shor, Minimization Methods for Non-Differentiable Functions, Springer-Verlag, Berlin, 1985.
51. S.P. Uryasev, Algorithms for nondifferentiable optimization problems, J. Optim. TheoryAppl. 71 (1991), pp. 359-388.
52. J. Vlcek and L. Lukšan, Globally convergent variable metric method for nonconvex nondifferentiable unconstrained minimization, J. Optim. Theory Appl. 111(2) (2001), pp. 407-430. (Pubitemid 33365960)