-

 

 

 




Optimization Online





 

Piecewise quadratic approximations in convex numerical optimization

Annabella Astorino(astorino***at***icar.cnr.it)
Antonio Frangioni(frangio***at***di.unipi.it)
Manlio Gaudioso(gaudioso***at***deis.unical.it)
Enrico Gorgone(egorgone***at***deis.unical.it)

Abstract: 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 of the bundle of information. Numerical results are also reported.

Keywords: NonDifferentiable Optimization, Bundle methods, Quadratic model

Category 1: Convex and Nonsmooth Optimization (Convex Optimization )

Citation:

Download: [PDF]

Entry Submitted: 01/15/2011
Entry Accepted: 01/15/2011
Entry Last Modified: 01/15/2011

Modify/Update this entry


  Visitors Authors More about us Links
  Subscribe, Unsubscribe
Digest Archive
Search, Browse the Repository

 

Submit
Update
Policies
Coordinator's Board
Classification Scheme
Credits
Give us feedback
Optimization Journals, Sites, Societies
Mathematical Programming Society