Complexity, exactness, and rationality in polynomial optimization (Q5925641): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1007/s10107-022-01818-3
+Normal rank
@@ Property / OpenAlex ID @@
+W3098225144
@@ Property / OpenAlex ID: W3098225144 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3097348
@@ Property / cites work: Q3097348 / rank @@
+Normal rank
@@ Property / cites work @@
+Interior Point Methods in Semidefinite Programming with Applications to Combinatorial Optimization
+Normal rank
@@ Property / cites work @@
+Q3313633
@@ Property / cites work: Q3313633 / rank @@
+Normal rank
@@ Property / cites work @@
+Feasibility testing for systems of real quadratic equations
+Normal rank
@@ Property / cites work @@
+Algorithms in real algebraic geometry
@@ Property / cites work: Algorithms in real algebraic geometry / rank @@
+Normal rank
@@ Property / cites work @@
+Q4288976
@@ Property / cites work: Q4288976 / rank @@
+Normal rank
@@ Property / cites work @@
+A Note on Polynomial Solvability of the CDT Problem
+Normal rank
@@ Property / cites work @@
+Q5493572
@@ Property / cites work: Q5493572 / rank @@
+Normal rank
@@ Property / cites work @@
+Computing infeasibility certificates for combinatorial problems through Hilbert's Nullstellensatz
+Normal rank
@@ Property / cites work @@
+Mixed-integer quadratic programming is in NP
@@ Property / cites work: Mixed-integer quadratic programming is in NP / rank @@
+Normal rank
@@ Property / cites work @@
+On the Minimum of a Polynomial Function on a Basic Closed Semialgebraic Set and Applications
+Normal rank
@@ Property / cites work @@
+Complexity of Null- and Positivstellensatz proofs
@@ Property / cites work: Complexity of Null- and Positivstellensatz proofs / rank @@
+Normal rank
@@ Property / cites work @@
+Combinatorics of Compositions and Words
@@ Property / cites work: Combinatorics of Compositions and Words / rank @@
+Normal rank
@@ Property / cites work @@
+Complexity and algorithms for nonlinear optimization problems
+Normal rank
@@ Property / cites work @@
+A new polynomial-time algorithm for linear programming
+Normal rank
@@ Property / cites work @@
+Q5202849
@@ Property / cites work: Q5202849 / rank @@
+Normal rank
@@ Property / cites work @@
+Polynomial algorithms in linear programming
@@ Property / cites work: Polynomial algorithms in linear programming / rank @@
+Normal rank
@@ Property / cites work @@
+On a Frank-Wolfe type theorem in cubic optimization
+Normal rank
@@ Property / cites work @@
+A guide to conic optimisation and its applications
+Normal rank
@@ Property / cites work @@
+SOS Is Not Obviously Automatizable, Even Approximately
+Normal rank
@@ Property / cites work @@
+Quadratic programming with one negative eigenvalue is NP-hard
+Normal rank
@@ Property / cites work @@
+A Survey of the S-Lemma
@@ Property / cites work: A Survey of the S-Lemma / rank @@
+Normal rank
@@ Property / cites work @@
+An exact duality theory for semidefinite programming and its complexity implications
+Normal rank
@@ Property / cites work @@
+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
+Normal rank
@@ Property / cites work @@
+On the Computational Complexity of Approximating Solutions for Real Algebraic Formulae
+Normal rank
@@ Property / cites work @@
+Q4391222
@@ Property / cites work: Q4391222 / rank @@
+Normal rank
@@ Property / cites work @@
+Solving zero-dimensional systems through the rational univariate representation
+Normal rank
@@ Property / cites work @@
+Q3818127
@@ Property / cites work: Q3818127 / rank @@
+Normal rank
@@ Property / cites work @@
+Quadratic programming is in NP
@@ Property / cites work: Quadratic programming is in NP / rank @@
+Normal rank
@@ Property / cites work @@
+On the implementation of an interior-point filter line-search algorithm for large-scale nonlinear programming
+Normal rank
@@ Property / cites work @@
+Strange behaviors of interior-point methods for solving semidefinite programming problems in polynomial optimization
+Normal rank