Skip to main content
Article thumbnail
Location of Repository

Connections Between Semi-Infinite and Semidefinite Programming

By Lieven Vandenberghe and Stephen Boyd

Abstract

We consider convex optimization problems with linear matrix inequality (LMI) constraints, i.e., constraints of the form F (x) =F0+x1F1+ +xmFm 0; (1.1) where the matrices Fi = F

Topics: Kluwer Academic Publishers
Year: 2008
OAI identifier: oai:CiteSeerX.psu:10.1.1.134.1722
Provided by: CiteSeerX
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • http://citeseerx.ist.psu.edu/v... (external link)
  • http://www.stanford.edu/~boyd/... (external link)
  • Suggested articles


    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.