Piecewise-quadratic Approximations in Convex Numerical Optimization

We present a bundle method for convex nondifferentiable minimization where the model is a piecewise-quadratic convex approximation of the objective function. Unlike standard bundle approaches, the model only needs to support the objective function from below at a properly chosen (small) subset of points, as opposed to everywhere. We provide the convergence analysis for the algorithm, with a general form of master problem which combines features of trust region stabilization and proximal stabilization, taking care of all the important practical aspects such as proper handling of the proximity parameters and the bundle of information. Numerical results are also reported.

[1]  Diethard Pallaschke,et al.  Foundations of mathematical optimization : convex analysis without linearity , 1997 .

[2]  Manlio Gaudioso,et al.  Quadratic approximations in convex nondifferentiable optimization , 1991 .

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

[4]  R. Stephenson.  A and V , 1962, The British journal of ophthalmology.

[5]  Antonio Frangioni,et al.  Generalized Bundle Methods , 2002, SIAM J. Optim..

[6]  Antonio Frangioni,et al.  About Lagrangian Methods in Integer Optimization , 2005, Ann. Oper. Res..

[7]  Enrico Gorgone,et al.  Gradient set splitting in nonconvex nonsmooth numerical optimization , 2010, Optim. Methods Softw..

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

[9]  G. Saridis,et al.  Journal of Optimization Theory and Applications Approximate Solutions to the Time-invariant Hamilton-jacobi-bellman Equation 1 , 1998 .

[10]  Krzysztof C. Kiwiel,et al.  A Proximal Bundle Method with Approximate Subgradient Linearizations , 2006, SIAM J. Optim..

[11]  Enrico Gorgone,et al.  Piecewise linear approximations in nonconvex nonsmooth optimization , 2009, Numerische Mathematik.

[12]  Defeng Sun,et al.  Quasi-Newton Bundle-Type Methods for Nondifferentiable Convex Optimization , 1998, SIAM J. Optim..

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

[14]  Antonio Frangioni,et al.  Solving semidefinite quadratic problems within nonsmooth optimization algorithms , 1996, Comput. Oper. Res..

[15]  Robert Mifflin,et al.  On VU-theory for Functions with Primal-Dual Gradient Structure , 2000, SIAM J. Optim..

[16]  Giovanni Rinaldi,et al.  New approaches for optimizing over the semimetric polytope , 2005, Math. Program..

[17]  J. Hiriart-Urruty,et al.  Generalized Hessian matrix and second-order optimality conditions for problems withC1,1 data , 1984 .

[18]  Jacques Desrosiers,et al.  On the choice of explicit stabilizing terms in column generation , 2007, Discret. Appl. Math..

[19]  Nelson Maculan,et al.  The volume algorithm revisited: relation with bundle methods , 2002, Math. Program..

[20]  Krzysztof C. Kiwiel.  A Proximal-Projection Bundle Method for Lagrangian Relaxation, Including Semidefinite Programming , 2006, SIAM J. Optim..

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

[22]  Teodor Gabriel Crainic,et al.  Bundle-based relaxation methods for multicommodity capacitated fixed charge network design , 2001, Discret. Appl. Math..

[23]  K. Kiwiel.  Efficiency of Proximal Bundle Methods , 2000 .

[24]  K. Kiwiel.  Methods of Descent for Nondifferentiable Optimization , 1985 .

[25]  Robert Mifflin,et al.  A -algorithm for convex minimization , 2005, Math. Program..

[26]  Jan Vlcek,et al.  A bundle-Newton method for nonsmooth unconstrained minimization , 1998, Math. Program..

[27]  A. FRANGIONI,et al.  Piecewise Quadratic Approximations in Convex Numerical Optimization Piecewise Quadratic Approximations in Convex Numerical Optimization , 2010 .

[28]  Diethard Pallaschke,et al.  Foundations of Mathematical Optimization , 1997 .

[29]  Claudio Gentile,et al.  Solving unit commitment problems with general ramp constraints , 2008 .

[30]  Olvi L. Mangasarian,et al.  Nonlinear Programming , 1969 .

[31]  Roberto Cominetti,et al.  A generalized second-order derivative in nonsmooth optimization , 1990 .

[32]  Claude Lemaréchal,et al.  An inexact bundle variant suited to column generation , 2009, Math. Program..

[33]  Adam Ouorou,et al.  A proximal cutting plane method using Chebychev center for nonsmooth convex optimization , 2009, Math. Program..

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

[35]  K. G. Murty,et al.  Nonsmooth optimization , 2007 .

[36]  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..

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

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