Skip to main content

A Locally Weil-Behaved Potential Function and a Simple Newton-Type Method for Finding the Center of a Polytope

  • Chapter
Progress in Mathematical Programming

Abstract

The center of a bounded full-dimensional polytope P = {x: Axb} 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 ω.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 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).

    Google Scholar 

  2. N. Karmarkar, A new polynomial time algorithm for linear programming, Combinatorica 4(1984), 373–395.

    Article  MATH  MathSciNet  Google Scholar 

  3. 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

    Google Scholar 

  4. 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.

    Google Scholar 

  5. 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.

    Google Scholar 

  6. 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.

    Google Scholar 

Download references

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints 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

Publish with us

Policies and ethics