A globally convergent SQP method for semi-infinite nonlinear optimization (Q1262218)
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 globally convergent SQP method for semi-infinite nonlinear optimization |
scientific article; zbMATH DE number 4123534
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A globally convergent SQP method for semi-infinite nonlinear optimization |
scientific article; zbMATH DE number 4123534 |
Statements
A globally convergent SQP method for semi-infinite nonlinear optimization (English)
0 references
1988
0 references
In the paper under review a new method for nonlinear semi-infinite optimization is presented. The method belongs to the class of successive quadratic programming (SQP) methods with trust region technique and utilizes an exact \(L_{\infty}\) penalty function. The algorithm developed is proved to be globally convergent under some assumptions. Implementation hints and some results of numerical experiments are presented, too.
0 references
global convergence
0 references
nonlinear semi-infinite optimization
0 references
successive quadratic programming
0 references
trust region technique
0 references
penalty function
0 references
0 references
0 references
