User talk:Karthikraoa

From Wikimization

(Difference between revisions)
Jump to: navigation, search
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:
<math>\mathbb{S}^n</math> is the space of <math>n\times n</math> symmetric matrices.
<math>\mathbb{S}^n</math> is the space of <math>n\times n</math> symmetric matrices.

Revision as of 18:24, 1 December 2009

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\\ \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