Approximations and improvements to semidefinite relaxations of optimization problems
Loading...
Authors
Lee, Timothy
Issue Date
2013-08
Type
Electronic thesis
Thesis
Thesis
Language
ENG
Keywords
Mathematics
Alternative Title
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
Full Citation
Publisher
Rensselaer Polytechnic Institute, Troy, NY