Dear Colleague,
We would like to invite you to participate in the workshop on:

Semidefinite Programming and Interior-Point Approaches for Combinatorial Optimization Problems

Wednesday May 15- Friday 17, 1996
(before the SIAM Conference on Optimization in Victoria)

to be held at
The Fields Institute, Toronto, Ontario, Canada

(More Information is available on WWW with URL: )

(We may have support to pay for your accommodations for up to 3 nights.)

Please inform us as soon as possible whether or not you can attend. Please send us a tentative title/abstract if you would like to give a talk.
Please pass this information on to colleagues who may be interested.

Joseph Cheriyan (University of Waterloo),
Bill Cunningham (University of Waterloo),
Panos Pardalos (University of Florida),
Levent Tuncel (University of Waterloo),
Tony Vannelli (University of Waterloo),

Henry Wolkowicz (University of Waterloo),

Workshop Description
Semidefinite Programming, interior point methods and global optimization approaches are active areas of research during the last decade. In particular, techniques from these areas have been applied to develop new algorithms for solving combinatorial optimization problems. More generally, techniques from continuous optimization can be effectively used in the development of efficient algorithms for combinatorial optimization problems.
The main focus of this workshop is to bring together some of the best researchers working on the algorithmic and practical applications on these areas with emphasis on the following topics:
1. Semidefinite Programming Theory: duality theory; convergence theory; numerical stability.
2. Semidefinite Programming Algorithms: interior point methods; simplex type algorithms.
3. Global Optimization and Combinatorial Applications: quadratic assignment problem; clique problem; graph partitioning; boolean programming.
4. Nonlinear Programming: trust region subproblems; quadratic programs with quadratic constraints; SQP algorithms.
5. Engineering Applications: VLSI design; solutions of Lyapunov equations; general linear matrix inequalities in systems and control theory.
6. Matrix Completion Problems: positive definite completions; specified inertial completions.

A proceedings of refereed invited papers is planned.

HOPE to see you in Toronto in the spring.