Optimality of orders one to three and beyond: characterization and evaluation complexity in constrained nonconvex optimization (Q2001208)
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 7075675
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Optimality of orders one to three and beyond: characterization and evaluation complexity in constrained nonconvex optimization |
scientific article; zbMATH DE number 7075675 |
Statements
Optimality of orders one to three and beyond: characterization and evaluation complexity in constrained nonconvex optimization (English)
0 references
2 July 2019
0 references
nonlinear optimization
0 references
constrained problems
0 references
high-order optimality conditions
0 references
complexity theory
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0.8770850896835327
0 references
0.8408873677253723
0 references
0.8365710377693176
0 references
0.8076502084732056
0 references
