School Seminars and Colloquia

What is ``in" Semidefinite Programming?


by Renata Sotirov

Institution: The University of Melbourne
Date: Fri 29th October 2004
Time: 1:05 PM
Location: Room 213, Richard Berry Building

Abstract: Semidefinite Programming (SDP) is an extension of linear programming where the
nonnegativity constraints are replaced by positive semidefiniteness on the matrix
variables. Though SDPs (under various names) have been studied as far back
as the 1940s, the interest has grown tremendously during the last 10 years.
That is due to the recent developments in algorithms as well as in computational
platforms that resulted in a large improvement in the capability to solve SDP
problems. Since SDP offers excellent possibilities for the design of very tight
relaxations for combinatorial problems, problems in engineering etc., it turns
to be one of the ``hottest" area in Optimization.

In the Seminar we give motivation, some properties, examples and applications of SDP.

But maybe, we provide You even more ...

For More Information: Mark Fackrell