User talk:Karthikraoa

From Wikimization

(Difference between revisions)
Jump to: navigation, search
Line 5: Line 5:
<math>\,g</math> is a vector.
<math>\,g</math> is a vector.
-
<math>\,\delta(g)</math> is a diagonal matrix whose main diagonal is <math>g</math>
+
<math>\,\delta(g)</math> is a diagonal matrix whose main diagonal is <math>\,g.</math>
<br>
<br>

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

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\\
\mbox{subject to}
&A\,\mbox{svec}X = b\\
&\delta(g)Xc = d\\
&X\succeq 0\\ 
&\mbox{rank}X\le r 
\end{array}

Personal tools