On the complexity of testing attainment of the optimal value in nonlinear optimization (Q2205977)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the complexity of testing attainment of the optimal value in nonlinear optimization |
scientific article |
Statements
On the complexity of testing attainment of the optimal value in nonlinear optimization (English)
0 references
21 October 2020
0 references
existence of solutions in mathematical programs
0 references
Frank-Wolfe-type theorems
0 references
coercive polynomials
0 references
computational complexity
0 references
semidefinite programming
0 references
Archimedean quadratic modules
0 references
0 references
