Mathematical developments arising from linear programming : proceedings of a joint summer research conference held at Bowdoin College, June 25July 1, 1988
Material type: Computer fileSeries: Contemporary mathematics ; v. 114Publication details: Providence, R.I. : American Mathematical Society, c1990Description: 1 online resource (xiv, 341 p.)ISBN: 9780821877029 (online)Subject(s): Linear programming | Programming (Mathematics)Online resources: Click here to access onlineItem type | Current library | Call number | URL | Status | Date due | Barcode | Item holds |
---|---|---|---|---|---|---|---|
electronic book | ICTS | Link to resource | Accessible Online | EBK21116 |
The AMSIMSSIAM Joint Summer Research Conference on Mathematical Developments Arising from Linear Programming was held at Bowdoin College, Brunswick, Maine, on June 25July 1, 1988T.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 interiorpoint methods for linear programming ; Steepest descent, linear programming, and Hamiltonian flows ; An (n^3L) potential reduction algorithm for linear programming ; I. I. Dikin's convergence result for the affinescaling algorithm ; Phase search directions for a primaldual 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 interiorpoint approach to NPcomplete 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 ; KarlHeinz 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 Asic Vera V KovacevicVujcic and Mirjana D RadosavljevicNikolic ; 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
There are no comments on this title.