Semidefinite Programming and Applications
Oct 7, 2002
to
Oct 11, 2002
Organizer(s)Dimitris Bertsimas, Stephen Boyd, Laurent El Ghaoui (chair), and Bernd Sturmfels
To apply for funding, you must
register by Mon, Jul 22 2002.
Semidefinite programming refers to the problem of minimizing a linear objective subject to semidefiniteness constraints involving symmetric matrices that are affine in the decision variables.
Such a model of computation has enjoyed tremendous interest recently, due to its ubiquity in many areas of science and engineering. This workshop will cover theory and algorithms of SDP and several application areas, including but not limited to:
FundingTo apply for funding, you must
register by Mon, Jul 22 2002.
Click to Register
Students, recent Ph.D.'s, women, and members of underrepresented minorities are particularly encouraged to apply. Funding awards are made typically 6 weeks before the workshop begins. Requests received after the funding deadline are considered only if additional funds become available.
Questions about this workshop should be sent either by email to
or by regular mail to:
The Institute is committed to the principles of Equal Opportunity and Affirmative Action. |
 |