Final report, DOE Grant DE-FG02-98ER25352, Computational semidefinite programming
Semidefinite programming (SDP) is an extension of linear programming, with vector variables replaced by matrix variables and component wise nonnegativity replaced by positive semidefiniteness. SDP's are convex, but not polyhedral, optimization problems. SDP is well on its way to becoming an established paradigm in optimization, with many current potential applications. Consequently, efficient methods and software for solving SDP's are of great importance. During the award period, attention was primarily focused on three aspects of computational semidefinite programming: General-purpose methods for semidefinite and quadratic cone programming; Specific applications (LMI problems arising in control, minimizing a sum of Euclidean norms, a quantum mechanics application of SDP); and Optimizing matrix stability.
- Research Organization:
- Courant Institute of Mathematical Sciences, New York University, New York, NY (US)
- Sponsoring Organization:
- USDOE Office of Energy Research (ER) (US)
- DOE Contract Number:
- FG02-98ER25352
- OSTI ID:
- 806634
- Resource Relation:
- Other Information: PBD: 5 Sep 2002; PBD: 5 Sep 2002
- Country of Publication:
- United States
- Language:
- English
Similar Records
Project Report on DOE Young Investigator Grant (Contract No. DE-FG02-02ER25525) Dynamic Scheduling and Fusion of Irregular Computation (August 15, 2002 to August 14, 2005)
Bandgap optimization of two-dimensional photonic crystals using semidefinite programming and subspace methods