A new technique for inconsistent QP problems in the SQP method (Q1298765)
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 new technique for inconsistent QP problems in the SQP method |
scientific article; zbMATH DE number 1326516
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A new technique for inconsistent QP problems in the SQP method |
scientific article; zbMATH DE number 1326516 |
Statements
A new technique for inconsistent QP problems in the SQP method (English)
0 references
5 October 1999
0 references
A new regularization procedure for the SQP method is proposed using results of \textit{K. Tone} [ Math. Program. 26, 144-152 (1983; Zbl 0516.90065)] and \textit{D. Q. Mayne} and \textit{J. F. A. de O. Pantoja} [ J. Optim. Theory Appl. 69, 441-467 (1999; Zbl 0724.90065)] as starting points. A commonly used hypothesis is dropped and a new algorithm is proposed. Three examples are analyzed and their efficiency is shown. Seven theorems prove the proposed assertions. Global convergence of the algorithm is proved. Some numerical examples are given.
0 references
nonlinear programming
0 references
sequential quadratic programming
0 references
algorithm
0 references
convergence
0 references
inconsistent quadratic programming
0 references
0 references
0 references
0 references
0 references
0 references
0.7914425730705261
0 references
