Comparing different nonsmooth minimization methods and software

References

• Äyrämö , S. 2006 . “ Knowledge mining using robust clustering ” . University of Jyväskylä, Department of Mathematical Information Technology . Ph.D. thesis
   Google Scholar
• Bagirov , A. M. 2003 . Continuous subdifferential approximations and their applications . J. Math. Sci. , 115 ( 5 ) : 2567 – 2609 .
   Google Scholar
• Bagirov , A. M. and Ganjehlou , A. N. 2010 . A quasisecant method for minimizing nonsmooth functions . Optim. Methods Softw. , 25 ( 1 ) : 3 – 18 .
   Web of Science ®Google Scholar
• Bagirov , A. M. , Karasozen , B. and Sezer , M. 2008 . Discrete gradient method: A derivative free method for nonsmooth optimization . J. Optim. Theory Appl. , 137 : 317 – 334 .
   Web of Science ®Google Scholar
• Beck , A. and Teboulle , M. 2003 . Mirror descent and nonlinear projected subgradient methods for convex optimization . Oper. Res. Lett. , 31 ( 3 ) : 167 – 175 .
   Web of Science ®Google Scholar
• Ben-Tal , A. and Nemirovski , A. 2005 . Non-Euclidean restricted memory level method for large-scale convex optimization . Math. Program. , 102 ( 3 ) : 407 – 456 .
   Google Scholar
• Bihain , A. 1984 . Optimization of upper semidifferentiable functions . J. Optim. Theory Appl. , 4 : 545 – 568 .
   Web of Science ®Google Scholar
• Bradley , P. S. , Fayyad , U. M. and Mangasarian , O. L. 1999 . Mathematical programming for data mining: Formulations and challenges . INFORMS J. Comput. , 11 : 217 – 238 .
   Web of Science ®Google Scholar
• Burke , J. V. , Lewis , A. S. and Overton , M. L. 2005 . A robust gradient sampling algorithm for nonsmooth, nonconvex optimization . SIAM J. Optim. , 15 : 751 – 779 .
   Web of Science ®Google Scholar
• Byrd , R. H. , Nocedal , J. and Schnabel , R. B. 1994 . Representations of quasi-Newton matrices and their use in limited memory methods . Math. Program. , 63 : 129 – 156 .
   Web of Science ®Google Scholar
• Clarke , F. H. 1983 . Optimization and Nonsmooth Analysis , New York : Wiley-Interscience .
   Google Scholar
• Clarke , F. H. , Ledyaev , Y. S. , Stern , R. J. and Wolenski , P. R. 1998 . Nonsmooth Analysis and Control Theory , New York : Springer .
   Google Scholar
• Demyanov , V. F. , Bagirov , A. M. and Rubinov , A. M. 2002 . A method of truncated codifferential with application to some problems of cluster analysis . J. Global Optim. , 23 ( 1 ) : 63 – 80 .
   Web of Science ®Google Scholar
• Dolan , E. D. and Moré , J. J. 2002 . Benchmarking optimization software with performance profiles . Math. Program. , 91 : 201 – 213 .
   Web of Science ®Google Scholar
• Fuduli , A. , Gaudioso , M. and Giallombardo , G. 2004 . A DC piecewise affine model and a bundling technique in nonconvex nonsmooth minimization . Optim. Methods Softw. , 19 ( 1 ) : 89 – 102 .
   Web of Science ®Google Scholar
• Fuduli , A. , Gaudioso , M. and Giallombardo , G. 2004 . Minimizing nonconvex nonsmooth functions via cutting planes and proximity control . SIAM J. Optim. , 14 ( 3 ) : 743 – 756 .
   Google Scholar
• Gaudioso , M. and Monaco , M. F. 1992 . Variants to the cutting plane approach for convex nondifferentiable optimization . Optimization , 25 : 65 – 75 .
   Google Scholar
• Haarala , M. 2004 . “ Large-scale nonsmooth optimization: Variable metric bundle method with limited memory ” . University of Jyväskylä, Department of Mathematical Information Technology . Ph.D. thesis
   Google Scholar
• Haarala , M. , Miettinen , K. and Mäkelä , M. M. 2004 . New limited memory bundle method for large-scale nonsmooth optimization . Optim. Methods Softw. , 19 ( 6 ) : 673 – 692 .
   Web of Science ®Google Scholar
• Haarala , N. , Miettinen , K. and Mäkelä , M. M. 2007 . Globally convergent limited memory bundle method for large-scale nonsmooth optimization . Math. Program. , 109 ( 1 ) : 181 – 205 .
   Web of Science ®Google Scholar
• 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)
   Google Scholar
• Haslinger , J. and Neittaanmäki , P. 1996 . “ Finite Element Approximation for Optimal Shape, Material and Topology Design ” . In , 2 , Chichester : John Wiley and Sons .
   Google Scholar
• Hiriart-Urruty , J.-B. and Lemaréchal , C. 1993 . “ Convex Analysis and Minimization Algorithms II ” . Berlin : Springer-Verlag .
   Google Scholar
• Kappel , F. and Kuntsevich , A. 2000 . An implementation of Shor's r-algorithm . Comput. Optim. Appl. , 15 : 193 – 205 .
   Web of Science ®Google Scholar
• Kärkkäinen , T. and Heikkola , E. 2004 . Robust formulations for training multilayer perceptrons . Neural Comput. , 16 : 837 – 862 .
   Web of Science ®Google Scholar
• 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
   Google Scholar
• Karmitsa , N. , Mäkelä , M. M. and Ali , M. M. 2008 . Limited memory interior point bundle method for large inequality constrained nonsmooth minimization . Appl. Math. Comput. , 198 ( 1 ) : 382 – 400 .
   Web of Science ®Google Scholar
• Kiwiel , K. C. 1985 . Methods of Descent for Nondifferentiable Optimization , Berlin : Springer-Verlag . Lecture Notes in Mathematics 1133
   Google Scholar
• Kiwiel , K. C. 1990 . Proximity control in bundle methods for convex nondifferentiable minimization . Math. Program. , 46 : 105 – 122 .
   Web of Science ®Google Scholar
• Kuntsevich , A. and Kappel , F. 1997 . “ SolvOpt – the Solver for Local Nonlinear Optimization Problems ” . Graz , , Austria : Karl-Franzens University of Graz .
   Google Scholar
• Lemaréchal , C. 1989 . “ Nondifferentiable optimization ” . In Optimization , Edited by: Nemhauser , G. L. , Rinnooy Kan , A. H.G. and Todd , M. J. 529 – 572 . New York : Elsevier North-Holland, Inc .
   Google Scholar
• Lukšan , L. 1984 . Dual method for solving a special problem of quadratic programming as a subproblem at linearly constrained nonlinear minmax approximation . Kybernetika , 20 : 445 – 457 .
   Web of Science ®Google Scholar
• Luksˇan , L. , Tu˙ma , M. , Sˇiška , M. , Vlček , J. , Ramešová , N. and UFO . 2002 . “ Interactive system for universal functional optimization ” . Prague : Institute of Computer Science, Academy of Sciences of the Czech Republic . Tech. Rep. 883, 2002
   Google Scholar
• Lukšan , L. and Vlček , J. 1998 . A bundle-Newton method for nonsmooth unconstrained minimization . Math. Program. , 83 : 373 – 391 .
   Web of Science ®Google Scholar
• Lukšan , L. and Vlček , J. 1999 . Globally convergent variable metric method for convex nonsmooth unconstrained minimization . J. Optim. Theory Appl. , 102 ( 3 ) : 593 – 613 .
   Google Scholar
• Lukšan , L. and Vlček , J. 2000 . “ NDA: Algorithms for nondifferentiable optimization ” . Prague : Institute of Computer Science, Academy of Sciences of the Czech Republic . Tech. Rep. 797
   Google Scholar
• Lukšan , L. and Vlček , J. 2000 . “ Test problems for nonsmooth unconstrained and linearly constrained optimization ” . Prague : Institute of Computer Science, Academy of Sciences of the Czech Republic . Tech. Rep. 798
   Google Scholar
• Mäkelä , M. M. 2002 . Survey of bundle methods for nonsmooth optimization . Optim. Methods Softw. , 17 ( 1 ) : 1 – 29 .
   Web of Science ®Google Scholar
• Mäkelä , M. M. 2003 . “ Multiobjective proximal bundle method for nonconvex nonsmooth optimization: Fortran subroutine MPBNGC 2.0 ” . Jyväskylä : University of Jyväskylä . Reports of the Department of Mathematical Information Technology, Series B. Scientific Computing, B. 13/2003
   Google Scholar
• Mäkelä , M. M. and Neittaanmäki , P. 1992 . “ Nonsmooth Optimization: Analysis and Algorithms with Applications to Optimal Control ” . Singapore : World Scientific Publishing Co .
   Google Scholar
• Mäkelä , M. M. , Miettinen , M. , Lukšan , L. and Vlček , J. 1999 . Comparing nonsmooth nonconvex bundle methods in solving hemivariational inequalities . J. Global Optim. , 14 : 117 – 135 .
   Web of Science ®Google Scholar
• Miettinen , K. and Mäkelä , M. M. 2006 . Synchronous approach in interactive multiobjective optimization . Eur. J. Oper. Res. , 170 ( 3 ) : 909 – 922 .
   Web of Science ®Google Scholar
• Mistakidis , E. S. and Stavroulakis , G. E. 1998 . “ Nonconvex optimization in mechanics ” . In Smooth and Nonsmooth Algorithms, Heuristics and Engineering Applications by the F.E.M , Dordrecht : Kluwer Academic Publishers .
   Google Scholar
• Moreau , J. J. , Panagiotopoulos , P. D. and Strang , G. 1988 . “ Topics in Nonsmooth Mechanics ” . Edited by: Moreau , J. J. , Panagiotopoulos , P. D. and Strang , G. Basel : Birkhäuser Verlag .
   Google Scholar
• Noll , D. , Prot , O. and Rondepierre , A. 2008 . A proximity control algorithm to minimize nonsmooth and nonconvex functions . Pac. J. Optim. , 4 ( 3 ) : 571 – 604 .
   Web of Science ®Google Scholar
• Outrata , J. , Kočvara , M. and Zowe , J. 1998 . “ Nonsmooth Approach to Optimization Problems with Equilibrium Constraints. Theory, Applications and Numerical Results ” . Dordrecht : Kluwert Academic Publisher .
   Google Scholar
• Robinson , S. M. 1999 . Linear convergence of epsilon-subgradient descent methods for a class of convex functions . Math. Program. , 86 : 41 – 50 .
   Google Scholar
• Sagastizábal , C. and Solodov , M. 2005 . An infeasible bundle method for nonsmooth convex constrained optimization without a penalty function or a filter . SIAM J. Optim. , 16 ( 1 ) : 146 – 169 .
   Google Scholar
• Schramm , H. and Zowe , J. 1992 . A version of the bundle idea for minimizing a nonsmooth function: Conceptual idea, convergence analysis, numerical results . SIAM J. Optim. , 2 ( 1 ) : 121 – 152 .
   Web of Science ®Google Scholar
• Shor , N. Z. 1985 . “ Minimization Methods for Non-Differentiable Functions ” . Berlin : Springer-Verlag .
   Google Scholar
• Uryasev , S. P. 1991 . Algorithms for nondifferentiable optimization problems . J. Optim. Theory Appl. , 71 : 359 – 388 .
   Web of Science ®Google Scholar
• Vlček , J. and Lukšan , L. 2001 . Globally convergent variable metric method for nonconvex nondifferentiable unconstrained minimization . J. Optim. Theory Appl. , 111 ( 2 ) : 407 – 430 .
   Web of Science ®Google Scholar