User talk:Karthikraoa

From Wikimization

Revision as of 17:48, 1 December 2009 (edit) Dattorro (Talk | contribs) ← Previous diff		Revision as of 18:15, 1 December 2009 (edit) (undo) Dattorro (Talk | contribs) Next diff →
Line 8:		Line 8:
	& A\,\mbox{svec}X = b\\		& A\,\mbox{svec}X = b\\
	&GXc = d\\		&GXc = d\\
-	&X\ge 0\\	+	&X\succeq 0\\
	&\mbox{rank}X\le r		&\mbox{rank}X\le r
	\end{array}</math>		\end{array}</math>

---

Revision as of 18:15, 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)