Skip to main content
SpringerLink
Log in

Introduction and Preliminaries

  • Chapter
  • First Online:
Geometry of Linear Matrix Inequalities

Part of the book series: Compact Textbooks in Mathematics ((CTM))

  • 551 Accesses

Abstract

In this first chapter we give an introduction and outline of the topics from the book. We also introduce basic notions and results from linear algebra, convexity theory and real algebraic geometry.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 44.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 59.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. A. Barvinok, A Course in Convexity. Graduate Studies in Mathematics, vol. 54 (American Mathematical Society, Providence, 2002)

    Google Scholar 

  2. A. Ben-Tal, A. Nemirovski, Lectures on Modern Convex Optimization. Analysis, Algorithms, and Engineering Applications. MPS/SIAM Series on Optimization (Society for Industrial and Applied Mathematics (SIAM), Philadelphia, 2001)

    Google Scholar 

  3. G. Blekherman, P.A. Parrilo, R.R. Thomas (eds.), Semidefinite Optimization and Convex Algebraic Geometry. MOS-SIAM Series on Optimization, vol. 13 (Society for Industrial and Applied Mathematics (SIAM)/Mathematical Optimization Society, Philadelphia, 2013)

    Google Scholar 

  4. J. Bochnak, M. Coste, M.-F. Roy, Real Algebraic Geometry. Ergebnisse der Mathematik und ihrer Grenzgebiete (3), vol. 36 (Springer-Verlag, Berlin, 1998)

    Google Scholar 

  5. S. Boyd, L. El Ghaoui, E. Feron, V. Balakrishnan, Linear Matrix Inequalities in System and Control Theory. SIAM Studies in Applied Mathematics, vol. 15 (Society for Industrial and Applied Mathematics (SIAM), Philadelphia, 1994)

    Google Scholar 

  6. S. Boyd, L. Vandenberghe, Convex Optimization (Cambridge University Press, Cambridge, 2004)

    Book  MATH  Google Scholar 

  7. G.B. Dantzig, M.N. Thapa, Linear Programming. Springer Series in Operations Research, vol. 1 (Springer-Verlag, New York, 1997)

    Google Scholar 

  8. G.B. Dantzig, M.N. Thapa, Linear Programming. Springer Series in Operations Research, vol. 2 (Springer-Verlag, New York, 2003). Theory and extensions.

    Google Scholar 

  9. E. de Klerk, M. Laurent, On the Lasserre hierarchy of semidefinite programming relaxations of convex polynomial optimization problems. SIAM J. Optim. 21(3), 824–832 (2011)

    Article  MathSciNet  MATH  Google Scholar 

  10. M. Grötschel, L. Lovász, A. Schrijver, Polynomial algorithms for perfect graphs, in Topics on Perfect Graphs. North-Holland Math. Stud., vol. 88 (North-Holland, Amsterdam, 1984), pp. 325–356

    Google Scholar 

  11. J.W. Helton, J. Nie, Sufficient and necessary conditions for semidefinite representability of convex hulls and sets. SIAM J. Optim. 20(2), 759–791 (2009)

    Article  MathSciNet  MATH  Google Scholar 

  12. J.W. Helton, J. Nie, Semidefinite representation of convex sets. Math. Program. A 122(1), 21–62 (2010)

    Article  MathSciNet  MATH  Google Scholar 

  13. J.W. Helton, V.Vinnikov, Linear matrix inequality representation of sets. Commun. Pure Appl. Math. 60(5), 654–674 (2007)

    Article  MathSciNet  MATH  Google Scholar 

  14. J.B. Lasserre, Global optimization with polynomials and the problem of moments. SIAM J. Optim. 11(3), 796–817 (electronic) (2000/2001)

    Google Scholar 

  15. J.B. Lasserre, Convex sets with semidefinite representation. Math. Program. 120(2, Ser. A), 457–477 (2009)

    Google Scholar 

  16. M. Laurent, S. Poljak, On a positive semidefinite relaxation of the cut polytope. Linear Algebra Appl. 223/224, 439–461 (1995). Special issue honoring Miroslav Fiedler and Vlastimil Pták

    Google Scholar 

  17. P.D. Lax, Differential equations, difference equations and matrix theory. Commun. Pure Appl. Math. 11, 175–194 (1958)

    Article  MathSciNet  MATH  Google Scholar 

  18. A.S. Lewis, P.A. Parrilo, M.V. Ramana, The Lax conjecture is true. Proc. Am. Math. Soc. 133(9), 2495–2499 (electronic) (2005)

    Google Scholar 

  19. M. Marshall, Positive Polynomials and Sums of Squares. Mathematical Surveys and Monographs, vol. 146 (American Mathematical Society, Providence, 2008)

    Google Scholar 

  20. Y. Nesterov, A. Nemirovski, Interior-Point Polynomial Algorithms in Convex Programming. SIAM Studies in Applied Mathematics, vol. 13 (Society for Industrial and Applied Mathematics (SIAM), Philadelphia, 1994)

    Google Scholar 

  21. P.A. Parrilo, Structured semidefinite programs and semialgebraic geometry methods in robustness and optimization. Ph.D Thesis, 2000

    Google Scholar 

  22. G. Pataki, On the facial structure of cone-lp’s and semidefinite programs. Management Science Research Report, MSRR-595, 1994

    Google Scholar 

  23. A. Prestel, C.N. Delzell, Positive Polynomials. Springer Monographs in Mathematics (Springer-Verlag, Berlin, 2001)

    Google Scholar 

  24. M. Ramana, A.J. Goldman, Some geometric results in semidefinite programming. J. Global Optim. 7(1), 33–50 (1995)

    Article  MathSciNet  MATH  Google Scholar 

  25. R.T. Rockafellar, Convex Analysis. Princeton Mathematical Series, vol. 28 (Princeton University Press, Princeton, 1970)

    Google Scholar 

  26. C. Scheiderer, Semidefinite representation for convex hulls of real algebraic curves. SIAM J. Appl. Algebra Geom. 2(1), 1–25 (2018)

    Article  MathSciNet  MATH  Google Scholar 

  27. C. Scheiderer, Spectrahedral shadows. SIAM J. Appl. Algebra Geom. 2(1), 26–44 (2018)

    Article  MathSciNet  MATH  Google Scholar 

  28. M. Todd, Semidefinite optimization. Acta Numer. 10, 515–560 (2001)

    Article  MathSciNet  MATH  Google Scholar 

  29. L. Vandenberghe, S. Boyd, Semidefinite programming. SIAM Rev. 38(1), 49–95 (1996)

    Article  MathSciNet  MATH  Google Scholar 

  30. R. Webster, Convexity. Oxford Science Publications (The Clarendon Press/Oxford University Press, New York, 1994)

    MATH  Google Scholar 

  31. Wolfram Research, Inc., Mathematica, Version 13.2 (Wolfram Research, Inc., Champaign, 2022)

    Google Scholar 

  32. H. Wolkowicz, R. Saigal, L. Vandenberghe (eds.), Handbook of Semidefinite Programming. Theory, Algorithms, and Applications. International Series in Operations Research & Management Science, vol. 27 (Kluwer Academic Publishers, Boston, 2000)

    Google Scholar 

  33. G.M. Ziegler, Lectures on Polytopes. Graduate Texts in Mathematics, vol. 152 (Springer-Verlag, New York, 1995)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institut für Mathematik, Universität Innsbruck, Innsbruck, Austria

    Tim Netzer

  2. Fakultät für Mathematik, Technische Universität Dortmund, Dortmund, Nordrhein-Westfalen, Germany

    Daniel Plaumann

Authors
  1. Tim Netzer
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Daniel Plaumann
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

Copyright information

© 2023 The Author(s), under exclusive license to Springer Nature Switzerland AG

About this chapter

Check for updates. Verify currency and authenticity via CrossMark

Cite this chapter

Netzer, T., Plaumann, D. (2023). Introduction and Preliminaries. In: Geometry of Linear Matrix Inequalities. Compact Textbooks in Mathematics. Birkhäuser, Cham. https://doi.org/10.1007/978-3-031-26455-9_1

Download citation

Publish with us

Policies and ethics

Search

Navigation