Solving generic parametric linear matrix inequalities

DOI10.1145/3747199.3747570MaRDI QIDQ7288975zbMATH OpenFDO

Authors Simone Naldi, Mohab Safey El Din, Adrien B. Taylor, Weijia Wang

Publication date 1 July 2026

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1145/3747199.3747570

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30)

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
• 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 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 3435574 (Why is no real title available?)
• scientific article; zbMATH DE number 2151204 (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
• 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
• Smooth strongly convex interpolation and exact worst-case performance of first-order methods
• Solving parameter-dependent semi-algebraic systems
• Solving parametric systems of polynomial equations over the reals through Hermite matrices

Cited in

(1)

• Solving parametric linear matrix inequalities

This page was built for publication: Solving generic parametric linear matrix inequalities

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7288975)