Complexity, exactness, and rationality in polynomial optimization
From MaRDI portal
Publication:5925641
DOI10.1007/s10107-022-01818-3OpenAlexW3098225144MaRDI QIDQ5925641
Robert Hildebrand, Alberto Del Pia, Bienstock, Daniel
Publication date: 14 March 2023
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10107-022-01818-3
Related Items (1)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- 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
- Solving zero-dimensional systems through the rational univariate representation
- 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
- On the implementation of an interior-point filter line-search algorithm for large-scale nonlinear programming
- Quadratic programming is in NP
- A Note on Polynomial Solvability of the CDT Problem
- Polynomial algorithms in linear programming
- On the Computational Complexity of Approximating Solutions for Real Algebraic Formulae
- On a Frank-Wolfe type theorem in cubic optimization
- 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
- Combinatorics of Compositions and Words
- On the Minimum of a Polynomial Function on a Basic Closed Semialgebraic Set and Applications
- A Survey of the S-Lemma
- Algorithms in real algebraic geometry
- Complexity of Null- and Positivstellensatz proofs
This page was built for publication: Complexity, exactness, and rationality in polynomial optimization
