Dear Colleague,
<br>
   We would like to invite you to participate in 
the workshop on:
<br>
<hr>
<center>
     Semidefinite Programming and Interior-Point Approaches for
           Combinatorial Optimization Problems<br>
</center>
<hr>

Wednesday May 15- Friday 17, 1996<br>
(before the SIAM Conference on Optimization in Victoria)<br>
<br>
to be held at<br>
The Fields Institute, Toronto, Ontario, Canada<br>
<br>
(More Information is available on WWW with URL:<br>
     http://orion.math.uwaterloo.ca/~hwolkowi/fields.d/readme.html  )<br>
<br>
(We may have support to pay for your accommodations for up to 3 nights.)<br>
<br>
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.
<br>
Please pass this information on to colleagues who may be interested.<br>
<br>
Organizers:<br>
<a href="mailto:jcheriyan@watdragon.uwaterloo.ca">
 Joseph Cheriyan</a> (University of Waterloo), <br>
<a href="mailto:whcunnin@watmath.uwaterloo.ca">
 Bill Cunningham</a> (University of Waterloo), <br>
<a href="mailto:pardalos@math.ufl.edu">
 Panos Pardalos</a> (University of Florida), <br>
<a href="mailto:ltuncel@watdragon.uwaterloo.ca">
 Levent Tuncel</a> (University of Waterloo), <br>
<a href="mailto: vannelli@cheetah.vlsi.uwaterloo.ca">
 Tony Vannelli</a> (University of Waterloo), <br>
<br>
<img SRC="http://orion.math.uwaterloo.ca/~hwolkowi/henryw.gif">  
<br>

 Henry Wolkowicz</a> (University of Waterloo),
<br>
<p>
       Workshop Description <br>
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.
<br>
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:
<br>
1. Semidefinite Programming Theory: duality theory; convergence theory;
numerical stability.
<br>
2. Semidefinite Programming  Algorithms: interior point methods; simplex
type algorithms.
<br>
3. Global Optimization and Combinatorial Applications: quadratic assignment
problem; clique problem; graph partitioning; boolean programming.
<br>
4. Nonlinear Programming: trust region subproblems;
quadratic programs with quadratic constraints; SQP algorithms.
<br>
5. Engineering Applications: VLSI design; solutions of Lyapunov equations;
general linear matrix inequalities in systems and control theory.
<br>
6. Matrix Completion Problems: positive definite completions; specified
inertial completions.
<br>
<br>

A proceedings of refereed invited papers is planned.

<br>
<hr>
<br>
   HOPE to see you in Toronto in the spring.