Optimization Online


A Sequential Quadratic Programming Algorithm for Nonconvex, Nonsmooth Constrained Optimization

Frank E. Curtis (frank.e.curtis***at***gmail.com)
Michael L. Overton (overton***at***cs.nyu.edu)

Abstract: We consider optimization problems with objective and constraint functions that may be nonconvex and nonsmooth. Problems of this type arise in important applications, many having solutions at points of nondifferentiability of the problem functions. We present a line search algorithm for situations when the objective and constraint functions are locally Lipschitz and continuously differentiable on open dense subsets of Rn. Our method is based on a sequential quadratic programming (SQP) algorithm that uses an 1 penalty to regularize the constraints. A process of gradient sampling (GS) is employed to make the search direction computation effective in nonsmooth regions. We prove that our SQP-GS method is globally convergent to stationary points with probability one and illustrate its performance with a MATLAB implementation.

Keywords: nonconvex optimization, nonsmooth optimization, constrained optimization, sequential quadratic programming, gradient sampling, exact penalization

Category 1: Convex and Nonsmooth Optimization (Nonsmooth Optimization )

Category 2: Nonlinear Optimization (Constrained Nonlinear Optimization )

Citation: F. E. Curtis and M. L. Overton, “A Sequential Quadratic Programming Algorithm for Nonconvex, Nonsmooth Constrained Optimization,” SIAM Journal on Optimization, 22(2): 474–500, 2012.


Entry Submitted: 12/15/2009
Entry Accepted: 12/15/2009
Entry Last Modified: 01/04/2013

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