Talk:Semidefinite programming
From Wikipedia, the free encyclopedia
 |
This article is within the scope of WikiProject Systems, which collaborates on articles about the idea of systems. If you would like to help, you can edit this article or visit the project page, where you can join the project and/or contribute to the discussion. | |
| ??? | This article has not yet received a rating on the assessment scale. [FAQ] | |
| ??? | This article has not yet received an importance rating within Systems. | |
|
Please rate this article, and then leave comments here to explain the ratings and/or to identify the strengths and weaknesses of the article. |
||
[edit] 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)
