User talk:Karthikraoa

From Wikimization

Revision as of 17:45, 1 December 2009 by Dattorro (Talk | contribs)
(diff) ←Older revision | Current revision (diff) | Newer revision→ (diff)
Jump to: navigation, search

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)


LaTeX: \begin{array}{rl}\mbox{find}&X\in S_n~, ~G\in D_n\\ \mbox{subject to} & A\,svec X = b\\ &GXc = d\\ &X\ge 0\\ &\mbox{rank}X\le r \end{array}

Retrieved from "http://www.convexoptimization.com/wikimization/index.php/User_talk:Karthikraoa"
Personal tools