User talk:Karthikraoa

From Wikimization

(Difference between revisions)
Jump to: navigation, search
Current revision (18:26, 1 December 2009) (edit) (undo)
 
(4 intermediate revisions not shown.)
Line 1: Line 1:
-
The following is a problem very similar to the problem "Convex Iteration rank-1" in Jon Dattoro's book CONVEX OPTIMIZATION & EUCLIDEAN DISTANCE GEOMETRY
+
The following is a problem very similar to the problem "Convex Iteration rank-1" in Jon Dattorro's book CONVEX OPTIMIZATION & EUCLIDEAN DISTANCE GEOMETRY:
-
(Dn is the space of diagonal matrices and Sn is the space of symmetric matrices)
+
<math>\mathbb{S}^n</math> is the space of <math>n\times n</math> symmetric matrices.
 +
 
 +
<math>\,g</math> is a vector.
 +
 
 +
<math>\,\delta(g)</math> is a diagonal matrix whose main diagonal is <math>\,g.</math>
<br>
<br>
-
<math>\begin{array}{rl}\mbox{find}&X\in S_n~, ~G\in D_n\\
+
<math>\begin{array}{rl}\mbox{find}&X\!\in\mathbb{S}^n, ~g\in\mathbb{R}^n\\
\mbox{subject to}
\mbox{subject to}
-
& A\,\mbox{svec}X = b\\
+
&A\,\mbox{svec}X = b\\
-
&GXc = d\\
+
&\delta(g)Xc = d\\
-
&X\ge 0\\
+
&X\succeq 0\\
&\mbox{rank}X\le r
&\mbox{rank}X\le r
\end{array}</math>
\end{array}</math>

Current revision

The following is a problem very similar to the problem "Convex Iteration rank-1" in Jon Dattorro's book CONVEX OPTIMIZATION & EUCLIDEAN DISTANCE GEOMETRY:

LaTeX: \mathbb{S}^n is the space of LaTeX: n\times n symmetric matrices.

LaTeX: \,g is a vector.

LaTeX: \,\delta(g) is a diagonal matrix whose main diagonal is LaTeX: \,g.


LaTeX: \begin{array}{rl}\mbox{find}&X\!\in\mathbb{S}^n, ~g\in\mathbb{R}^n\\ \mbox{subject to} &A\,\mbox{svec}X = b\\ &\delta(g)Xc = d\\ &X\succeq 0\\ &\mbox{rank}X\le r \end{array}

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