Aspects of semidefinite programming. Interior point algorithms and selected applications (Q1597978): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Removed claim: author (P16): Item:Q172145 |
||
Property / author | |||
Property / author: Etienne de Klerk / rank | |||
Revision as of 07:31, 10 February 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Aspects of semidefinite programming. Interior point algorithms and selected applications |
scientific article |
Statements
Aspects of semidefinite programming. Interior point algorithms and selected applications (English)
0 references
29 May 2002
0 references
This book is an efficient and well-readable presentation of some selected topics on theory and applications of SDP (semidefinite programming). (SDP) is a special subclass of nonlinear convex optimization which during the last decade became a very active research area in applied mathematics: the number of new results, articles and books on this subject as well as corresponding applications to real-life problems is still growing considerably. Exemplarily, applications in systems, control theory and combinatorial optimization are mentioned here. The book is divided into four parts: -- an introductory Chapter 1, -- Part I Theory and Algorithms (Chapters 2-8), -- Part II Selected Applications (Chapters 9-13) and - Appendices. The introductory chapter offers a short overview of the field of (SDP) including a survey on interior point methods as well as applications in combinatorial optimization and engineering. Part I Theory and Algorithms: Chapter 2: Duality, optimality, and degeneracy Chapter 3: The central path Chapter 4: Self-dual embeddings Chapter 5: The primal logarithmic barrier method Chapter 6: Primal-dual affine-scaling methods Chapter 7: Primal-dual path-following methods Chapter 8: Primal-dual potential reduction methods Part II Selected Applications Chapter 9: Convex quadratic approximation Chapter 10: The Lovasz function Chapter 11: Graph colouring and the max-K-cut problem Chapter 12: The stability number of a graph Chapter 13: The satisfiability problem. The appendices contain some background material (on matrix calculus, convex analysis, nonlinear optimization and analytic functions) which is used in this book. The well-written monograph is self-contained and an updated version of the PhD thesis of the author. It may be useful to several types of readers; for graduate and undergraduate students as well as for mathematicians and engineers dealing with applications that can be modelled by semidefinite calculus. Altogether, this monograph represents an outstanding contribution to applied mathematics for both students and researchers alike.
0 references
semidefinite programming
0 references
interior point methods
0 references
primal-dual affine-scaling methods
0 references
path-following methods
0 references
logarithmic barrier methods
0 references