A computationally efficient feasible sequential quadratic programming algorithm (Q2719243)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 1608904
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A computationally efficient feasible sequential quadratic programming algorithm |
scientific article; zbMATH DE number 1608904 |
Statements
21 June 2001
0 references
sequential quadratic programming
0 references
SQP
0 references
feasible iterates
0 references
feasible SQP
0 references
FSQP
0 references
A computationally efficient feasible sequential quadratic programming algorithm (English)
0 references
0.8589244484901428
0 references
0.8554517030715942
0 references
0.8490258455276489
0 references
0.8485140800476074
0 references
0.8353685736656189
0 references
