Complexity, exactness, and rationality in polynomial optimization
From MaRDI portal
Publication:5918421
DOI10.1007/978-3-030-73879-2_5zbMath1482.90141arXiv2011.08347OpenAlexW3162063518MaRDI QIDQ5918421
Bienstock, Daniel, Robert Hildebrand, Alberto Del Pia
Publication date: 21 December 2021
Published in: Integer Programming and Combinatorial Optimization (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2011.08347
Related Items
Complexity of optimizing over the integers ⋮ On a computationally ill-behaved bilevel problem with a continuous and nonconvex lower level ⋮ Complexity, exactness, and rationality in polynomial optimization
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Mixed-integer quadratic programming is in NP
- Computing infeasibility certificates for combinatorial problems through Hilbert's Nullstellensatz
- A new polynomial-time algorithm for linear programming
- Quadratic programming with one negative eigenvalue is NP-hard
- On the computational complexity and geometry of the first-order theory of the reals. I: Introduction. Preliminaries. The geometry of semi-algebraic sets. The decision problem for the existential theory of the reals
- An exact duality theory for semidefinite programming and its complexity implications
- Strange behaviors of interior-point methods for solving semidefinite programming problems in polynomial optimization
- Feasibility testing for systems of real quadratic equations
- Complexity and algorithms for nonlinear optimization problems
- Quadratic programming is in NP
- A Note on Polynomial Solvability of the CDT Problem
- Polynomial algorithms in linear programming
- A guide to conic optimisation and its applications
- SOS Is Not Obviously Automatizable, Even Approximately
- Interior Point Methods in Semidefinite Programming with Applications to Combinatorial Optimization
- On the Minimum of a Polynomial Function on a Basic Closed Semialgebraic Set and Applications
- A Survey of the S-Lemma
- Complexity, exactness, and rationality in polynomial optimization
- Algorithms in real algebraic geometry
- Complexity of Null- and Positivstellensatz proofs
This page was built for publication: Complexity, exactness, and rationality in polynomial optimization
