Presented under the auspices of the Special Year on Large Scale Discrete Optimization.
Thursday November 2, 2000
8:15-9:00 Breakfast and Registration Introduction, and interior-point methods I 9:00-9:15 Welcome and Greeting: Mel Janowitz, DIMACS Associate DIrector 9:15-9:30 The 7th DIMACS Challenge Gabor Pataki, UNC Chapel Hill 9:30-10:05 Challenges, David Johnson, AT&T Research 10:05-10:40 Solving semidefinite-quadratic-linear programs using Sedumi, Jos Sturm, Maastricht University 10:40-10:55 Coffee break Interior-point methods II 10:55-11:30 A primal-dual interior point method for conic quadratic optimization, Erling Andersen, Helsinki School of Economics, Kees Roos, TU Delft, Tamas Terlaky, McMaster University 11:30-12:05 Using LOQO to solve problems with Semidefinite and Related Constraints, Bob Vanderbei, Hande Yurttan Benson, Princeton University 12:05-1:30 Lunch Large scale methods I 1:30-2:05 Solving Graph Problems with DSDP, Chris Choi, Yinyu Ye, University of Iowa 2:05-2:40 A Nonlinear Programming Algorithm for Solving Semidefinite Programs via Low-Rank Factorization, Sam Burer, Renato Monteiro, Georgia Institute of Technology 2:40-3:15 Solving Semidefinite Programs via Nonlinear Programming, Renato Monteiro, Sam Burer, Georgia Institute of Technology Yin Zhang, Rice University 3:15-3:30 Coffee break Interior-point methods III 3:30-4:05 Solving semidefinite-quadratic-linear programs using SDPT3, Reha Tutuncu, Carnegie Mellon University, Mike Todd, Cornell University, Kim Chuan Toh, National University of Singapore 4:05-4:40 Implementing Primal-dual Interior-point Methods for SDP via Matrix Completion, Mituhiro Fukuda, Tokyo Institute of Technology Katsuki Fujisawa, Kyoto University Masakazu Kojima, Tokyo Institute of Technology Kazuo Murota, Kyoto University Kazuhide Nakata, The University of Tokyo 4:40-4:50 Coffee break 4:50-5:25 Implementing the dual HKM direction for SDP, Kees Roos, TU Delft, Jiming Peng, Tamas Terlaky, McMaster University 5:25-6:00 The Implementation of CSDP 3.0 Brian Borchers, New Mexico Tech BANQUETFriday November 3, 2000
Large scale methods II 8:15-9:00 Breakfast and Registration 9:00-9:35 The Numerical Evaluation of SBMethod, C. Helmberg, Konrad-Zuse-Zentrum Berlin 9:35-10:10 DSDP 3.0: A General Dual Scaling Algorithm for Positive Semidefinite Programs, Steve Benson, Argonne National Laboratory Yinyu Ye, University of Iowa 10:10-10:25 Coffee break Benchmarking 10:25-11:00 An Independent Benchmarking of SDP and SOCP solvers, Hans Mittellmann, Arizona State University 11:00-12:00 Panel discussion 12:00-1:30 Lunch Combinatorial applications I 1:30-2:05 SDP tests for Higher Order Quadratic Programming Relaxations and Copositivity, Pablo A. Parrilo, California Institute of Technology 2:05-2:40 A strengthened semidefinite relaxation for Max Cut, Serge Kruk, Miguel Anjos, Henry Wolkowicz, University of Waterloo 2:40-2:55 Coffee break Combinatorial applications II 2:55-3:30 Combining Polyhedral and Non-Polyhedral Relaxations for the Stable Set Problem, Gerald Gruber, Franz Rendl, University of Klagenfurt 3:30-4:05 A Parallel Successive Convex Relaxation Algorithm for Quadratic Optimization Problems, Katsuki Fujisawa, Kyoto University, Akiko Takeda, Tokyo Institute of Technology, Yusuke Fukaya, Nippon Steel Information & Communication Systems Inc., Masakazu Kojima, Tokyo Institute of Technology Closing of the workshop
Previous: Participation
Next: Registration
Workshop Index
DIMACS Homepage