Semidefinite Programming and Linear Matrix Inequalities

Li Li
Additional contact information
Li Li: Tsinghua University

Chapter Chapter 5 in Selected Applications of Convex Optimization, 2015, pp 99-114 from Springer

Abstract: Abstract In this chapter, we study semidefinite programming (SDP) problems and linear matrix inequalities (LMI). Particularly, we will revisit some discrete-time and continuous-time linear systems from the viewpoint of LMI.

Keywords: Semidefinite Programming; Linear Matrix Inequalities (LMI); Discrete-time Linear Systems; Continuous-time Algebraic Riccati Equation (CARE); Schur Complement (search for similar items in EconPapers)
Date: 2015
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:spochp:978-3-662-46356-7_5

Ordering information: This item can be ordered from
http://www.springer.com/9783662463567

DOI: 10.1007/978-3-662-46356-7_5

Access Statistics for this chapter

More chapters in Springer Optimization and Its Applications from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().