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 this page instead for the normal view: Optimality of orders one to three and beyond: characterization and evaluation complexity in constrained nonconvex optimization |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Optimality of orders one to three and beyond: characterization and evaluation complexity in constrained nonconvex optimization |
scientific article |
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
