Piecewise linear approximations in nonconvex nonsmooth optimization

We present a bundle type method for minimizing nonconvex nondifferentiable functions of several variables. The algorithm is based on the construction of both a lower and an upper polyhedral approximation of the objective function. In particular, at each iteration, a search direction is computed by solving a quadratic program aiming at maximizing the difference between the lower and the upper model. A proximal approach is used to guarantee convergence to a stationary point under the hypothesis of weak semismoothness.

[1]  A. A. Goldstein,et al.  Newton's method for convex programming and Tchebycheff approximation , 1959, Numerische Mathematik.

[2]  Krzysztof C. Kiwiel,et al.  An aggregate subgradient method for nonsmooth convex minimization , 1983, Math. Program..

[3]  P. Wolfe.  Note on a method of conjugate subgradients for minimizing nondifferentiable functions , 1974 .

[4]  Claude Lemaréchal,et al.  A view of line-searches , 1981 .

[5]  Jochem Zowe,et al.  A Version of the Bundle Idea for Minimizing a Nonsmooth Function: Conceptual Idea, Convergence Analysis, Numerical Results , 1992, SIAM J. Optim..

[6]  Annabella Astorino,et al.  Nonsmooth Optimization Techniques for Semisupervised Classification , 2007, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[7]  Adrian S. Lewis,et al.  A Robust Gradient Sampling Algorithm for Nonsmooth, Nonconvex Optimization , 2005, SIAM J. Optim..

[8]  E. Polak.  On the mathematical foundations of nondifferentiable optimization in engineering design , 1987 .

[9]  Krzysztof C. Kiwiel,et al.  Proximal level bundle methods for convex nondifferentiable optimization, saddle-point problems and variational inequalities , 1995, Math. Program..

[10]  Antonio Fuduli,et al.  Minimizing Nonconvex Nonsmooth Functions via Cutting Planes and Proximity Control , 2003, SIAM J. Optim..

[11]  Antonio Fuduli,et al.  A DC piecewise affine model and a bundling technique in nonconvex nonsmooth minimization , 2004, Optim. Methods Softw..

[12]  L. Luksan,et al.  Globally Convergent Variable Metric Method for Nonconvex Nondifferentiable Unconstrained Minimization , 2001 .

[13]  J. Hiriart-Urruty,et al.  Convex analysis and minimization algorithms , 1993 .

[14]  Jacek Gondzio,et al.  Solving nonlinear multicommodity flow problems by the analytic center cutting plane method , 1997, Math. Program..

[15]  Christoph Helmberg,et al.  Bundle Methods to Minimize the Maximum Eigenvalue Function , 2000 .

[16]  Donald Goldfarb,et al.  A numerically stable dual method for solving strictly convex quadratic programs , 1983, Math. Program..

[17]  F. Clarke.  Optimization And Nonsmooth Analysis , 1983 .

[18]  Giovanna Miglionico,et al.  An Incremental Method for Solving Convex Finite Min-Max Problems , 2006, Math. Oper. Res..

[19]  V. F. Demʹi︠a︡nov,et al.  Introduction to minimax , 1976 .

[20]  Warren Hare,et al.  Computing proximal points of nonconvex functions , 2008, Math. Program..

[21]  Anthony V. Fiacco,et al.  Mathematical programming study 21 , 1985, Mathematical programming.

[22]  Yurii Nesterov,et al.  New variants of bundle methods , 1995, Math. Program..

[23]  C. Lemaréchal.  An extension of davidon methods to non differentiable problems , 1975 .

[24]  V. F. Demʹi︠a︡nov,et al.  Introduction to minimax , 1976 .

[25]  J. E. Kelley,et al.  The Cutting-Plane Method for Solving Convex Programs , 1960 .

[26]  Robert Mifflin,et al.  An Algorithm for Constrained Optimization with Semismooth Functions , 1977, Math. Oper. Res..