DIMACS Workshop on Semidefinite Programming and Large Scale Discrete Optimization

Computer Science Building, Princeton University, Princeton, NJ

08:00 - 08:30 Registration 08:30 - 08:40 Welcome, Robert Vanderbei, Workshop co-organizer## 08:40 - 09:30 Kurt Anstreicher, Eigenvalue Bounds versus Semidefinite Relaxations for the Quadratic Assignment Problem

Plenary## 09:30 - 10:00 Gabor Pataki, A Characterization of Conic Linear Systems with a Duality Gap 10:00 - 10:30 Renato Monteiro, An efficient algorithm for solving the maximum cut SDP relaxation problem 10:30 - 11:00 Coffee 11:00 - 11:30 Etienne de Klerk, Semidefinite Programming Approaches for SAT and MAX-SAT 11:30 - 12:00 Bill Hager, Graph Partitioning and Continuous Quadratic Programming 12:00 - 12:30 Steven Benson, A Dual Scaling Algorithm for Positive semidefinite Programming 12:30 - 01:30 Lunch

Applications Session -- Mostly Graph Theory## 01:40 - 02:30 Dimitris Bertsimas, Moment problems, stochastic optimization, and semidefinite programming

Plenary## 02:30 - 03:00 Michael Overton, Conditioning and Degeneracy of Semidefinite Programs 03:00 - 03:30 Robert Freund, Pre-Conditioners and Relations Between Different Condition Measures for Semi-Definite Programs and Conic Linear Systems 03:30 - 04:00 Coffee 04:00 - 04:30 Masakazu Muramatsu, A Class of Directly Solvable Semidefinite Programming Problems 04:30 - 05:00 Bahman Kalantari, Scaling Dualities and Self-Concordant Homogeneous Programming in Finite Dimensional Spaces 05:00 - 05:30 Franz Rendl, Semidefinite Programs and Association Schemes 05:30 - 06:00 Jim Renegar, A clearer understanding of self-scaled cones

Theory Session

Friday, January 8, 1999## 08:40 - 09:30 Michael Todd, Interior-Point Methods for Semidefinite Programming

Plenary## 09:30 - 10:00 Leonid Faybusovich, On the numerical integration of affine-scaling vector fields 10:00 - 10:30 Kees Roos, A New Path-following Algorithm for Semidefinite Optimization 10:30 - 11:00 Coffee 11:00 - 11:30 Osman Guler, Symmetric Cones and their Barrier Functions 11:30 - 12:00 Michael Zibulevsky, Penalty/Barrier Multiplier Algorithm for Semidefinite Programming: Dual Bounds and Implementation 12:00 - 12:30 Florian Potra, Nonsymmetric Search Directions for Semidefinite Programming 12:30 - 01:30 Lunch

Algorithms Session## 01:40 - 02:30 Christof Helmberg, Solving Semidefinite Relaxations with the Spectral Bundle Method

Plenary## 02:30 - 03:00 Zhi-Quan Luo, Orthogonal Waveform Design via Semidefinite Programming 03:00 - 03:30 Yin Zhang, Computational experience with interior-point algorithms for the maximally inscribing ellipsoid problem 03:30 - 04:00 Coffee 04:00 - 04:30 Vera Kovacevic-Vujcic, Semidefinite Relaxations of Traveling Salesman Problem 04:30 - 05:00 Guoliang Xue, Computing the Shortest Network with 45 Degree Routing under a Tree Topology 05:00 - 05:30 Takashi Tsuchiya, Polynomial primal-dual path-following algorithms for second-order cone programming based on the MZ-family of search directions 05:30 - 06:00 Paul Tseng, Accelerating local convergence of interior-point methods for NLP and SDP

Applications Session -- Mostly not Graph Theory

Saturday, January 9, 1999## 08:40 - 09:30 David Williamson, Semidefinite Programming and Approximation Algorithms

Plenary## 09:30 - 10:00 Katya Scheinberg, Solving Second Order Cone Programs in an Efficient and Numerically Stable Way 10:00 - 10:30 Farid Alizadeh, Associative Algebras, Symmetric Cones and Primal-dual Interior Point Algorithms 10:30 - 11:00 Coffee 11:00 - 11:30 Stefan Schmieta, Sparse matrices and numerical stability in convex quadratically constrained optimization 11:30 - 12:00 Robert Vanderbei, Using LOQO to Solve Second-Order Cone Programming Problem 12:00 - 12:30 Tamas Terlaky, Notes on second- and $p-$order conic programming--duality and solvability 12:30 - 01:30 Lunch

Cone Programming## 01:40 - 02:30 Masakazu Kojima, Discretization and Localization in Successive Convex Relaxation Methods for Nonconvex Quadratic Optimization Problems

Plenary## 02:30 - 03:00 Levent Tuncel, Cones of matrices and successive convex relaxations of nonconvex sets 03:00 - 03:30 Shuzhong Zhang, Quadratic Maximization and Semidefinite Relaxation 03:30 - 04:00 Coffee 04:00 - 04:30 Lorant Porkolab, A Linear-time Algorithm for Semidefinite Optimization in Fixed Dimension 04:30 - 05:00 Florian Jarre, A QQP-Minimization Method for Semidefinite and Smooth Nonconvex Programs 05:00 - 05:30 Yinyu Ye, Approximating global quadratic optimization with convex quadratic constraints 05:30 - 06:00 Jeffrey Coleman, Design of Digital Filters and Narrowband Antenna Arrays using Second-Order Cone Programs

Algorithms Session--Mostly Nonconvex QP Stuff

Previous: Participation

Next: Registration

Workshop Index

DIMACS Homepage

Contacting the Center

Document last modified on July 26, 1999.