Open Problems in Optimization

From Wikimization

Revision as of 18:34, 10 June 2008 (edit) Flyshcool (Talk | contribs) (→2) Simplex) ← Previous diff		Current revision (00:08, 2 July 2010) (edit) (undo) Ranjelin (Talk | contribs) (→[http://www.convexoptimization.com/wikimization/index.php/User:Dattorro Convex Optimization of a Reverberator.])
(18 intermediate revisions not shown.)
Line 1:		Line 1:
-	== 1) [[Projection on Polyhedral Cone]] ==	+	== [[Projection on Polyhedral Cone]]. ==
-	== 1) [[Simplex]] ==	+	== [[Smallest simplex]]. ==
-	== 3) ==	+	== [[Euclidean distance cone faces]]. ==
		+
		+	== [[User:Dattorro|Convex Optimization of a Reverberator]]. ==
		+
		+	== <i>Propose your open problem here...</i>==
		+
		+	== ==
		+
		+	== ==
		+
		+	== ==
		+
		+	== ==
		+
		+	== ==

---

Current revision

Contents 1 Projection on Polyhedral Cone. 2 Smallest simplex. 3 Euclidean distance cone faces. 4 Convex Optimization of a Reverberator. 5 Propose your open problem here... 6 7 8 9 10

Projection on Polyhedral Cone.

Smallest simplex.

Euclidean distance cone faces.

Convex Optimization of a Reverberator.

Propose your open problem here...