A globally and superlinearly convergent feasible SQP algorithm for degenerate constrained optimization (Q5401010)
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 and superlinearly convergent feasible SQP algorithm for degenerate constrained optimization |
scientific article; zbMATH DE number 6268954
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A globally and superlinearly convergent feasible SQP algorithm for degenerate constrained optimization |
scientific article; zbMATH DE number 6268954 |
Statements
12 March 2014
0 references
degenerate inequality constrained optimization
0 references
method of feasible directions
0 references
global convergence
0 references
convergence rate
0 references
feasible sequential quadratic programming algorithm
0 references
Maratos effect
0 references
numerical results
0 references
0.8939318060874939
0 references
0.8744181990623474
0 references
0.8670958280563354
0 references
0.8574016690254211
0 references
