User:Karthikraoa

From Wikimization

Revision as of 17:28, 1 December 2009 (edit) Karthikraoa (Talk | contribs) ← Previous diff		Current revision (17:47, 1 December 2009) (edit) (undo) Dattorro (Talk | contribs)
(2 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	+	[http://www.convexoptimization.com/wikimization/index.php?title=Special:Userlogin&returnto=Special:Userlogout Login] required to [http://www.convexoptimization.com/wikimization/index.php/Special:Emailuser/Karthikraoa E-mail this user].<br>
-	DISTANCE GEOMETRY (Dn is the space of diagonal matrices and Sn is the space of symmetric matrices)	+	If you do not already have an account, [http://www.convexoptimization.com/wikimization/index.php?title=Special:Userlogin&type=signup create one here].
-		+
-	find <math>X \in S_n </math> and <math> G \in D_n</math>	+
-		+
-	subject to	+
-		+
-	A svec X = b	+
-		+
-	G X c = d	+
-		+
-	<math> X \ge 0 </math>	+
-		+
-	<math> rank X \le r </math>	+

---

Current revision

Login required to E-mail this user.
If you do not already have an account, create one here.