Solving rank-constrained semidefinite programs in exact arithmetic
From MaRDI portal
Publication:2409017
DOI10.1016/J.JSC.2017.07.009zbMATH Open1380.90212OpenAlexW2734887310MaRDI QIDQ2409017FDOQ2409017
Authors: Simone Naldi 
Publication date: 10 October 2017
Published in: Journal of Symbolic Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jsc.2017.07.009
Recommendations
polynomial optimizationcomputer algebrasemidefinite programmingdeterminantal varietiesexact algorithmslinear matrix inequalitiessums of squaresspectrahedrarank constraints
Cites Work
- FGb: A Library for Computing Gröbner Bases
- Title not available (Why is that?)
- Linear Matrix Inequalities in System and Control Theory
- Lectures on modern convex optimization. Analysis, algorithms, and engineering applications
- Ideals, varieties, and algorithms. An introduction to computational algebraic geometry and commutative algebra
- Semidefinite Programming
- Geometric algorithms and combinatorial optimization
- Global optimization with polynomials and the problem of moments
- Title not available (Why is that?)
- Semidefinite programming relaxations for semialgebraic problems
- Solving zero-dimensional systems through the rational univariate representation
- Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
- A Newton-like method for solving rank constrained linear matrix inequalities
- Optimality conditions and finite convergence of Lasserre's hierarchy
- The algebraic degree of semidefinite programming
- Handbook on semidefinite, conic and polynomial optimization
- Complexity of the positive semidefinite matrix completion problem with a rank constraint
- Computing loci of rank defects of linear matrices using Gröbner bases and applications to cryptology
- Title not available (Why is that?)
- An algorithm for sums of squares of real polynomials
- Fast algorithm for change of ordering of zero-dimensional Gröbner bases with sparse multiplication matrices
- Deformation techniques for sparse systems
- Nearly optimal refinement of real roots of a univariate polynomial
- On the complexity of semidefinite programs
- Probabilistic Algorithm for Polynomial Optimization over a Real Algebraic Set
- A Nearly Optimal Algorithm for Deciding Connectivity Queries in Smooth and Bounded Real Algebraic Sets
- Real root finding for determinants of linear matrices
- Exact algorithms for linear matrix inequalities
- Gram spectrahedra
- Real root finding for rank defects in linear Hankel matrices
- Solving rank-constrained semidefinite programs in exact arithmetic
Cited In (12)
- A class of semidefinite programs with rank-one solutions
- Symbolic computation in hyperbolic programming
- Finding maximum rank moment matrices by facial reduction on primal form and Douglas-Rachford iteration
- Solving rank-constrained semidefinite programs in exact arithmetic
- Low-rank exploitation in semidefinite programming for control
- Grothendieck inequalities for semidefinite programs with rank constraint
- Exact algorithms for linear matrix inequalities
- Mixed-Projection Conic Optimization: A New Paradigm for Modeling Rank Constraints
- Exact Semidefinite Programming Bounds for Packing Problems
- Semidefinite programming and arithmetic circuit evaluation
- The degree of \(\text{SO}(n,\mathbb{C})\)
- Contracting optimally an interval matrix without loosing any positive semi-definite matrix is a tractable problem
Uses Software
This page was built for publication: Solving rank-constrained semidefinite programs in exact arithmetic
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2409017)
