Feasibility and constraint analysis of sets of linear matrix inequalities

Richard J. Caron, Tim Traynor, Shafiu Jibrin

Research output: Contribution to journalArticle

3 Citations (Scopus)

Abstract

We present a constraint analysis methodology for linear matrix inequality constraints. If the constraint set is found to be feasible, we search for a minimal representation; otherwise, we search for an irreducible infeasible system. The work is based on the solution of a set-covering problem where each row corresponds to a sample point and is determined by constraint satisfaction at the sampled point. Thus, an implementation requires a method to collect points in the ambient space and a constraint oracle. Much of this paper will be devoted to the development of a hit-and-run sampling methodology. Test results confirm that our approach not only provides information required for constraint analysis but will also, if the feasible region has a nonvoid interior, with probability one, find a feasible point.

Original languageEnglish (US)
Pages (from-to)144-153
Number of pages10
JournalINFORMS Journal on Computing
Volume22
Issue number1
DOIs
StatePublished - Dec 2010

Fingerprint

Linear matrix inequalities
Sampling
Methodology
Linear matrix inequality
Set covering problem
Inequality constraints
Constraint satisfaction

Keywords

  • Feasibility
  • Irreducible infeasible sets
  • Linear matrix inequalities
  • Positive semidefinite programming
  • Redundancy

ASJC Scopus subject areas

  • Software
  • Information Systems
  • Computer Science Applications
  • Management Science and Operations Research

Cite this

Feasibility and constraint analysis of sets of linear matrix inequalities. / Caron, Richard J.; Traynor, Tim; Jibrin, Shafiu.

In: INFORMS Journal on Computing, Vol. 22, No. 1, 12.2010, p. 144-153.

Research output: Contribution to journalArticle

Caron, Richard J. ; Traynor, Tim ; Jibrin, Shafiu. / Feasibility and constraint analysis of sets of linear matrix inequalities. In: INFORMS Journal on Computing. 2010 ; Vol. 22, No. 1. pp. 144-153.
@article{0c069956bf30417f803d50d49912d9d3,
title = "Feasibility and constraint analysis of sets of linear matrix inequalities",
abstract = "We present a constraint analysis methodology for linear matrix inequality constraints. If the constraint set is found to be feasible, we search for a minimal representation; otherwise, we search for an irreducible infeasible system. The work is based on the solution of a set-covering problem where each row corresponds to a sample point and is determined by constraint satisfaction at the sampled point. Thus, an implementation requires a method to collect points in the ambient space and a constraint oracle. Much of this paper will be devoted to the development of a hit-and-run sampling methodology. Test results confirm that our approach not only provides information required for constraint analysis but will also, if the feasible region has a nonvoid interior, with probability one, find a feasible point.",
keywords = "Feasibility, Irreducible infeasible sets, Linear matrix inequalities, Positive semidefinite programming, Redundancy",
author = "Caron, {Richard J.} and Tim Traynor and Shafiu Jibrin",
year = "2010",
month = "12",
doi = "10.1287/ijoc.1090.0323",
language = "English (US)",
volume = "22",
pages = "144--153",
journal = "INFORMS Journal on Computing",
issn = "1091-9856",
publisher = "INFORMS Inst.for Operations Res.and the Management Sciences",
number = "1",

}

TY - JOUR

T1 - Feasibility and constraint analysis of sets of linear matrix inequalities

AU - Caron, Richard J.

AU - Traynor, Tim

AU - Jibrin, Shafiu

PY - 2010/12

Y1 - 2010/12

N2 - We present a constraint analysis methodology for linear matrix inequality constraints. If the constraint set is found to be feasible, we search for a minimal representation; otherwise, we search for an irreducible infeasible system. The work is based on the solution of a set-covering problem where each row corresponds to a sample point and is determined by constraint satisfaction at the sampled point. Thus, an implementation requires a method to collect points in the ambient space and a constraint oracle. Much of this paper will be devoted to the development of a hit-and-run sampling methodology. Test results confirm that our approach not only provides information required for constraint analysis but will also, if the feasible region has a nonvoid interior, with probability one, find a feasible point.

AB - We present a constraint analysis methodology for linear matrix inequality constraints. If the constraint set is found to be feasible, we search for a minimal representation; otherwise, we search for an irreducible infeasible system. The work is based on the solution of a set-covering problem where each row corresponds to a sample point and is determined by constraint satisfaction at the sampled point. Thus, an implementation requires a method to collect points in the ambient space and a constraint oracle. Much of this paper will be devoted to the development of a hit-and-run sampling methodology. Test results confirm that our approach not only provides information required for constraint analysis but will also, if the feasible region has a nonvoid interior, with probability one, find a feasible point.

KW - Feasibility

KW - Irreducible infeasible sets

KW - Linear matrix inequalities

KW - Positive semidefinite programming

KW - Redundancy

UR - http://www.scopus.com/inward/record.url?scp=77949369224&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=77949369224&partnerID=8YFLogxK

U2 - 10.1287/ijoc.1090.0323

DO - 10.1287/ijoc.1090.0323

M3 - Article

VL - 22

SP - 144

EP - 153

JO - INFORMS Journal on Computing

JF - INFORMS Journal on Computing

SN - 1091-9856

IS - 1

ER -