Abstract
Since Karmarkar proposed the first interior-point algorithm for linear programming, many variations have been discovered. In particular, they can be extended to semidefinite programming We will study some of them in this chapter.
Small rooms or dwelling discipline the mind, large one weaken it.
Leonardo Da Vinci
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer Science+Business Media Dordrecht
About this chapter
Cite this chapter
Du, DZ., Pardalos, P.M., Wu, W. (2001). Interior Point Methods. In: Du, DZ., Pardalos, P.M., Wu, W. (eds) Mathematical Theory of Optimization. Nonconvex Optimization and Its Applications, vol 56. Springer, Boston, MA. https://doi.org/10.1007/978-1-4757-5795-8_14
Download citation
DOI: https://doi.org/10.1007/978-1-4757-5795-8_14
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4419-5202-8
Online ISBN: 978-1-4757-5795-8
eBook Packages: Springer Book Archive