Jump to content

Talk:Semidefinite programming

Page contents not supported in other languages.
From Wikipedia, the free encyclopedia
This is an old revision of this page, as edited by Mdd (talk | contribs) at 20:53, 12 May 2008 ({{WikiProject Systems}}). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.
WikiProject iconSystems
WikiProject iconThis article is within the scope of WikiProject Systems, which collaborates on articles related to systems and systems science.SystemsWikipedia:WikiProject SystemsTemplate:WikiProject SystemsSystems
???This article has not yet received a rating on the project's importance scale.
Taskforce icon
This article is not associated with a particular field. Fields are listed on the template page.

Hello,

welcome to the article on semidefinite programming.
So far (May 3rd 2006) it is only a stub and definitely needs more input.
I prepared a skeleton and some first exterior links.

There is a lot to do on this article, and for its "environment" (e.g. theorem on primal-dual gap, etc).
In addition to the obvious (definition, duality, solvers etc.) it would be nice to have some formulations for interesting SDPs.
Moreover, it would be good to document the links to polynomial optimization and sums of squares (of polynomials).
But: it seems there are no articles for these as well.

Hopefully we get this article (and its environment) up and running fast.
Best, Hartwig The Whore


I added a "citation needed" tag to the reference to quantum computing, mostly because I would like to know more about this connection. Can someone give an in-depth reference for that?

Thanks! —Preceding unsigned comment added by 128.135.214.108 (talk) 01:57, 3 February 2008 (UTC)[reply]

Retrieved from "https://en.wikipedia.org/w/index.php?title=Talk:Semidefinite_programming&oldid=211954782"