Monday, May 10

Interior Point Methods for Linear Programming I

3:30 PM-5:30 PM
Room: Georgia 1 & 2
Chair: Trond Steihaug, University of Bergen, Norway

3:30-3:45 Interior-Point Solver for Structured Linear Programs
Jacek Gondzio, The University of Edinburgh, United Kingdom; and Robert Sarkissian, University of Cambridge, United Kingdom
3:50-4:05 Computational Experience with Khachiyan and Todd's Algorithm for Approximating the Maximal Inscribed Ellipsoid in a Polytope
Liyan Gao and Yin Zhang, Rice University
4:10-4:25 Using Duality Descent in Interior-Point Methods for Linear Programming
Stephen E. Wright, Miami University
4:30-4:45 Indicators vs. Weights in Finite Termination Procedures in Interior-Point Methods for Linear Programming
Pamela J. Williams, Sandia National Laboratories, Livermore; Amr S. El-Bakry, Exxon Production Research Co.; and Richard A. Tapia, Rice University
4:50-5:05 A Class of Preconditioner for Interior Point Methods
Trond Steihaug and Baryamureeba Venansius, University of Bergen, Norway; and Yin Zhang, Rice University
5:10-5:25 A Study of the Computational Role of (Central-Path) Proximity Measures in Locating Analytic Centers
María González-Lima, Universidad Simón Bolívar, Caracas, Venezuela; Amr El-Bakry and Richard Tapia, Rice University

OP99 Home


Program Updates

Speaker Index




MMD, 2/2/99