Monday, May 10
CP5
Semidefinite Programming I
3:30 PM-5:30 PM
Room: Atlanta 4
Chair: Ariela
Sofer, George Mason University
- 3:30-3:45 Optimality Conditions for Nonconvex Semidefinite Programming
- Anders Forsgren, Royal Institute of Technology (KTH), Stockholm, Sweden
- 3:50-4:05 Large-Scale Semidefinite Programming with Bundle Methods
- Madhu Nayakkankuppam, Courant Institute of Mathematical
Sciences, New York University; Francois Oustry, INRIA, Saint Martin,
France; and Michael Overton, Courant Institute of Mathematical
Sciences, New York University
- 4:10-4:25 Estimation for Array Processing Using Nonlinear
Semidefinite Programming
- Ariela Sofer and Eric E. Smith, George Mason University
- 4:30-4:45 Solving Specially Structured Semidefinite
Programming Problems
- Masakazu Muramatsu, Sophia University, Tokyo, Japan
- 4:50-5:05 Penalty/Barrier Multiplier Algorithm for
Semidefinite Programming
- Leonid Mosheyev, Technion-Israel Institute of Technology, Haifa,
Israel; and Michael Zibulevsky, University of New Mexico
- 5:10-5:25 Solving
Second Order Cone Programs in an Efficient and Numerically Stable Way
- Donald Goldfarb, Columbia University; and Katya
Scheinberg, IBM T. J. Watson Research Center
MMD, 3/12/99