Semidefinite programming is a recently developed branch of convex optimization which optimizes a linear function subject to nonlinear constraints, the most important of which require that a combination of symmetric matrices be positive semidefinite. Semidefinite programming has a broad applicability and algorithmic efficiency, making it very appealing for use in all kinds of areas of study. This project begins by focusing on the understanding of semidefinite programming and its methods for numerical solution. It then surveys the vast and exciting applications of semidefinite programming and investigates the Sensor Network Localization Problem (SNLP). Lastly, it provides a tutorial for implementing the use of online tools and the computer codes I developed to solve the SNLP.

• This report represents the work of one or more WPI undergraduate students submitted to the faculty as evidence of completion of a degree requirement. WPI routinely publishes these reports on its website without editorial or peer review.

Creator

• Hegarty, Elizabeth Anne

Publisher

• Worcester Polytechnic Institute

Identifier

• E-project-042910-170331

Advisor

• Martin, William J.

Year

• 2010

Date created

• 2010-04-29

Resource type

• Major Qualifying Project

Major

• Mathematical Sciences

Rights statement

• In Copyright

Last modified

• 2021-01-06