Optimization Online


Convexification Schemes for SQP Methods

Philip E. Gill (pgill***at***ucsd.edu)
Elizabeth Wong (elwong***at***ucsd.edu)

Abstract: Sequential quadratic programming (SQP) methods solve nonlinear optimization problems by finding an approximate solution of a sequence of quadratic programming (QP) subproblems. Each subproblem involves the minimization of a quadratic model of the objective function subject to the linearized constraints. Depending on the definition of the quadratic model, the QP subproblem may be nonconvex, leading to difficulties in the formulation and analysis of a conventional SQP method. Convexification is a process for defining a local convex approximation of a nonconvex problem. We describe three forms of convexification: preconvexification, concurrent convexification, and post-convexification. The methods require only minor changes to the algorithms used to solve the QP subproblem, and are designed so that modifications to the original problem are minimized and applied only when necessary.

Keywords: Nonlinear programming, nonlinear inequality constraints, sequential quadratic programming, SQP methods, second-derivative methods

Category 1: Nonlinear Optimization (Constrained Nonlinear Optimization )

Citation: UCSD Center for Computational Mathematics Technical Report CCoM-14-6


Entry Submitted: 07/17/2014
Entry Accepted: 07/17/2014
Entry Last Modified: 01/31/2015

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 Optimization Society