Feasibility and Constraint Analysis of Sets of Linear Matrix Inequalities

Richard J. Caron, Tim Traynor, Shafiu Jibrin

Type: Article

Publication Date: 2009-06-30

Citations: 5

DOI: https://doi.org/10.1287/ijoc.1090.0323

View Publication

Locations

INFORMS journal on computing - View

Similar Works

Action	Title	Year	Authors
+	Rigorous constraint satisfaction for sampled linear systems	2016	Moritz Schulze Darup
+	Rigorous constraint satisfaction for sampled linear systems	2016	Moritz Schulze Darup
+	Infeasibility analysis for linear systems, a survey	2000	Katta G. Murty Santosh N. Kabadi R. Chandrasekaran
+	Voronoi Partition-based Scenario Reduction for Fast Sampling-based Stochastic Reachability Computation of LTI Systems	2018	Hossein Sartipizadeh Abraham P. Vinod Behçet Açıkmeşe Meeko Oishi
+	Cones and Systems of Inequalities	1999	Enrique Castillo Ángel Cobo Francisco Jubete Rosa Eva Pruneda
+	Rigorous techniques for continuous constraint satisfaction problems	2010	Ferenc Domes
+	Sample Truncation for Scenario Approach to Closed-loop Chance Constrained Trajectory Optimization for Linear Systems	2018	Hossein Sartipizadeh Behçet Açıkmeşe
+	Sample Truncation for Scenario Approach to Closed-loop Chance Constrained Trajectory Optimization for Linear Systems	2018	Hossein Sartipizadeh Behçet Açıkmeşe
+ PDF Chat	A Space Decomposition-Based Deterministic Algorithm for Solving Linear Optimization Problems	2019	Gerardo L. Febres
+ PDF Chat	Random Sampling Many-Dimensional Sets Arising in Control	2021	Pavel Shcherbakov Mingyue Ding Ming Yuchi
+	Reaching Feasibility Quickly for Sets of Linear Constraints	2018	Vladislav Brion
+	The Relation between Constraints and Feasible Solutions in a Linear-System	1974	T. Iga
+ PDF Chat	Sampling-Based Resolution-Complete Algorithms for Safety Falsification of Linear Systems	2008	Amit Bhatia Emilio Frazzoli
+ PDF Chat	Identifying relatively irreducible infeasible subsystems of linear inequalities	2021	Jérémy Omer Michael Poss
+	Calmness of the Feasible Set Mapping for Linear Inequality Systems	2014	M. J. Cánovas Marco A. López J. Parra F. Javier Toledo
+	Linear Programs and Their Solution Sets	2013	Peter Bürgisser Felipe Cucker
+	EQUALITY CONSTRAINTS USING MATRIX DECOMPOSITION	1999	Howard E. Doran Christopher J. O’Donnell Alicia N. Rambaldi
+ PDF Chat	Extending linear relaxation for non-square matrices and soft constraints	2016	Noreen Jamil Johannes Müller M. Asif Naeem Christof Lutteroth Gerald Weber
+	Résolution de problèmes non-linéaires avec continuum de solutions	2002	Xuan-Ha Vu Djamila Sam-Haroud Marius-Cǎlin Silaghi
+	MIP and Set Covering approaches for Sparse Approximation	2020	Diego Delle Donne Matthieu Kowalski Leo Liberti

Works That Cite This (4)

Action	Title	Year	Authors
+ PDF Chat	Constraint Consensus Methods for Finding Interior Feasible Points in Second-Order Cones	2010	Anna Weigandt Kaitlyn Tuthill Shafiu Jibrin
+ PDF Chat	Constraint Consensus Methods for Finding Strictly Feasible Points of Linear Matrix Inequalities	2015	Shafiu Jibrin James W. Swift
+ PDF Chat	An Interior Point Method for Solving Semidefinite Programs Using Cutting Planes and Weighted Analytic Centers	2012	John Machacek Shafiu Jibrin
+	On the validity of parametric block correlation matrices with constant within and between group correlations	2017	Olivier Roustant Yves Deville

Works Cited by This (12)

Action	Title	Year	Authors
+	Interior Point Methods in Semidefinite Programming with Applications to Combinatorial Optimization	1995	Farid Alizadeh
+	SDPLIB 1.2, a library of semidefinite programming test problems	1999	Brian Borchers
+	Hit-and-run algorithms for the identification of nonredundant linear inequalities	1987	H. C. P. Berbee C. G. E. Boender Ran An C.L. Scheffer Robert L. Smith Jan Telgen
+ PDF Chat	Hit-and-Run Algorithms for Generating Multivariate Distributions	1993	Claude Bélisle H. Edwin Romeijn Robert L. Smith
+	Convergence properties of hit–and–run samplers	1998	Claude Bélisle A. Boneh Richard J. Caron
+	Presolving in linear programming	1995	Erling D. Andersen Knud D. Andersen
+	Hit-and-run mixes fast	1999	László Lovász
+ PDF Chat	The Constraint Consensus Method for Finding Approximately Feasible Points in Nonlinear Programs	2004	John W. Chinneck
+ PDF Chat	Efficient Monte Carlo Procedures for Generating Points Uniformly Distributed over Bounded Regions	1984	Robert L. Smith
+	HIT AND RUN AS A UNIFYING DEVICE	2007	Hans Christian Andersen Persi Diaconis