An Overview of Semidefinite Programming and Duality in Cone Programming

• Wednesdays 10AM MC5136; Starting Jan. 12, 2005, at University of Waterloo, Dept. Combinatorics and Optimization.
• slides available after May/05.
• sdpa_format for SDP problems at e.g. NEOS.
  NEOS: sample Max-Cut Problem with n=100 and submission for sample problem
• local Max-Cut MATLAB program and testing the program