Feasibility testing for systems of real quadratic equations
From MaRDI portal
Publication:2368126
DOI10.1007/BF02573959zbMath0812.12006MaRDI QIDQ2368126
Publication date: 15 May 1995
Published in: Discrete \& Computational Geometry (Search for Journal in Brave)
Full work available at URL: https://eudml.org/doc/131256
Related Items
On Convex Hulls of Epigraphs of QCQPs, On the tightness of SDP relaxations of QCQPs, When a system of real quadratic equations has a solution, Bounding the equivariant Betti numbers of symmetric semi-algebraic sets, On Obtaining the Convex Hull of Quadratic Inequalities via Aggregations, A survey of hidden convex optimization, Bit complexity for multi-homogeneous polynomial system solving -- application to polynomial minimization, (Global) optimization: historical notes and recent developments, Sharp and Fast Bounds for the Celis-Dennis-Tapia Problem, How Do Exponential Size Solutions Arise in Semidefinite Programming?, Kronecker Product Constraints with an Application to the Two-Trust-Region Subproblem, Computing the top Betti numbers of semialgebraic sets defined by quadratic inequalities in polynomial time, A sharper estimate on the Betti numbers of sets defined by quadratic inequalities, Deciding Koopman's qualitative probability, On projections of semi-algebraic sets defined by few quadratic inequalities, New Results on Narrowing the Duality Gap of the Extended Celis--Dennis--Tapia Problem, Bounding the Betti numbers and computing the Euler-Poincaré characteristic of semi-algebraic sets defined by partly quadratic systems of polynomials, A Note on Polynomial Solvability of the CDT Problem, An SOCP relaxation based branch-and-bound method for generalized trust-region subproblem, A Two-Variable Approach to the Two-Trust-Region Subproblem, Complexity, exactness, and rationality in polynomial optimization, Complexity, exactness, and rationality in polynomial optimization, Solving Generalized CDT Problems via Two-Parameter Eigenvalues, Computing the Betti numbers of semi-algebraic sets defined by partly quadratic systems of polynomials, A Linear-Time Algorithm for Globally Maximizing the Sum of a Generalized Rayleigh Quotient and a Quadratic Form on the Unit Sphere, A complexity theory of constructible functions and sheaves
Cites Work
- The diagonal of a D-finite power series is D-finite
- Solving systems of polynomial inequalities in subexponential time
- On the computational complexity and geometry of the first-order theory of the reals. II: The general decision problem. Preliminaries for quantifier elimination
- Oriented matroids
- Combinatorial 3-manifolds with few vertices
- Twistorial examples of \(*\)-Einstein manifolds
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
