Real root finding for determinants of linear matrices
From MaRDI portal
Publication:898255
DOI10.1016/j.jsc.2015.06.010zbMath1329.65090arXiv1412.5873OpenAlexW1559760555MaRDI QIDQ898255
Mohab Safey El Din, Didier Henrion, Simone Naldi
Publication date: 8 December 2015
Published in: Journal of Symbolic Computation (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1412.5873
Computational aspects of higher-dimensional varieties (14Q15) Numerical computation of determinants (65F40) Numerical computation of roots of polynomial equations (65H04)
Related Items
Real root finding for low rank linear matrices, Solving rank-constrained semidefinite programs in exact arithmetic, Exact algorithms for semidefinite programs with degenerate feasible set, Exact Algorithms for Linear Matrix Inequalities
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On the complexity of the generalized MinRank problem
- Gröbner bases of bihomogeneous ideals generated by polynomials of bidegree \((1,1)\): algorithms and complexity
- The algebraic degree of semidefinite programming
- On sign conditions over real multivariate polynomials
- Algebraic geometry. An introduction. Transl. from the French by Catriona Maclean
- A new efficient algorithm for computing Gröbner bases \((F_4)\)
- Testing sets for properness of polynomial mappings
- Efficient computation of zero-dimensional Gröbner bases by change of ordering
- Polar varieties, real equation solving, and data structures: the hypersurface case
- Generalized polar varieties: geometry and algorithms
- Lectures on Modern Convex Optimization
- The State-of-the-Art in Conic Optimization Software
- Maximum Likelihood for Matrices with Rank Constraints
- Computing loci of rank defects of linear matrices using Gröbner bases and applications to cryptology
- A Nearly Optimal Algorithm for Deciding Connectivity Queries in Smooth and Bounded Real Algebraic Sets
- Likelihood Geometry
- Sufficient and Necessary Conditions for Semidefinite Representability of Convex Hulls and Sets
- Linear Matrix Inequalities in System and Control Theory
- Semidefinite Optimization and Convex Algebraic Geometry
- Critical points and Gröbner bases
- Fast algorithm for change of ordering of zero-dimensional Gröbner bases with sparse multiplication matrices
- FGb: A Library for Computing Gröbner Bases
- Algorithms in real algebraic geometry
- A Gröbner free alternative for polynomial system solving
- Polar varieties and efficient real elimination
- The Euclidean distance degree of an algebraic variety
