Abstract
Semidefinite programming refers to optimization problems that can be expressed in the form minimize C•X subject to A i •X = b i for all i=1, . . . , m(1.1.1) X≻0 where the variable is X∈Sn, the space of real symmetric nxn matrices.
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
Wolkowicz, H., Saigal, R., Vandenberghe, L. (2000). Introduction. 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_1
Download citation
DOI: https://doi.org/10.1007/978-1-4615-4381-7_1
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4613-6970-7
Online ISBN: 978-1-4615-4381-7
eBook Packages: Springer Book Archive