Abstract
Positive semidefinite (PSD) and positive definite (PD) matrices are closely connected with Euclidean distance matrices. Accordingly, they play a central role in this monograph. This chapter reviews some of the basic results concerning these matrices. Among the topics discussed are various characterizations of PSD and PD matrices, theorems of the alternative for the semidefinite cone, the facial structures of the semidefinite cone and spectrahedra, as well as the Borwein–Wolkowicz facial reduction scheme.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
A.Y. Alfakih, On Farkas lemma and dimensional rigidity of bar frameworks. Linear Algebra Appl. 486, 504–522 (2015)
F. Alizadeh, J.A. Haeberly, M.L. Overton, Complementarity and nondegeneracy in semidefinite programming. Math. Program. Ser. B 77, 111–128 (1997)
G. Barker, Theory of cones. Linear Algebra Appl. 39, 263–291 (1981)
G.P. Barker, D. Carlson, Cones of diagonally dominant matrices. Pac. J. Math. 57, 15–31 (1975)
G. Barker, R. Hill, R. Haertel, On the completely positive and positive semidefinite preserving cones. Linear Algebra Appl. 56, 221–229 (1984)
J.M. Borwein, H. Wolkowicz, Facial reduction for a non-convex programming problem. J. Austral. Math. Soc. Ser. A 30, 369–380 (1981)
J.M. Borwein, H. Wolkowicz, Regularizing the abstract convex program. J. Math. Anal. Appl. 83, 495–530 (1981)
Y.-L. Cheung, Preprocessing and Reduction for Semidefinite Programming via Facial Reduction: Theory and Practice. PhD thesis, University of Waterloo, 2013
D. Drusvyatskiy, H. Wolkowicz, The many faces of degeneracy in conic optimization. Found. Trends Optim. 3, 77–170 (2017)
D. Drusvyatskiy, G. Pataki, H. Wolkowicz, Coordinate shadows of semidefinite and Euclidean distance matrices. SIAM J. Optim. 25, 1160–1178 (2015)
M. Dur, B. Jargalsaikhan, G. Still, Genericity results in linear conic programming, a tour d’horizon. Math. Oper. Res. 42, 77–94 (2017)
R. Hill, S. Waters, On the cone of positive semidefinite matrices. Linear Algebra Appl. 90, 81–88 (1987)
M. Liu, G. Pataki, Exact duality in semidefinite programming based on elementary reformations. SIAM J. Optim. 25, 1441–1454 (2015)
L. Lovász, Semidefinite programs and combinatorial optimization, in Recent Advances in Algorithms and Combinatorics (Springer, New York, 2003), pp. 137–194
G. Pataki, The geometry of semidefinite programing, in Handbook of Semidefinite Programming: Theory, Algorithms and Applications, ed. by H. Wolkowicz, R. Saigal, L. Vandenberghe (Kluwer Academic Publishers, Boston, 2000), pp. 29–65
J.E. Prussing, The principal minor test for semidefinite matrices. J. Guid. Control Dyn. 9, 121–122 (1986)
M. Ramana, A.J. Goldman, Some geometric results in semi-definite programming. J. Glob. Optim. 7, 33–50 (1995)
H. Schneider, Positive operators and an inertia theorem. Numer. Math. 7, 11–17 (1965)
J.F. Sturm, Error bounds for linear matrix inequalities. SIAM J. Optim. 10, 1228–1248 (2000)
H. Wolkowicz, R. Saigal, L. Vandenberghe (eds.), Handbook of Semidefinite Programming. Theory, Algorithms and Applications (Kluwer Academic Publishers, Boston, 2000)
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 2018 Springer Nature Switzerland AG
About this chapter
Cite this chapter
Alfakih, A.Y. (2018). Positive Semidefinite Matrices. In: Euclidean Distance Matrices and Their Applications in Rigidity Theory. Springer, Cham. https://doi.org/10.1007/978-3-319-97846-8_2
Download citation
DOI: https://doi.org/10.1007/978-3-319-97846-8_2
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-97845-1
Online ISBN: 978-3-319-97846-8
eBook Packages: Mathematics and StatisticsMathematics and Statistics (R0)