User:Karthikraoa
From Wikimization
(Difference between revisions)
| Line 1: | Line 1: | ||
| - | The following is a problem very similar to the problem "Convex Iteration rank-1" in Jon Dattoro's book | + | The following is a problem very similar to the problem "Convex Iteration rank-1" in Jon Dattoro's book CONVEX OPTIMIZATION & EUCLIDEAN |
| - | (Dn is the space of diagonal matrices and Sn is the space of symmetric matrices) | + | DISTANCE GEOMETRY (Dn is the space of diagonal matrices and Sn is the space of symmetric matrices) |
find <math>X \in S_n </math> and <math> G \in D_n</math> | find <math>X \in S_n </math> and <math> G \in D_n</math> | ||
Revision as of 17:27, 1 December 2009
The following is a problem very similar to the problem "Convex Iteration rank-1" in Jon Dattoro's book CONVEX OPTIMIZATION & EUCLIDEAN DISTANCE GEOMETRY (Dn is the space of diagonal matrices and Sn is the space of symmetric matrices)
find and
subject to
A svec X = b
G X c = d