Minimizing Nonconvex Nonsmooth Functions via Cutting Planes and Proximity Control

We describe an extension of the classical cutting plane algorithm to tackle the unconstrained minimization of a nonconvex, not necessarily differentiable function of several variables. The method is based on the construction of both a lower and an upper polyhedral approximation to the objective function and is related to the use of the concept of proximal trajectory. Convergence to a stationary point is proved for weakly semismooth functions.

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

[2]  David Q. Mayne,et al.  A superlinearly convergent algorithm for min-max problems , 1989, Proceedings of the 28th IEEE Conference on Decision and Control,.

[3]  Krzysztof C. Kiwiel,et al.  Restricted Step and Levenberg-Marquardt Techniques in Proximal Bundle Methods for Nonconvex Nondifferentiable Optimization , 1996, SIAM J. Optim..

[4]  Krzysztof C. Kiwiel,et al.  Proximity control in bundle methods for convex nondifferentiable minimization , 1990, Math. Program..

[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]  J. Hiriart-Urruty,et al.  Convex analysis and minimization algorithms , 1993 .

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

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

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

[10]  V. F. Demʹi︠a︡nov,et al.  Constructive nonsmooth analysis , 1995 .

[11]  Luigi Grippo,et al.  A smooth method for the finite minimax problem , 1993, Math. Program..

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

[13]  Marko Mäkelä,et al.  Survey of Bundle Methods for Nonsmooth Optimization , 2002, Optim. Methods Softw..

[14]  丸山 徹.  Convex Analysisの二,三の進展について , 1977 .

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

[16]  K. Kiwiel.  Finding normal solutions in piecewise linear programming , 1995 .

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

[18]  M. Pullan.  CONVEX ANALYSIS AND MINIMIZATION ALGORITHMS Volumes I and II (Comprehensive Studies in Mathematics 305, 306) , 1995 .