Abstract
In the matrix completion problem we are given a partial symmetric real matrix A with certain elements specified or fixed and the rest are unspecified or free; and, we are asked whether A can be completed to satisfy a given property (P) by assigning certain values to its free elements. In this chapter, we are interested in the following two completion problems: the positive semidefinite matrix completion problem corresponding to (P) being the positive semi-defmiteness (PSD) property; and the Euclidean distance matrix completion problem corresponding to (P) being the Euclidean distance (ED) property. (We concentrate on the latter problem. A survey of the former is given in [373]. The relationships between the two is discussed in e.g. [465, 464, 380].)
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
Preview
Unable to display preview. Download preview PDF.
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2000 Springer Science+Business Media New York
About this chapter
Cite this chapter
Alfakih, A., Wolkowicz, H. (2000). Matrix Completion Problems. In: Wolkowicz, H., Saigal, R., Vandenberghe, L. (eds) Handbook of Semidefinite Programming. International Series in Operations Research & Management Science, vol 27. Springer, Boston, MA. https://doi.org/10.1007/978-1-4615-4381-7_18
Download citation
DOI: https://doi.org/10.1007/978-1-4615-4381-7_18
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4613-6970-7
Online ISBN: 978-1-4615-4381-7
eBook Packages: Springer Book Archive