Abstract
The center of a bounded full-dimensional polytope P = {x: Ax ≥ b} is the unique point ω that maximizes the strictly concave potential function \(F(x) = \sum\nolimits_{i = 1}^m {\ln (a_i^T} x - {b_i})\) over the interior of P. Let x 0 be a point in the interior of P. We show that the first two terms in the power series of F(x) at x 0 serve as a good approximation to F(x) in a suitable ellipsoid around x 0 and that minimizing the first-order (linear) term in the power series over this ellipsoid increases F(x) by a fixed additive constant as long as x 0 is not too close to the center ω.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
D. A. Bayer, and J. C. Lagarias, The non-linear geometry of linear programming I. Affine and projective scaling trajectories, Trans. Amer. Math. Soc. (to appear).
N. Karmarkar, A new polynomial time algorithm for linear programming, Combinatorica 4(1984), 373–395.
J. Renegar, A polynomial-time algorithm, based on Newton’s method, for linear programming, MSRI 07118–86, Mathematical Sciences Research Institute, Berkeley, Calif., Math. Programming 1988, Volume 40, pages 59–94
Gy. Sonnevand, An analytical center for polyhedrons and new classes of global algorithms for linear (smooth, convex) programming, Preprint, Department of Numerical Analysis, Institute of Mathematics, Eotvos University, Budapest.
Gy. Sonnevand, A new method for solving a set of linear (convex) inequalities and its application for identification and optimization, Preprint, Department of Numerical Analysis, Institute of Mathematics, Eotvos University Budapest.
P. M. Vaidya, An algorithm for linear programming which requires O(((m + n)n 2 + (m + n) 1.5 n)L) arithmetic operations, Proc. ACM Annual Symposium or Theory of Computing (1987), 29–38.
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1989 Springer-Verlag New York Inc.
About this chapter
Cite this chapter
Vaidya, P.M. (1989). A Locally Weil-Behaved Potential Function and a Simple Newton-Type Method for Finding the Center of a Polytope. In: Megiddo, N. (eds) Progress in Mathematical Programming. Springer, New York, NY. https://doi.org/10.1007/978-1-4613-9617-8_5
Download citation
DOI: https://doi.org/10.1007/978-1-4613-9617-8_5
Publisher Name: Springer, New York, NY
Print ISBN: 978-1-4613-9619-2
Online ISBN: 978-1-4613-9617-8
eBook Packages: Springer Book Archive