Feasibility and Constraint Analysis of Sets of Linear Matrix Inequalities
From MaRDI portal
Publication:2899045
DOI10.1287/ijoc.1090.0323zbMath1243.90172OpenAlexW2110344857MaRDI QIDQ2899045
Shafiu Jibrin, Tim Traynor, Richard J. Caron
Publication date: 28 July 2012
Published in: INFORMS Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/195d2baed5037c51f4bbad6f6c9e0207759ee820
linear matrix inequalitiesirreducible infeasible setspositive semidefinite programmingfeasibility redundancy
Related Items (3)
Constraint consensus methods for finding strictly feasible points of linear matrix inequalities ⋮ Constraint consensus methods for finding interior feasible points in second-order cones ⋮ An interior point method for solving semidefinite programs using cutting planes and weighted analytic centers
Uses Software
This page was built for publication: Feasibility and Constraint Analysis of Sets of Linear Matrix Inequalities