Solving matrix inequalities whose unknowns are matrices

This paper provides algorithms for numerical solution of convex matrix inequalities (MIs) in which the variables naturally appear as matrices. This includes, for instance, many systems and control problems. To use these algorithms, no knowledge of linear matrix inequalities (LMIs) is required. Howev...

Full description

Saved in:
Bibliographic Details
Main Authors: Camino, J.F., Helton, J.W., Skelton, R.E.
Format: Conference Proceeding
Language:English
Subjects:
Aerospace engineering
Control systems
Control theory
Linear matrix inequalities
Mathematics
Matrix converters
Mechanical engineering
Mechanical variables control
Optimization methods
Sufficient conditions
Online Access:Request full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:This paper provides algorithms for numerical solution of convex matrix inequalities (MIs) in which the variables naturally appear as matrices. This includes, for instance, many systems and control problems. To use these algorithms, no knowledge of linear matrix inequalities (LMIs) is required. However, as tools, they preserve many advantages of the linear matrix inequality framework. Our method has two components: 1) a numerical (partly symbolic) algorithm that solves a large class of matrix optimization problems; 2) a symbolic "Convexity Checker" that automatically provides a region which, if convex, guarantees that the solution from (1) is a global optimum on that region.
ISSN:0191-2216
DOI:10.1109/CDC.2004.1428958