to the home page of Henry Wolkowicz
and Semidefinite Programming web page
Semidefinite Programming and Interior-Point Approaches for
Combinatorial Optimization Problems
Wednesday May 15- Friday May 17, 1996
Supported jointly by
Fields Institute and
SIAM Conference on Optimization in Victoria
, May 20-22,
1996; and after
Optimization Days in Montreal
May 13-15, 1996.)
to be held at
The Fields Institute,
University of Toronto campus
222 College Street
Toronto, Ontario, Canada M5T 3J1
The proceedings are published in:
18.Topics in Semidefinite and Interior-Point Methods, eds. P. Pardalos,
University of South Florida and H. Wolkowicz,
University of Waterloo, AMS, 1998, 250pp.
Fields Institute Communication Series.
table of contents from Math Review)
Last Updated 5/27/1996
If you have presented a
paper at the workshop, please tell us whether
you plan to submit
it to the special issue and/or to the proceedings.
Submissions to the
special issue and/or the proceedings should be done
by Sept. 1, 1996. You can submit the paper by email,
(Send email to
or send 3 copies by regular mail to Henry or Panos. Also, please send us
the URL for your paper, if it is available. We will keep it with this
permanent home page for the workshop.
Information on style files are available from
instructions for manuscript preparation; and
Manual for Authors.
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),
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:
A proceedings published by AMS of refereed invited papers is planned.
In addition, we will have a special issue of J. of Comb. Opt. for
1. Semidefinite Programming Theory: duality theory; convergence theory;
2. Semidefinite Programming Algorithms: interior point methods; simplex
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
This file, participants list, and other various files are available in
the parent directory.
email address for Fields Institute: firstname.lastname@example.org (Karen
Miscellaneous information on Semidefinite Programming (MORE than you
ever wanted to know)
This workshop is supported jointly by the
Fields Institute and