| |
Semidefinite Programming and Applications |
| October 07, 2002 to October 11, 2002 |
| Organized By: Dimitris Bertsimas, Stephen Boyd, Laurent El Ghaoui (chair), and Bernd Sturmfels |
| |
| Participant List: |
| View a List of Registered Participants |
| |
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:
- algebraic geometry,
- combinatorial optimization,
- control theory,
- machine learning and statistics, and
- finance and networks.
|
| |
|
| |
|
For more information:
Questions about this workshop should be sent either by email to
or by regular mail to:
Semidefinite Programming and Applications
Mathematical Sciences Research Institute
17 Gauss Way, Berkeley, CA
94720-5070.
USA
The Institute is committed to the principles of Equal Opportunity and Affirmative Action.
|
| |
| Back to Workshop Listing |
