An infeasible active-set QP-free algorithm for general nonlinear programming (Q4976293)
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: An infeasible active-set QP-free algorithm for general nonlinear programming |
scientific article; zbMATH DE number 6754505
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An infeasible active-set QP-free algorithm for general nonlinear programming |
scientific article; zbMATH DE number 6754505 |
Statements
An infeasible active-set QP-free algorithm for general nonlinear programming (English)
0 references
28 July 2017
0 references
general nonlinear programming
0 references
QP-free method
0 references
active set
0 references
filter
0 references
global convergence
0 references
superlinear convergence
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0.8738600611686707
0 references
0.8725740313529968
0 references
0.8666654825210571
0 references
0.8628422021865845
0 references
