Mathematical developments arising from linear programming proceedings of a joint summer research conference held at Bowdoin College, June 25-July 1, 1988 Jeffrey C. Lagarias and Michael J. Todd, editors

Format:

Book

Conference/Event

Contributor:

Lagarias, Jeffrey C., 1949-

Todd, Michael J., 1947-

Conference Name:

AMS-IMS-SIAM Joint Summer Research Conference on Mathematical Developments Arising from Linear Programming (1988 : Bowdoin College) http://viaf.org/viaf/132346037

Series:

Contemporary mathematics (American Mathematical Society) v. 114

Contemporary mathematics 0271-4132 114

Language:

English

Subjects (All):

Programming (Mathematics)--Congresses.

Programming (Mathematics).

Linear programming--Congresses.

Linear programming.

Genre:

Conference papers and proceedings

Physical Description:

1 online resource

Place of Publication:

Providence, R.I. American Mathematical Society [1990]

Contents:

Some recent results on convex polytopes Carl W. Lee

http://www.ams.org/conm/114/ http://dx.doi.org/10.1090/conm/114/1097862 Probabilistic analysis of the simplex method Karl-Heinz Borgwardt

http://www.ams.org/conm/114/ http://dx.doi.org/10.1090/conm/114/1097863 On solving the linear programming problem approximately Nimrod Megiddo

http://www.ams.org/conm/114/ http://dx.doi.org/10.1090/conm/114/1097864 Riemannian geometry underlying interior-point methods for linear programming Narendra Karmarkar

http://www.ams.org/conm/114/ http://dx.doi.org/10.1090/conm/114/1097865 Steepest descent, linear programming, and Hamiltonian flows A. M. Bloch

http://www.ams.org/conm/114/ http://dx.doi.org/10.1090/conm/114/1097866 An $O(n3̂L)$ potential reduction algorithm for linear programming Yinyu Ye

http://www.ams.org/conm/114/ http://dx.doi.org/10.1090/conm/114/1097867 I. I. Dikin's convergence result for the affine-scaling algorithm R. J. Vanderbei and J. C. Lagarias

http://www.ams.org/conm/114/ http://dx.doi.org/10.1090/conm/114/1097868 Phase $1$ search directions for a primal-dual interior point method for linear programming Irvin J. Lustig

http://www.ams.org/conm/114/ http://dx.doi.org/10.1090/conm/114/1097869 Some results concerning convergence of the affine scaling algorithm Earl R. Barnes

http://www.ams.org/conm/114/ http://dx.doi.org/10.1090/conm/114/1097870 Dual ellipsoids and degeneracy in the projective algorithm for linear programming Kurt M. Anstreicher

http://www.ams.org/conm/114/ http://dx.doi.org/10.1090/conm/114/1097871 A note on limiting behavior of the projective and the affine rescaling algorithms Miroslav D. Ašić, Vera V. Kovačević-Vujčić and Mirjana D. Radosavljević-Nikolić

http://www.ams.org/conm/114/ http://dx.doi.org/10.1090/conm/114/1097872 On the convergence behavior of trajectories for linear programming Christoph Witzgall, Paul T. Boggs and Paul D. Domich

http://www.ams.org/conm/114/ http://dx.doi.org/10.1090/conm/114/1097873 Limiting behavior of the affine scaling continuous trajectories for linear programming problems Ilan Adler and Renato D. C. Monteiro

http://www.ams.org/conm/114/ http://dx.doi.org/10.1090/conm/114/1097874 Convergence and boundary behavior of the projective scaling trajectories for linear programming Renato D. C. Monteiro

http://www.ams.org/conm/114/ http://dx.doi.org/10.1090/conm/114/1097875 On the complexity of a numerical algorithm for solving generalized convex quadratic programs by following a central path F. Jarre, G. Sonnevend and J. Stoer

http://www.ams.org/conm/114/ http://dx.doi.org/10.1090/conm/114/1097876 Canonical problems for quadratic programming and projective methods for their solution Bahman Kalantari

http://www.ams.org/conm/114/ http://dx.doi.org/10.1090/conm/114/1097877 An interior point algorithm for solving smooth convex programs based on Newton's method Sanjay Mehrotra and Jie Sun

http://www.ams.org/conm/114/ http://dx.doi.org/10.1090/conm/114/1097878 A modified Kantorovich inequality for the convergence of Newton's method A. A. Goldstein

http://www.ams.org/conm/114/ http://dx.doi.org/10.1090/conm/114/1097879 An interior-point approach to NP-complete problems. I Narendra Karmarkar

http://www.ams.org/conm/114/ http://dx.doi.org/10.1090/conm/114/1097880 Solving matching problems using Karmarkar's algorithm John E. Mitchell and Michael J. Todd

http://www.ams.org/conm/114/ http://dx.doi.org/10.1090/conm/114/1097881 Efficient faces of polytopes: interior point algorithms, parameterization of algebraic varieties, and multiple objective optimization S. S. Abhyankar, T. L. Morin and T. Trafalis

http://www.ams.org/conm/114/ http://dx.doi.org/10.1090/conm/114/1097882

Notes:

"The AMS-IMS-SIAM Joint Summer Research Conference on Mathematical Developments Arising from Linear Programming was held at Bowdoin College, Brunswick, Maine, on June 25-July 1, 1988"--Title page verso

Includes bibliographical references

ISBN:

9780821854471

082185447X

9780821877029

082187702X

OCLC:

774694206

Access Restriction:

Restricted for use by site license