Tuesday, May 21
12:45-2:15 PM
Saanich 1

MS21
Condition Numbers and Problem Complexity in Convex Programming (Part II of II)

For description, see Part I, MS16.

Organizer: Robert M. Freund,
Massachusetts Institute of Technology

The Geometry of Condition Numbers
James Renegar, Cornell University
Characterizations of the Condition Number of a Convex Program, and the Complexity of the Ellipsoid Algorithm and Dantzig's von Neumann Algorithm
Robert M. Freund, Organizer
On the use of Condition Measures and Knowledge in the Complexity Theory of Linear Programming
Sharon Filipowski, Iowa State University

Registration | Hotel Information | Transportation | Speaker Index | Program Overview


MEM, 3/18/96