A new type feasible QP-free algorithm for inequality constrained optimization (Q4901364)
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 6129851
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A new type feasible QP-free algorithm for inequality constrained optimization |
scientific article; zbMATH DE number 6129851 |
Statements
24 January 2013
0 references
constrained optimization
0 references
QP-free algorithm
0 references
system of linear equations
0 references
global convergence
0 references
superlinear convergence
0 references
0.9300697445869446
0 references
0.8944878578186035
0 references
0.875947892665863
0 references
0.8742705583572388
0 references
0.8719807863235474
0 references
