Solving parametric linear matrix inequalities
From MaRDI portal
Cites work
- A Nearly Optimal Algorithm for Deciding Connectivity Queries in Smooth and Bounded Real Algebraic Sets
- Bit complexity for computing one point in each connected component of a smooth real algebraic set
- Bit complexity for multi-homogeneous polynomial system solving -- application to polynomial minimization
- Complexity of deciding Tarski algebra
- Computing parametric geometric resolutions
- Cylindrical algebraic decomposition using validated numerics
- Definability and fast quantifier elimination in algebraically closed fields
- Exact algorithms for linear matrix inequalities
- Exact algorithms for semidefinite programs with degenerate feasible set
- Exact worst-case performance of first-order methods for composite convex optimization
- Extrait d'une lettre de Mr. Ch. Hermite de Paris à Mr. Borchardt de Berlin sur le nombre des racines d'une équation algébrique comprises entre des limites données.
- Faster one block quantifier elimination for regular polynomial systems of equations
- scientific article; zbMATH DE number 3497890 (Why is no real title available?)
- scientific article; zbMATH DE number 1201576 (Why is no real title available?)
- scientific article; zbMATH DE number 621806 (Why is no real title available?)
- scientific article; zbMATH DE number 3435574 (Why is no real title available?)
- scientific article; zbMATH DE number 2151204 (Why is no real title available?)
- scientific article; zbMATH DE number 2107836 (Why is no real title available?)
- scientific article; zbMATH DE number 3068536 (Why is no real title available?)
- msolve. A library for solving polynomial systems
- Nemo/Hecke. Computer algebra and number theory packages for the Julia programming language
- On sparse interpolation of rational functions and gcds
- On the combinatorial and algebraic complexity of quantifier elimination
- On the geometry of polar varieties
- On the stability of Gröbner bases under specializations
- Operator splitting performance estimation: tight contraction factors and optimal parameter selection
- Performance of first-order methods for smooth convex minimization: a novel approach
- Quantifier elimination by cylindrical algebraic decomposition based on regular chains
- Real root finding for determinants of linear matrices
- Scattering amplitudes over finite fields and multivariate functional reconstruction
- Smooth strongly convex interpolation and exact worst-case performance of first-order methods
- Solving generic parametric linear matrix inequalities
- Solving parameter-dependent semi-algebraic systems
- Solving parametric systems of polynomial equations over the reals through Hermite matrices
- Solving rank-constrained semidefinite programs in exact arithmetic
- Solving systems of polynomial inequalities in subexponential time
- Sparse interpolation of multivariate rational functions
- Sur la complexité du principe de Tarski-Seidenberg
- Variant quantifier elimination
- Variant real quantifier elimination: algorithm and application
This page was built for publication: Solving parametric linear matrix inequalities
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7323801)
