User:Karthikraoa

(Difference between revisions)

Revision as of 17:12, 1 December 2009

The following is a problem very similar to the problem "Convex Iteration rank-1" in Jon Dattoro's book (Dn is the space of diagonal matrices)

find $LaTeX: X \in S_n$ and $LaTeX: G \in D_n$

subject to $LaTeX: A$ svec $LaTeX: X = b$

$LaTeX: X \ge 0$

$LaTeX: rank X \le ρ$

$LaTeX: GXc = d$

@@ Line 1: / Line 1: @@
 The following is a problem very similar to the problem "Convex Iteration rank-1" in Jon Dattoro's book
+(Dn is the space of diagonal matrices)
-find <math>X \in S_n and G \in D_n</math> (Dn is the space of diagonal matrices)
+find <math>X \in S_n </math> and  <math> G \in D_n</math>
-subject to A svec X = b
+subject to <math> A </math> svec <math> X = b </math>
-X <math> \ge </math> 0
+<math> X \ge 0 </math>
-rankX <math> \le </math> ρ
+<math> rank X \le ρ </math>
-GXc = d
+<math> GXc = d </math>