Monday, May 10
CP13
Semidefinite Programming/Bounds
5:30 PM-7:30 PM
Room: Atlanta 4
Chair: Mituhiro Fukuda, Tokyo Institute of Technology, Japan
- 5:30-5:45 Scaling Dualities: Theoretical and Algorithmic
Applications of New Dualities in Mathematical Programming
- Bahman Kalantari, Rutgers University
- 5:50-6:05 An Algorithm for Large Scale Box Constrained Optimization
- Francisco
Facchinei, Stefano Lucidi, and Laura Palagi,
Università di Roma "La Sapienza", Rome, Italy
- 6:10-6:25 Computational Prospects of Bilinear Matrix
Inequality Problems
- Mituhiro Fukuda and Masakazu Kojima, Tokyo Institute of
Technology, Japan
- 6:30-6:45 On A Characterization of SDP Problems Solvable via
An Explicit Solution Formula
- Atsumi Ohara, Osaka University, Japan
- 6:50-7:05 Nonmonotone Spectral Projected Gradient Methods on
Convex Sets
- Ernesto G. Birgin and José Mario Martínez,
UNICAMP, Campinas, Brazil; and Marcos Raydan, Universidad Central de
Venezuela, Caracas, Venezuela
- 7:10-7:25
Infinite- and Multi-Dimensional Unconstrained Optimization
- Victor K. Tolstykh, Donetsk State University, Donetsk, Ukraine
LMH, 12/9/98, MMD, 2/11/99