Gradient set splitting in nonconvex nonsmooth numerical optimization

References

• Bagirov , A. 2003 . Continuous subdifferential approximations and their applications . J. Math. Sci. , 115 : 2567 – 2609 .
   Google Scholar
• Bagirov , A. , Karasozen , B. and Sezer , M. 2008 . Discrete gradient method: Derivative-free method for nonsmooth optimization . J. Optim Theory Appl. , 137 : 317 – 334 .
   Web of Science ®Google Scholar
• Bonnans , J. , Gilbert , J. , Lemaréchal , C. and Sagastizabal , C. 1995 . A family of variable metric proximal methods . Math. Program. , 68 : 15 – 48 .
   Web of Science ®Google Scholar
• Burke , J. , Lewis , A. and Overton , L. 2005 . A robust gradient sampling algorithm for nonsmooth nonconvex optimization . SIAM J. Optim. , 15 : 751 – 779 .
   Web of Science ®Google Scholar
• Clarke , F. 1983 . Optimization and Nonsmooth Analysis , New York : Wiley .
   Google Scholar
• Demyanov , V. F. and Rubinov , A. 1986 . Quasidifferential Calculus , New York : Optimization Software Inc. .
   Google Scholar
• Demyanov , V. F. and Rubinov , A. 1995 . Constructive Nonsmooth Analysis , Frankfurt : Verlag Peter Lang .
   Google Scholar
• Fuduli , A. , Gaudioso , M. and Giallombardo , G. 2004 . Minimizing nonconvex nonsmooth functions via cutting planes and proximity control . SIAM J. Optim. , 14 : 743 – 756 .
   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 Software , 19 : 89 – 102 .
   Web of Science ®Google Scholar
• Gaudioso , M. , Giallombardo , G. and Miglionico , G. 2006 . An incremental method for solving convex finite min-max problems . Math. Oper. Res. , 31 : 173 – 187 .
   Web of Science ®Google Scholar
• Gaudioso , M. , Gorgone , E. and Monaco , M. F. 2009 . Piecewise linear approximations in nonconvex nonsmooth optimization . Numer. Math. , 113 : 73 – 88 .
   Web of Science ®Google Scholar
• Goldfarb , D. and Idnani , A. 1983 . A numerically stable dual method for solving strictly convex quadratic program . Math. Program. , 27 : 1 – 33 .
   Web of Science ®Google Scholar
• Hare , W. and Sagastizábal , C. 2009 . Computing proximal point of nonconvex functions . Math. Program. , 116 : 221 – 258 .
   Web of Science ®Google Scholar
• Hare , W. and Sagastizábal , C. 2009 . A redistributed proximal bundle method for nonconvex optimization . Optimization Online , (http://www.optimization-online.org)
   Google Scholar
• Hiriart-Urruty , J. and Lemaréchal , C. 1993 . Convex Analysis and Minimization Algorithms Vol. II , Berlin : Springer .
   Google Scholar
• Ioffe , A. 1981 . Nonsmooth analysis: differential calculus of nondifferentiable functions . Trans. Amer. Math. Soc. , 255 : 1 – 55 .
   Google Scholar
• Ioffe , A. 1990 . Proximal analysis and approximate subdifferentials . J. London Math. Soc. , 41 : 175 – 192 .
   Web of Science ®Google Scholar
• Kiwiel , K. C. 1983 . An aggregate subgradient method for nonsmooth convex minimization . Math. Program. , 27 : 320 – 341 .
   Web of Science ®Google Scholar
• Kiwiel , K. C. 1985 . Methods of descent for nondifferentiable optimization , Vol. 1133 , Berlin : Springer . Lecture Notes in Mathematics
   Google Scholar
• Lemaréchal , C. 1978 . “ Bundle methods in nonsmooth optimization ” . In Nonsmooth optimization , Edited by: Lemaréchal , C. and Mifflin , R. 79 – 102 . Oxford : Pergamon Press .
   Google Scholar
• Lewis , A. and Overton , M. 2008 . Nonsmooth optimization via BFGS , Optimization Online (http://www.optimization-online.org)
   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. 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. and Neittaanmäki , P. 1992 . Nonsmooth Optimization , Singapore : World Scientific .
   Google Scholar
• Mifflin , R. 1977 . An algorithm for constrained optimization with semismooth functions . Math. Oper. Res. , 2 : 191 – 207 .
   Google Scholar
• Mifflin , R. 1982 . A modification and extension of Lemaréchal algorithm for nonsmooth minimization . Math. Progr. Study , 17 : 77 – 90 .
   Web of Science ®Google Scholar
• Mifflin , R. , Sun , D. and Qi , L. 1998 . Quasi-Newton bundle-type methods for nondifferentiable convex optimization . SIAM J. Optim. , 8 : 583 – 603 .
   Web of Science ®Google Scholar
• Mordukhovich , B. 2006 . Varational Analysis and Generalized Differentation. I: Basics Theory , Vol. 330 , Berlin : Springer . Grundlehren Series (Fundamental Principles of Mathematical Sciences)
   Google Scholar
• Mordukhovich , B. 2006 . Varational Analysis and Generalized Differentation. II: Application , Vol. 331 , Berlin : Springer . Grundlehren Series (Fundamental Principles of Mathematical Sciences)
   Google Scholar
• Penot , J.-P. 1978 . Calcul sous-differentiel et optimisation . J. Funct. Anal. , 27 : 248 – 276 .
   Web of Science ®Google Scholar
• Pshenichnyi , B. 1971 . Necessary Conditions for an Extremum , New York : Marcel Dekker .
   Google Scholar
• Rockafellar , R. and Wets , R.-B. 1998 . Varational Analysis , Berlin : Springer .
   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. , 1 : 121 – 152 .
   Google Scholar
• Vlček , J. 2001 . Globally convergent variable metric method for nonconvex nondifferentiable unconstrained minimization . J. Optim. Theory Appl. , 111 : 407 – 430 .
   Web of Science ®Google Scholar
• Wolfe , P. A method of conjugate subgradients for minimizing nondifferentiable functions . Nondifferentiable optimization . Edited by: Balinski , M. and Wolfe , P. Vol. 3 , pp. 145 – 173 . Amsterdam : North-Holland . Mathematical Programming Study
   Google Scholar