Pages that link to "Item:Q2368126"
From MaRDI portal
The following pages link to Feasibility testing for systems of real quadratic equations (Q2368126):
Displaying 28 items.
- Bounding the equivariant Betti numbers of symmetric semi-algebraic sets (Q340423) (← links)
- Computing the top Betti numbers of semialgebraic sets defined by quadratic inequalities in polynomial time (Q937274) (← links)
- A sharper estimate on the Betti numbers of sets defined by quadratic inequalities (Q938303) (← links)
- Bounding the Betti numbers and computing the Euler-Poincaré characteristic of semi-algebraic sets defined by partly quadratic systems of polynomials (Q967467) (← links)
- Computing the Betti numbers of semi-algebraic sets defined by partly quadratic systems of polynomials (Q1024388) (← links)
- Bit complexity for multi-homogeneous polynomial system solving -- application to polynomial minimization (Q1690788) (← links)
- An SOCP relaxation based branch-and-bound method for generalized trust-region subproblem (Q2031320) (← links)
- On the tightness of SDP relaxations of QCQPs (Q2133408) (← links)
- When a system of real quadratic equations has a solution (Q2143674) (← links)
- A survey of hidden convex optimization (Q2176821) (← links)
- Deciding Koopman's qualitative probability (Q2238703) (← links)
- A complexity theory of constructible functions and sheaves (Q2340508) (← links)
- On projections of semi-algebraic sets defined by few quadratic inequalities (Q2482191) (← links)
- A Note on Polynomial Solvability of the CDT Problem (Q2789609) (← links)
- A Two-Variable Approach to the Two-Trust-Region Subproblem (Q2796795) (← links)
- Solving Generalized CDT Problems via Two-Parameter Eigenvalues (Q2817837) (← links)
- Kronecker Product Constraints with an Application to the Two-Trust-Region Subproblem (Q2968177) (← links)
- On Convex Hulls of Epigraphs of QCQPs (Q5041762) (← links)
- On Obtaining the Convex Hull of Quadratic Inequalities via Aggregations (Q5072594) (← links)
- A Linear-Time Algorithm for Globally Maximizing the Sum of a Generalized Rayleigh Quotient and a Quadratic Form on the Unit Sphere (Q5231687) (← links)
- New Results on Narrowing the Duality Gap of the Extended Celis--Dennis--Tapia Problem (Q5737733) (← links)
- Complexity, exactness, and rationality in polynomial optimization (Q5918421) (← links)
- Complexity, exactness, and rationality in polynomial optimization (Q5925641) (← links)
- (Global) optimization: historical notes and recent developments (Q6114910) (← links)
- Sharp and Fast Bounds for the Celis-Dennis-Tapia Problem (Q6161303) (← links)
- How Do Exponential Size Solutions Arise in Semidefinite Programming? (Q6195320) (← links)
- Solving two-trust-region subproblems using semidefinite optimization with eigenvector branching (Q6596338) (← links)
- Integrating products of quadratic forms (Q6624169) (← links)
