A new QP-free algorithm without a penalty function or a filter for nonlinear semidefinite programming (Q2023745)
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 new QP-free algorithm without a penalty function or a filter for nonlinear semidefinite programming |
scientific article; zbMATH DE number 7342571
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A new QP-free algorithm without a penalty function or a filter for nonlinear semidefinite programming |
scientific article; zbMATH DE number 7342571 |
Statements
A new QP-free algorithm without a penalty function or a filter for nonlinear semidefinite programming (English)
0 references
3 May 2021
0 references
nonlinear semideflnite programming
0 references
QP-free
0 references
penalty-free
0 references
nonmonotone line search
0 references
global convergence
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0.8991104364395142
0 references
0.8875658512115479
0 references
0.8824884295463562
0 references
0.8823999762535095
0 references
0.8676022887229919
0 references
