Globalizing stabilized sequential quadratic programming method by smooth primal-dual exact penalty function (Q289075)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Globalizing stabilized sequential quadratic programming method by smooth primal-dual exact penalty function |
scientific article; zbMATH DE number 6586780
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Globalizing stabilized sequential quadratic programming method by smooth primal-dual exact penalty function |
scientific article; zbMATH DE number 6586780 |
Statements
Globalizing stabilized sequential quadratic programming method by smooth primal-dual exact penalty function (English)
0 references
27 May 2016
0 references
The authors propose a globalization approach to the stabilized sequential quadratic programming method (sSQP), by using line search in sSQP directions for minimizing the two-parameter primal-dual merit function of \textit{G. Di Pillo} and \textit{L. Grippo} [SIAM J. Control Optim. 17, 618--628 (1979; Zbl 0418.90077)]. Global convergence properties and the rate of convergence of the proposed algorithm are established. Computational experiments are also provided.
0 references
stabilized sequential quadratic programming
0 references
superlinear convergence
0 references
global convergence
0 references
exact penalty function
0 references
second-order sufficiency
0 references
noncritical Lagrange multiplier
0 references
numerical examples
0 references
primal-dual merit function
0 references
algorithm
0 references
0 references
0 references
0 references
0.8373374342918396
0 references
0.8253085017204285
0 references
0.8230062127113342
0 references
0.7966259717941284
0 references
