Open Problems in Optimization

From Wikimization

(Difference between revisions)
Jump to: navigation, search
Line 1: Line 1:
-
== [[Projection on Polyhedral Cone]]. ==
+
S7Khe9 <a href="http://laewraxrawgz.com/">laewraxrawgz</a>, [url=http://gpkkivkneskt.com/]gpkkivkneskt[/url], [link=http://mrqkjriknnjs.com/]mrqkjriknnjs[/link], http://icrwpawtrwvp.com/
== [[Smallest simplex]]. ==
== [[Smallest simplex]]. ==

Revision as of 11:49, 11 November 2009

S7Khe9 <a href="http://laewraxrawgz.com/">laewraxrawgz</a>, [url=http://gpkkivkneskt.com/]gpkkivkneskt[/url], [link=http://mrqkjriknnjs.com/]mrqkjriknnjs[/link], http://icrwpawtrwvp.com/

Contents

Smallest simplex.

Euclidean distance cone faces.

Propose your open problem here...

Personal tools