A successive quadratic programming method that uses new corrections for search directions (Q1919937)
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: A successive quadratic programming method that uses new corrections for search directions |
scientific article; zbMATH DE number 910300
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A successive quadratic programming method that uses new corrections for search directions |
scientific article; zbMATH DE number 910300 |
Statements
A successive quadratic programming method that uses new corrections for search directions (English)
0 references
24 February 1997
0 references
The authors propose and study a successive quadratic programming (SQP) method for solving general differentiable nonlinear programming problems over \(\mathbb{R}^n\). The present SQP method is an improvement over the SQP method discussed by \textit{M. Fukushima} [Math. Program. 35, 253-264 (1986; Zbl 0597.90077)]. Global convergence and local superlinear convergence results are proved. Numerical results on a number of test problems are reported.
0 references
penalty function
0 references
successive quadratic programming method
0 references
global convergence
0 references
numerical results
0 references
nonlinear programming
0 references
local superlinear convergence
0 references
0 references
0 references
0 references
0 references
0 references
0.8434078693389893
0 references
0.8433153629302979
0 references
