Abstract
In this chapter we analyze the complexity of special variants of the center method for some classes of convex problems. We will deal with so-called long-, medium-and short-step methods. First, we will give a general framework for the center method. Then we will give the complexity analysis for linear programming and a class of convex programming problems, respectively. The self-concordance property introduced by Nesterov and Nemirovsky [119] plays again a key role in the analysis.
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
Rights and permissions
Copyright information
© 1994 Springer Science+Business Media Dordrecht
About this chapter
Cite this chapter
den Hertog, D. (1994). The center method. In: Interior Point Approach to Linear, Quadratic and Convex Programming. Mathematics and Its Applications, vol 277. Springer, Dordrecht. https://doi.org/10.1007/978-94-011-1134-8_3
Download citation
DOI: https://doi.org/10.1007/978-94-011-1134-8_3
Publisher Name: Springer, Dordrecht
Print ISBN: 978-94-010-4496-7
Online ISBN: 978-94-011-1134-8
eBook Packages: Springer Book Archive