Mathematical developments arising from linear programming : proceedings of a joint summer research conference held at Bowdoin College, June 25-July 1, 1988 / [electronic resource]
Jeffrey C. Lagarias and Michael J. Todd, editors.
- Providence, R.I. : American Mathematical Society, c1990.
- 1 online resource (xiv, 341 p.)
- Contemporary mathematics, v. 114 0271-4132 (print); 1098-3627 (online); .
- Contemporary mathematics (American Mathematical Society) ; v. 114. .
"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"--T.p. verso.
Includes bibliographical references.
Some recent results on convex polytopes / Probabilistic analysis of the simplex method / On solving the linear programming problem approximately / Riemannian geometry underlying interior-point methods for linear programming / Steepest descent, linear programming, and Hamiltonian flows / An $O(n^3L)$ potential reduction algorithm for linear programming / I. I. Dikin's convergence result for the affine-scaling algorithm / Phase $1$ search directions for a primal-dual interior point method for linear programming / Some results concerning convergence of the affine scaling algorithm / Dual ellipsoids and degeneracy in the projective algorithm for linear programming / A note on limiting behavior of the projective and the affine rescaling algorithms / On the convergence behavior of trajectories for linear programming / Limiting behavior of the affine scaling continuous trajectories for linear programming problems / Convergence and boundary behavior of the projective scaling trajectories for linear programming / On the complexity of a numerical algorithm for solving generalized convex quadratic programs by following a central path / Canonical problems for quadratic programming and projective methods for their solution / An interior point algorithm for solving smooth convex programs based on Newton's method / A modified Kantorovich inequality for the convergence of Newton's method / An interior-point approach to NP-complete problems. I / Solving matching problems using Karmarkar's algorithm / Efficient faces of polytopes: interior point algorithms, parameterization of algebraic varieties, and multiple objective optimization / Carl W. Lee -- Karl-Heinz Borgwardt -- Nimrod Megiddo -- Narendra Karmarkar -- A. M. Bloch -- Yinyu Ye -- R. J. Vanderbei and J. C. Lagarias -- Irvin J. Lustig -- Earl R. Barnes -- Kurt M. Anstreicher -- Miroslav D. A�si�c, Vera V. Kova�cevi�c-Vuj�ci�c and Mirjana D. Radosavljevi�c-Nikoli�c -- Christoph Witzgall, Paul T. Boggs and Paul D. Domich -- Ilan Adler and Renato D. C. Monteiro -- Renato D. C. Monteiro -- F. Jarre, G. Sonnevend and J. Stoer -- Bahman Kalantari -- Sanjay Mehrotra and Jie Sun -- A. A. Goldstein -- Narendra Karmarkar -- John E. Mitchell and Michael J. Todd -- S. S. Abhyankar, T. L. Morin and T. Trafalis -- http://www.ams.org/conm/114/ http://dx.doi.org/10.1090/conm/114/1097862 http://www.ams.org/conm/114/ http://dx.doi.org/10.1090/conm/114/1097863 http://www.ams.org/conm/114/ http://dx.doi.org/10.1090/conm/114/1097864 http://www.ams.org/conm/114/ http://dx.doi.org/10.1090/conm/114/1097865 http://www.ams.org/conm/114/ http://dx.doi.org/10.1090/conm/114/1097866 http://www.ams.org/conm/114/ http://dx.doi.org/10.1090/conm/114/1097867 http://www.ams.org/conm/114/ http://dx.doi.org/10.1090/conm/114/1097868 http://www.ams.org/conm/114/ http://dx.doi.org/10.1090/conm/114/1097869 http://www.ams.org/conm/114/ http://dx.doi.org/10.1090/conm/114/1097870 http://www.ams.org/conm/114/ http://dx.doi.org/10.1090/conm/114/1097871 http://www.ams.org/conm/114/ http://dx.doi.org/10.1090/conm/114/1097872 http://www.ams.org/conm/114/ http://dx.doi.org/10.1090/conm/114/1097873 http://www.ams.org/conm/114/ http://dx.doi.org/10.1090/conm/114/1097874 http://www.ams.org/conm/114/ http://dx.doi.org/10.1090/conm/114/1097875 http://www.ams.org/conm/114/ http://dx.doi.org/10.1090/conm/114/1097876 http://www.ams.org/conm/114/ http://dx.doi.org/10.1090/conm/114/1097877 http://www.ams.org/conm/114/ http://dx.doi.org/10.1090/conm/114/1097878 http://www.ams.org/conm/114/ http://dx.doi.org/10.1090/conm/114/1097879 http://www.ams.org/conm/114/ http://dx.doi.org/10.1090/conm/114/1097880 http://www.ams.org/conm/114/ http://dx.doi.org/10.1090/conm/114/1097881 http://www.ams.org/conm/114/ http://dx.doi.org/10.1090/conm/114/1097882
Access is restricted to licensed institutions
Electronic reproduction.
Providence, Rhode Island :
American Mathematical Society.
2012
Mode of access : World Wide Web
9780821877029 (online)
Programming (Mathematics)--Congresses.
Linear programming--Congresses.
QA402.5 / .A454 1988
519.7/2
"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"--T.p. verso.
Includes bibliographical references.
Some recent results on convex polytopes / Probabilistic analysis of the simplex method / On solving the linear programming problem approximately / Riemannian geometry underlying interior-point methods for linear programming / Steepest descent, linear programming, and Hamiltonian flows / An $O(n^3L)$ potential reduction algorithm for linear programming / I. I. Dikin's convergence result for the affine-scaling algorithm / Phase $1$ search directions for a primal-dual interior point method for linear programming / Some results concerning convergence of the affine scaling algorithm / Dual ellipsoids and degeneracy in the projective algorithm for linear programming / A note on limiting behavior of the projective and the affine rescaling algorithms / On the convergence behavior of trajectories for linear programming / Limiting behavior of the affine scaling continuous trajectories for linear programming problems / Convergence and boundary behavior of the projective scaling trajectories for linear programming / On the complexity of a numerical algorithm for solving generalized convex quadratic programs by following a central path / Canonical problems for quadratic programming and projective methods for their solution / An interior point algorithm for solving smooth convex programs based on Newton's method / A modified Kantorovich inequality for the convergence of Newton's method / An interior-point approach to NP-complete problems. I / Solving matching problems using Karmarkar's algorithm / Efficient faces of polytopes: interior point algorithms, parameterization of algebraic varieties, and multiple objective optimization / Carl W. Lee -- Karl-Heinz Borgwardt -- Nimrod Megiddo -- Narendra Karmarkar -- A. M. Bloch -- Yinyu Ye -- R. J. Vanderbei and J. C. Lagarias -- Irvin J. Lustig -- Earl R. Barnes -- Kurt M. Anstreicher -- Miroslav D. A�si�c, Vera V. Kova�cevi�c-Vuj�ci�c and Mirjana D. Radosavljevi�c-Nikoli�c -- Christoph Witzgall, Paul T. Boggs and Paul D. Domich -- Ilan Adler and Renato D. C. Monteiro -- Renato D. C. Monteiro -- F. Jarre, G. Sonnevend and J. Stoer -- Bahman Kalantari -- Sanjay Mehrotra and Jie Sun -- A. A. Goldstein -- Narendra Karmarkar -- John E. Mitchell and Michael J. Todd -- S. S. Abhyankar, T. L. Morin and T. Trafalis -- http://www.ams.org/conm/114/ http://dx.doi.org/10.1090/conm/114/1097862 http://www.ams.org/conm/114/ http://dx.doi.org/10.1090/conm/114/1097863 http://www.ams.org/conm/114/ http://dx.doi.org/10.1090/conm/114/1097864 http://www.ams.org/conm/114/ http://dx.doi.org/10.1090/conm/114/1097865 http://www.ams.org/conm/114/ http://dx.doi.org/10.1090/conm/114/1097866 http://www.ams.org/conm/114/ http://dx.doi.org/10.1090/conm/114/1097867 http://www.ams.org/conm/114/ http://dx.doi.org/10.1090/conm/114/1097868 http://www.ams.org/conm/114/ http://dx.doi.org/10.1090/conm/114/1097869 http://www.ams.org/conm/114/ http://dx.doi.org/10.1090/conm/114/1097870 http://www.ams.org/conm/114/ http://dx.doi.org/10.1090/conm/114/1097871 http://www.ams.org/conm/114/ http://dx.doi.org/10.1090/conm/114/1097872 http://www.ams.org/conm/114/ http://dx.doi.org/10.1090/conm/114/1097873 http://www.ams.org/conm/114/ http://dx.doi.org/10.1090/conm/114/1097874 http://www.ams.org/conm/114/ http://dx.doi.org/10.1090/conm/114/1097875 http://www.ams.org/conm/114/ http://dx.doi.org/10.1090/conm/114/1097876 http://www.ams.org/conm/114/ http://dx.doi.org/10.1090/conm/114/1097877 http://www.ams.org/conm/114/ http://dx.doi.org/10.1090/conm/114/1097878 http://www.ams.org/conm/114/ http://dx.doi.org/10.1090/conm/114/1097879 http://www.ams.org/conm/114/ http://dx.doi.org/10.1090/conm/114/1097880 http://www.ams.org/conm/114/ http://dx.doi.org/10.1090/conm/114/1097881 http://www.ams.org/conm/114/ http://dx.doi.org/10.1090/conm/114/1097882
Access is restricted to licensed institutions
Electronic reproduction.
Providence, Rhode Island :
American Mathematical Society.
2012
Mode of access : World Wide Web
9780821877029 (online)
Programming (Mathematics)--Congresses.
Linear programming--Congresses.
QA402.5 / .A454 1988
519.7/2