Optimization Online


A sequential quadratic programming algorithm with a piecewise linear merit function

Francisco Gomes (chico***at***ime.unicamp.br)

Abstract: A sequential quadratic programming algorithm for solving nonlinear programming problems is presented. The new feature of the algorithm is related to the definition of the merit function. Instead of using one penalty parameter per iteration and increasing it as the algorithm progresses, we suggest that a new point is to be accepted if it stays sufficiently below the piecewise linear function defined by some previous iterates on the (f,||C||^2) space. Therefore, the penalty parameter is allowed to decrease between successive iterations. Besides, one need not to decide how to update the penalty parameter. This approach resembles the filter method introduced by Fletcher and Leyffer, but it is less tolerant since a merit function is still used.

Keywords: nonlinear programming, sequential quadratic programming, merit functions

Category 1: Nonlinear Optimization (Constrained Nonlinear Optimization )

Citation: Technical Report RP24/04, IMECC, University of Campinas, Campinas, SP, Brazil.

Download: [Postscript][Compressed Postscript][PDF]

Entry Submitted: 05/11/2004
Entry Accepted: 05/11/2004
Entry Last Modified: 08/12/2005

Modify/Update this entry

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


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