Bounding Ellipsoids for Uncertain LinearEquations and Dynamical Systems: the Convex Optimization Approach

Giuseppe C. Calafiore, Laurent El GhaouiPORTO 2002

Abstract

In this paper, we discuss semidefinite relaxation techniques for computing minimal size ellipsoids that bound the solution set of a system of uncertain linear equations (ULE). The proposed technique is based on the combination of a quadratic embedding of the uncertainty, and the Sprocedure. The resulting bounding condition is expressed as a Linear Matrix Inequality (LMI) constraint on the ellipsoid parameters and the additional scaling variables. This formulation leads to a convex optimization problem that can be efficiently solved by means of interior point barrier methods
BibTeX
@inproceedings{calafiore2002bounding,
  author = {Giuseppe C. Calafiore and Laurent El Ghaoui},
  title = {{Bounding Ellipsoids for Uncertain LinearEquations and Dynamical Systems: the Convex Optimization Approach}},
  booktitle = {PORTO},
  year = {2002},
}

Loading related content...

Figure