DIMACS Workshop on Semidefinite Programming and its Applications to Large Scale Discrete Optimization
January 7 - 9, 1999
Princeton University, Department of Computer Science
Presented under the auspices of the Special Year on Large Scale Discrete Optimization.
- Yinyu Ye, The University of Iowa, firstname.lastname@example.org
- Robert J. Vanderbei, Princeton University, email@example.com
Semidefinite Programming has been a major research topic in the past several
years. It was mainly a theoretical model for proving bounds, for example, or
for showing desirable properties of certain mathematical problems. With the
extension of the theory and practice of interior point methods from
Linear Programming to Semidefinite Programming, many of these semidefinite
programs exhibited desired computational complexity and tractability.
This spurred interest and results in the field and development of approaches to solve large-scale semidefinite programs. It seems to be time to summarize all theoretical results, review various algorithmic approaches, demonstrate available implementation codes, explore important applications, and recommend future research directions of semidefinite programming.
The workshop will consist of 6 invited presentations, each of them a 50-minute lecture, survey, tutorial, or demonstration. It also
consists of about 30 talks (30 minutes each) on special issues.
Limited support for participants is available to cover some expenses. Graduate students are particularly encouraged to participate.
Next: Call for Participation
Contacting the Center
Document last modified on August 20, 1998.