Remote Access Transactions of the American Mathematical Society
Green Open Access

Transactions of the American Mathematical Society

ISSN 1088-6850(online) ISSN 0002-9947(print)

 
 

 

The nonlinear geometry of linear programming. II. Legendre transform coordinates and central trajectories


Authors: D. A. Bayer and J. C. Lagarias
Journal: Trans. Amer. Math. Soc. 314 (1989), 527-581
MSC: Primary 90C05; Secondary 34A99, 52A40
DOI: https://doi.org/10.1090/S0002-9947-1989-1005526-8
MathSciNet review: 1005526
Full-text PDF Free Access

Abstract | References | Similar Articles | Additional Information

Abstract: Karmarkar's projective scaling algorithm for solving linear programming problems associates to each objective function a vector field defined in the interior of the polytope of feasible solutions of the problem. This paper studies the set of trajectories obtained by integrating this vector field, called $ P$-trajectories, as well as a related set of trajectories, called $ A$-trajectories. The $ A$-trajectories arise from another linear programming algorithm, the affine scaling algorithm. The affine and projective scaling vector fields are each defined for linear programs of a special form, called standard form and canonical form, respectively.

These trajectories are studied using a nonlinear change of variables called Legendre transform coordinates, which is a projection of the gradient of a logarithmic barrier function. The Legendre transform coordinate mapping is given by rational functions, and its inverse mapping is algebraic. It depends only on the constraints of the linear program, and is a one-to-one mapping for canonical form linear programs. When the polytope of feasible solutions is bounded, there is a unique point mapping to zero, called the center.

The $ A$-trajectories of standard form linear programs are linearized by the Legendre transform coordinate mapping. When the polytope of feasible solutions is bounded, they are the complete set of geodesics of a Riemannian geometry isometric to Euclidean geometry. Each $ A$-trajectory is part of a real algebraic curve.

Each $ P$-trajectory for a canonical form linear program lies in a plane in Legendre transform coordinates. The $ P$-trajectory through $ {\mathbf{0}}$ in Legendre transform coordinates, called the central $ P$-trajectory, is part of a straight line, and is contained in the $ A$-trajectory through $ {\mathbf{0}}$, called the central $ A$-trajectory. Each $ P$-trajectory is part of a real algebraic curve.

The central $ A$-trajectory is the locus of centers of a family of linear programs obtained by adding an extra equality constraint of the form $ \langle {\mathbf{c}},{\mathbf{x}}\rangle = \mu $. It is also the set of minima of a parametrized family of logarithmic barrier functions. Power-series expansions are derived for the central $ A$-trajectory, which is also the central $ P$-trajectory. These power-series have a simple recursive form and are useful in developing "higher-order" analogues of Karmarkar's algorithm.

$ A$-trajectories are defined for a general linear program. Using this definition, it is shown that the limit point $ {{\mathbf{x}}_\infty }$ of a central $ A$-trajectory on the boundary of the feasible solution polytope $ P$ is the center of the unique face of $ P$ containing $ {{\mathbf{x}}_\infty }$ in its relative interior.

The central trajectory of a combined primal-dual linear program has a simple set of polynomial relations determining it as an algebraic curve. These relations are a relaxed form of the complementary slackness conditions. This central trajectory algebraically projects onto the central trajectories of both the primal and dual linear programs, and this gives an algebraic correspondence between points on the positive parts of the central trajectories of the primal and dual linear programs.

Two Lagrangian dynamical systems with simple Lagrangians are shown to have $ A$-trajectories as $ {\mathbf{\dot q}}$-trajectories. The Hamiltonian dynamical systems associated to these Lagrangian systems are completely integrable.


References [Enhancements On Off] (What's this?)

  • [AKRV] I. Adler, N. Karmarkar, M. Resende, and G. Veiga, An implementation of Karmarkar's algorithm for linear programming, preprint, Univ. of California, Berkeley, May 1986.
  • [A] K. Anstreicher, A monotonic projective algorithm for fractional linear programming, Algorithmica 1 (1986), 483-498. MR 880734 (88f:90162)
  • [Ar] V. I. Arnold, Mathematical methods of classical mechanics, Springer-Verlag, New York, 1978. MR 0690288 (57:14033b)
  • [B] E. R. Barnes, A variation on Karmarkar's algorithm for solving linear programming problems, Math. Programming 36 (1986), 174-182. MR 866987 (88h:90120)
  • [BL1] D. A. Bayer and J. C. Lagarias, The nonlinear geometry of linear programming. I. Affine and projective scaling trajectories, Trans. Amer. Math. Soc. (to appear). MR 1005525 (90h:90098a)
  • [BL] -, Karmarkar's linear programming algorithm and Newton's method, Math. Programming (to appear).
  • [BM] S. Bochner and W. T. Martin, Several complex variables, Princeton Univ. Press, Princeton, N. J., 1948. MR 0027863 (10:366a)
  • [BT] B. Bernstein and R. A. Toupin, Some properties of the Hessian of a strictly convex function, J. Reine Angew. Math. 210 (1962), 65-72. MR 0145024 (26:2561)
  • [CH] R. Courant and D. Hilbert, Methods of mathematical physics, Vols. I, II, Wiley, New York, 1962.
  • [D1] I. I. Dikin, Iterative solution of problems of linear and quadratic programming, Dokl. Akad. Nauk SSSR 174 (1967), 747-748. (English transl., Soviet Math. Dokl. 8 (1967), 674-675.) MR 0221850 (36:4902)
  • [D2] -, About the convergence of an iterative process, Controllable Systems IM IK SO AN SSSR 1974, No. 12, 54-60. (Russian)
  • [F] W. Fenchel, On conjugate convex functions, Canad. J. Math. 1 (1949), 73-77. MR 0028365 (10:435b)
  • [FM] A. V. Fiacco and G. W. McCormick, Nonlinear programming: Sequential unconstrained minimization techniques, Wiley, New York, 1968. MR 0243831 (39:5152)
  • [Fl] W. H. Fleming, Functions of several variables, Addison-Wesley, Reading, Mass., 1965. MR 0174675 (30:4875)
  • [GZ] C. B. Garcia and W. I. Zangwill, Pathways to solutions, fixed points and equilibria, Prentice-Hall, Englewood Cliffs, N. J., 1981.
  • [Go] C. Gonzaga, An algorithm for solving linear programming problems in $ O({n^3}L)$ operations, Progress in Mathematical Programming, Interior-Point and Related Methods (N. Megiddo, Ed.), Springer-Verlag, New York, 1989, pp. 1-28. MR 982713 (90e:90078)
  • [GMN] J. Guckenheimer, J. Moser, and S. E. Newhouse, Dynamical systems, C.I.M.E. Lectures, Birkhäuser, Boston, Mass., 1980.
  • [H] D. Hilbert, Grundlagen der Geometrie, 7th ed., Leipzig, 1930. (English transl., Foundations of geometry.)
  • [HK] K. Hoffman and R. Kunze, Linear algebra, Prentice-Hall, Englewood Cliffs, N. J., 1961. MR 0125849 (23:A3146)
  • [Ho] J. Hooker, Karmarkar's linear programming algorithm, Interfaces 16 (1986), 75-90.
  • [K] N. Karmarkar, A new polynomial time algorithm for linear programming, Combinatorica 4 (1984), 373-395. MR 779900 (86i:90072)
  • [KLSW] N. Karmarkar, J. C. Lagarias, L. Slutsman and P. Wang, Power-series variants of Karmarkar-type algorithms, A.T.&T. Tech. J. 68 (to appear). MR 1021069 (91g:90099)
  • [KV] S. Kapoor and P. M. Vaidya, First algorithms for convex quadratic programming and multicommodity flows, Proc. 18th ACM Sympos. on Theory of Computing, 1986, pp. 147-159.
  • [KMY] M. Kojima, S. Mizuno, and A. Yoshise, A primal-dual interior point algorithm for linear programming, Progress in Mathematical Programming, Interior-Point and Related Methods (N. Megiddo, Ed.), Springer-Varlag, New York, 1989, pp. 29-48. MR 982714 (90k:90093)
  • [L3] J. C. Lagarias, The non-linear geometry of linear programming. III, Projective Legendre transform coordinates and Hilbert geometry, Trans. Amer. Math. Soc. (to appear). MR 1058199 (91g:90100)
  • [Ln] C. Lanczos, The variational principles of mechanics, Univ. of Toronto Press, Toronto, 1949. MR 0034139 (11:549a)
  • [M] N. Megiddo, On the complexity of linear programming, Advances in Economic Theory (T. Bewley, Ed.), Cambridge Univ. Press, 1986. MR 1117042
  • [M2] -, Pathways to the optimal set in linear programming, Progress in Mathematical Programming, Interior-Point and Related Methods (N. Megiddo, Ed.), Springer-Verlag, New York, 1989, pp. 131-158. MR 982720 (90c:90147)
  • [MS] N. Megiddo and M. Shub, Boundary behavior of interior point algorithms in linear programming, preprint, IBM Research Report RJ 5319, 1986. MR 984561 (90c:90148)
  • [Mo] J. Moser, Various aspects of integrable Hamiltonian systems, pp. 233-290 in [GMN]. MR 589592 (83a:58042a)
  • [N] J. L. Nazareth, Homotopy techniques in linear programming, Algorithmica 1 (1986), 528-535. MR 880737 (89b:90129)
  • [Os] M. R. Osborne, Dual barrier functions with superfast rates of convergence for the linear programming problem, J. Austral. Math. Soc. (Ser. B) 29 (1987), 39-58. MR 889576 (88f:90097)
  • [Re] J. Renegar, A polynomial-time algorithm, based on Newton's method, for linear programming, Math. Programming 40 (1988), 59-94. MR 923697 (89b:90130)
  • [R1] R. T. Rockafellar, Conjugates and Legendre transforms of convex functions, Canad. J. Math. 19 (1967), 200-205. MR 0213496 (35:4358)
  • [R2] -, Convex analysis, Princeton Univ. Press, Princeton, N. J., 1970.
  • [So1] Gy. Sonnevend, An "analytical centre" for polyhedrons and new classes of global algorithms for linear (smooth, convex) programming, Proc. 12th IFIP Conf. System Modelling, Budapest, 1985, Lecture Notes in Computer Science, 1986. MR 903521 (88g:90133)
  • [So2] -, A new method for solving a set of linear (convex) inequalities and its application for identification and optimization, Proc. Sympos. on Dynamic Modelling, IFAC-IFORS, Budapest, June 1986.
  • [SW] J. Stoer and C. Witzgall, Convexity and optimization in finite dimensions. I, Springer-Verlag, New York, 1970. MR 0286498 (44:3707)
  • [TB] M. Todd and B. Burrell, An extension of Karmarkar's algorithm for linear programming using dual variables, Algorithmica 1 (1986), 409-424. MR 880731 (88c:90089)
  • [V] P. Vaidya, An algorithm for linear programming which requires $ O(((m + n){n^2} + {(m + n)^{1.5}}n)L)$ arithmetic operations, Proc. 19th ACM Sympos. on Theory of Computing, 1987, pp. 29-38.
  • [VMF] R. J. Vanderbei, M. J. Meketon and B. A. Freedman, A modification of Karmarkar's linear programming algorithm, Algorithmica 1 (1986), 395-407. MR 880730 (88e:90052)

Similar Articles

Retrieve articles in Transactions of the American Mathematical Society with MSC: 90C05, 34A99, 52A40

Retrieve articles in all journals with MSC: 90C05, 34A99, 52A40


Additional Information

DOI: https://doi.org/10.1090/S0002-9947-1989-1005526-8
Article copyright: © Copyright 1989 American Mathematical Society

American Mathematical Society