Approximations and improvements to semidefinite relaxations of optimization problems
Authors
Lee, Timothy
ORCID
Loading...
Other Contributors
Mitchell, John E.
Bennett, Kristin P.
Ecker, Joseph G.
Sharkey, Thomas C.
Bennett, Kristin P.
Ecker, Joseph G.
Sharkey, Thomas C.
Issue Date
2013-08
Keywords
Mathematics
Degree
PhD
Terms of Use
This electronic version is a licensed copy owned by Rensselaer Polytechnic Institute, Troy, NY. Copyright of original work retained by author.
Full Citation
Abstract
At the beginning of the 1990s, semidefinite programming (SDP) gained popularity as one of the major research areas of convex optimization and attracted many researchers from various disciplines. Today many engineers and scientists around the world use semidefinite programming to solve problems in engineering, geometry, combinatorial optimization, polynomial optimization and natural science.
Description
August 2013
School of Science
School of Science
Department
Dept. of Mathematical Sciences
Publisher
Rensselaer Polytechnic Institute, Troy, NY
Relationships
Rensselaer Theses and Dissertations Online Collection
Access
Restricted to current Rensselaer faculty, staff and students. Access inquiries may be directed to the Rensselaer Libraries.