A modified QP-free feasible method (Q552398)
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 modified QP-free feasible method |
scientific article; zbMATH DE number 5930107
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A modified QP-free feasible method |
scientific article; zbMATH DE number 5930107 |
Statements
A modified QP-free feasible method (English)
0 references
21 July 2011
0 references
constrained optimization
0 references
QP-free algorithm
0 references
NCP function
0 references
filter
0 references
global convergence
0 references
superlinear convergence
0 references
0 references
0 references
0.8794136643409729
0 references
0.8745792508125305
0 references
0.8715892434120178
0 references
