User:Karthikraoa
From Wikimization
(Difference between revisions)
| Line 7: | Line 7: | ||
A svec X = b | A svec X = b | ||
| + | |||
| + | G X c = d | ||
<math> X \ge 0 </math> | <math> X \ge 0 </math> | ||
| - | <math> rank X \le r </math> | + | <math> rank X \le r </math> |
| - | + | ||
| - | + | ||
Revision as of 17:28, 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