A superlinearly convergent hybrid algorithm for solving nonlinear programming (Q2628199)
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 6729515
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A superlinearly convergent hybrid algorithm for solving nonlinear programming |
scientific article; zbMATH DE number 6729515 |
Statements
A superlinearly convergent hybrid algorithm for solving nonlinear programming (English)
0 references
12 June 2017
0 references
nonlinear programming
0 references
sequential quadratic programming
0 references
system of linear equations
0 references
working set
0 references
global and locally one-step superlinear convergence
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0.8330946564674377
0 references
0.825800895690918
0 references
0.8188462853431702
0 references
0.8113846182823181
0 references
