MS11 Primal-Dual Interior Point Methods for Optimization Problems with Semidefinite, Quadratic and Linear Constraints

MS11
Primal-Dual Interior Point Methods for Optimization Problems with Semidefinite, Quadratic and Linear Constraints - Part II of II

10:45 AM-12:45 PM
Room: Capitol Center

For description, see Part I, MS2.

Organizers: Farid Alizadeh
Rutgers University
Renato Monteiro
Georgia Institute of Technology

10:45-11:10 Using LOQO to Solve Second-Order Cone Programming Problems: Robert Vanderbei, Princeton University
11:10-11:40 Quadratic Optimization and Semidefinite Programming: Shuzhong Zhang, Erasmus University, Rotterdam, The Netherlands
11:45-12:10 Computational Aspects of Successive Convex Relaxation Methods for General Nonconvex Quadratic Programs: Akiko Takeda, Mituhiro Fukuda, Yang Dai, and Masakazu Kojima, Tokyo Institute of Technology, Japan
12:15-12:40 A General Framework for Establishing Polynomial Convergence of Long-Step Methods for SDP: Sam Burer, Georgia Institute of Technology; and Renato Monteiro, Organizer

MMD, 12/21/98