A Sequential Quadratic Programming Algorithm for Nonconvex, Nonsmooth Constrained Optimization

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 wh...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:SIAM journal on optimization Ročník 22; číslo 2; s. 474 - 500
Hlavní autoři: Curtis, Frank E., Overton, Michael L.
Médium: Journal Article
Jazyk:angličtina
Vydáno: Philadelphia Society for Industrial and Applied Mathematics 01.01.2012
Témata:
Algorithms
Methods
Optimization
Quadratic programming
ISSN:1052-6234, 1095-7189
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí: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 $\mathbb{R}^{n}$. Our method is based on a sequential quadratic programming (SQP) algorithm that uses an $\ell_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. [PUBLICATION ABSTRACT]
Bibliografie:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:1052-6234
1095-7189
DOI:10.1137/090780201