Abstract
In this chapter we analyze the complexity of special variants of the logarithmic barrier method for some classes of problems. We will deal with so-called long-, medium-and short-step methods. First, we will give a general framework for the logarithmic barrier method. Then we look at special cases: linear, convex quadratic and smooth convex programming problems respectively.
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
© 1994 Springer Science+Business Media Dordrecht
About this chapter
Cite this chapter
den Hertog, D. (1994). The logarithmic barrier 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_2
Download citation
DOI: https://doi.org/10.1007/978-94-011-1134-8_2
Publisher Name: Springer, Dordrecht
Print ISBN: 978-94-010-4496-7
Online ISBN: 978-94-011-1134-8
eBook Packages: Springer Book Archive