On the complexity of testing attainment of the optimal value in nonlinear optimization

Keyphrases

• Nonlinear Optimization 100%
• Strong NP-hardness 100%
• Polynomial Time 33%
• Semidefinite Programming 33%
• Pseudo-polynomial Time Algorithm 33%
• New Characterization 33%
• Coercivity 33%
• Feasible Set 33%
• Lasserre Hierarchy 33%
• Nonlinear Optimization Problem 33%
• Closedness 33%
• Nonattainment 33%
• Coercive Polynomials 33%
• Archimedean Property 33%
• Quadratic Modules 33%
• P-nitrophenol (p-NP) 33%
• Low-degree Polynomials 33%
• Semidefinite Hierarchies 33%

Mathematics

• Polynomial 100%
• Polynomial Time 66%
• Sufficient Condition 66%
• Objective Function 33%
• Boundedness 33%
• Low Degree 33%
• Feasible Set 33%
• Closedness 33%
• Archimedean Property 33%