User:Karthikraoa - Revision history

Dattorro at 00:47, 2 December 2009

Dattorro — Wed, 02 Dec 2009 00:47:31 GMT

←Older revision		Revision as of 00:47, 2 December 2009
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~~	+	[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>
-		+	If you do not already have an account, [http://www.convexoptimization.com/wikimization/index.php?title=Special:Userlogin&type=signup create one here].
-	~~(Dn is the space of diagonal matrices and Sn is the space of symmetric matrices)~~	+
-		+
-	<br>	+
-	~~<math>\begin{array}{rl}\mbox{find}&X\in S_n~~~, ~~~G\in D_n\\~~	+
-	~~\mbox{subject to}~~	+
-	~~& A\,svec X~~ = ~~b\\~~	+
-	&~~GXc~~ = ~~d\\~~	+
-	~~&X\ge 0\\~~	+
-	~~&\mbox{rank}X\le r~~	+
-	~~\end{array}</math>~~	+

71.198.185.156 — Wed, 02 Dec 2009 00:39:58 GMT

←Older revision		Revision as of 00:39, 2 December 2009
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	+	The following is a problem very similar to the problem "Convex Iteration rank-1" in Jon Dattoro's book CONVEX OPTIMIZATION & EUCLIDEAN DISTANCE GEOMETRY
-	DISTANCE GEOMETRY ~~(Dn is the space of diagonal matrices and Sn is the space of symmetric matrices)~~	+

-	~~find <math>X \in S_n </math>~~ and ~~<math> G \in D_n</math>~~	+	(Dn is the space of diagonal matrices and Sn is the space of symmetric matrices)

-	subject to	+	<br>
-		+	<math>\begin{array}{rl}\mbox{find}&X\in S_n~, ~G\in D_n\\
-	A svec X = b	+	\mbox{subject to}
-		+	& A\,svec X = b\\
-	~~G X c~~ = d	+	&GXc = d\\
-		+	&X\ge 0\\
-		+	&\mbox{rank}X\le r
-	~~<math>~~ X \ge 0 ~~</math>~~	+	\end{array}</math>
-		+
-	~~<math>~~ rank X \le r </math>	+

Karthikraoa — Wed, 02 Dec 2009 00:29:41 GMT

Karthikraoa — Wed, 02 Dec 2009 00:28:58 GMT

Karthikraoa — Wed, 02 Dec 2009 00:28:37 GMT

Karthikraoa — Wed, 02 Dec 2009 00:27:27 GMT

←Older revision		Revision as of 00:27, 2 December 2009
Line 1:		Line 1:
-	The following is a problem very similar to the problem "Convex Iteration rank-1" in Jon Dattoro's book	+	The following is a problem very similar to the problem "Convex Iteration rank-1" in Jon Dattoro's book CONVEX OPTIMIZATION & EUCLIDEAN
-	(Dn is the space of diagonal matrices and Sn is the space of symmetric matrices)	+	DISTANCE GEOMETRY (Dn is the space of diagonal matrices and Sn is the space of symmetric matrices)

	find <math>X \in S_n </math> and <math> G \in D_n</math>		find <math>X \in S_n </math> and <math> G \in D_n</math>

Karthikraoa — Wed, 02 Dec 2009 00:21:58 GMT

←Older revision		Revision as of 00:21, 2 December 2009
Line 6:		Line 6:
	subject to		subject to

-		+	A svec X = b
-	~~<math>~~ A ~~</math>~~ svec ~~<math>~~ X ~~</math>~~ = ~~<math>~~ b ~~</math>~~	+

Karthikraoa — Wed, 02 Dec 2009 00:21:07 GMT

←Older revision		Revision as of 00:21, 2 December 2009
Line 16:		Line 16:


-	~~<math>~~ G ~~</math><math>~~ X~~</math><math>~~ c ~~</math>~~ = ~~<math>~~ d ~~</math>~~	+	G X c = d

Karthikraoa — Wed, 02 Dec 2009 00:19:33 GMT

←Older revision		Revision as of 00:19, 2 December 2009
Line 1:		Line 1:
	The following is a problem very similar to the problem "Convex Iteration rank-1" in Jon Dattoro's book		The following is a problem very similar to the problem "Convex Iteration rank-1" in Jon Dattoro's book
-	(Dn is the space of diagonal matrices)	+	(Dn is the space of diagonal matrices and Sn is the space of symmetric matrices)

	find <math>X \in S_n </math> and <math> G \in D_n</math>		find <math>X \in S_n </math> and <math> G \in D_n</math>

-	subject to <math> A </math> svec <math> X = b </math>	+	subject to
		+
		+
		+	<math> A </math> svec <math> X </math> = <math> b </math>
		+

	<math> X \ge 0 </math>		<math> X \ge 0 </math>

-	<math> rank X \le ρ </math>

-	<math> ~~GXc~~ = d </math>	+	<math> rank X \le r </math>
		+
		+
		+	<math> G </math><math> X</math><math> c </math> = <math> d </math>

Karthikraoa — Wed, 02 Dec 2009 00:12:02 GMT

←Older revision		Revision as of 00:12, 2 December 2009
Line 1:		Line 1:
	The following is a problem very similar to the problem "Convex Iteration rank-1" in Jon Dattoro's book		The following is a problem very similar to the problem "Convex Iteration rank-1" in Jon Dattoro's book
		+	(Dn is the space of diagonal matrices)

-	find <math>X \in S_n and G \in D_n</math> ~~(Dn is the space of diagonal matrices)~~	+	find <math>X \in S_n </math> and <math> G \in D_n</math>

-	subject to A svec X = b	+	subject to <math> A </math> svec <math> X = b </math>

-	X <math> \ge </math> 0	+	<math> X \ge 0 </math>

-	~~rankX~~ <math> \le </math> ρ	+	<math> rank X \le ρ </math>

-	GXc = d	+	<math> GXc = d </math>