Analysis of the Projective Re-Normalization method on semidefinite programming feasibility problems
Thesis (S.M.)--Massachusetts Institute of Technology, Computation for Design and Optimization Program, 2008.
Main Author: | Yeung, Sai Hei |
---|---|
Other Authors: | Robert M. Freund. |
Format: | Thesis |
Language: | eng |
Published: |
Massachusetts Institute of Technology
2008
|
Subjects: | |
Online Access: | http://hdl.handle.net/1721.1/43800 |
Similar Items
-
On semidefinite programming relaxations of the traveling salesman problem
by: De Klerk, Etienne., et al.
Published: (2009) -
Semidefinite programming and linear equations vs. homomorphism problems
by: Ciardo, L, et al.
Published: (2025) -
Semidefinite programming bounds for codes in complex projective space
by: Li, Rupert
Published: (2024) -
PYTHON CRASH COURSE : A HANDS-ON, PROJECT-BASED INTRODUCTION TO PROGRAMMING /
by: Matthes, Eric, author 655432
Published: ([202) -
On semidefinite programming relaxations of maximum k -section
by: Klerk, Etienne de., et al.
Published: (2013)