Abstract
One of the major implications of the work by Nesterov and Nemirovskii [193] is the applicability of efficient interior point methods to problems other than those being defined on the space of real numbers. Later, Nesterov and Todd [194] developed efficient primal-dual techniques for problems defined on certain convex cones.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 1997 Springer Science+Business Media Dordrecht
About this chapter
Cite this chapter
Jansen, B. (1997). Semidefinite Programming. In: Interior Point Techniques in Optimization. Applied Optimization, vol 6. Springer, Boston, MA. https://doi.org/10.1007/978-1-4757-5561-9_10
Download citation
DOI: https://doi.org/10.1007/978-1-4757-5561-9_10
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4419-4772-7
Online ISBN: 978-1-4757-5561-9
eBook Packages: Springer Book Archive