Symbolic computation in hyperbolic programming
From MaRDI portal
Publication:4561483
DOI10.1142/S021949881850192XzbMath1403.14093arXiv1612.07340WikidataQ114847087 ScholiaQ114847087MaRDI QIDQ4561483
Publication date: 6 December 2018
Published in: Journal of Algebra and Its Applications (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1612.07340
Symbolic computation and algebraic computation (68W30) Semidefinite programming (90C22) Convex programming (90C25) Effectivity, complexity and computational aspects of algebraic geometry (14Q20)
Related Items (1)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Properness defects and projections and computation of at least one point in each connected component of a real algebraic set
- Polynomial-sized semidefinite representations of derivative relaxations of spectrahedral cones
- The algebraic degree of semidefinite programming
- Deformation techniques for sparse systems
- 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
- On a positive semidefinite relaxation of the cut polytope
- Quartic spectrahedra
- Hyperbolic programs, and their derivative relaxations
- Exact Algorithms for Linear Matrix Inequalities
- Solving Rank-Constrained Semidefinite Programs in Exact Arithmetic
- Hyperbolic Polynomials and Interior Point Methods for Convex Programming
- Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
- On the combinatorial and algebraic complexity of quantifier elimination
- A Gröbner free alternative for polynomial system solving
This page was built for publication: Symbolic computation in hyperbolic programming
