User talk:Karthikraoa
From Wikimization
(Difference between revisions)
(New page: 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 mat...) |
|||
| Line 6: | Line 6: | ||
<math>\begin{array}{rl}\mbox{find}&X\in S_n~, ~G\in D_n\\ | <math>\begin{array}{rl}\mbox{find}&X\in S_n~, ~G\in D_n\\ | ||
\mbox{subject to} | \mbox{subject to} | ||
| - | & A\,svec X = b\\ | + | & A\,\mbox{svec}X = b\\ |
&GXc = d\\ | &GXc = d\\ | ||
&X\ge 0\\ | &X\ge 0\\ | ||
&\mbox{rank}X\le r | &\mbox{rank}X\le r | ||
\end{array}</math> | \end{array}</math> | ||
Revision as of 17:48, 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)