[Home]   [  News]   [  Events]   [  People]   [  Research]   [  Education]   [Visitor Info]   [UCSD Only]   [Admin]
Home > Research > Publications > Abstract
Search this site:

Randolph E. Bank
Philip E. Gill
Michael Holst

Administrative Contact:
Terry Le

Office: AP&M 7431
Phone: (858)534-9813
Fax: (858)534-5273
E-mail: tele@ucsd.edu
Convexification Schemes for SQP Methods

by Philip E. Gill, Elizabeth Wong


Sequential quadratic programming (SQP) methods solve nonlinear optimization problems by finding an approximate solution of a sequence of quadratic programming (QP) subprob- lems. 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 con- vexification, 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.

UCSD-CCoM-14-06.pdf   July 2014