The package is very similiar to Gloptipoly or SparsePOP, and it can be found here: https://github.com/joachimdahl/Polyopt.jl
It was a design decision to keep the API close to the formulation of the Lasserre hierarchy, so that there is a close correspondence between the problem you specify and the actual semidefinite problem you solve. Yalmip and SOSTOOL have much more flexible modeling capabilities, but it becomes less transparent what the resulting SDP is. There is no documentation yet, but the tests show how to use it. There are some SOS examples, but actually the toolbox started as tool for forming the Lasserre hierarchy while exploiting chordal sparisty structure. I don't think many things will change, except for perhaps different ways to exploit sparsity in SOS certficates; if you want to solve polynomial problems using the Lasserre hierarchy it's probably useful already now, but not as an alternative to Yalmip or SOSTOOL. The plan is to have it finished by summer and present it at a software session at ISMP. On Sun, Mar 8, 2015 at 10:45 AM, Davide Lasagna <[email protected]> wrote: > Joachim, would you share this toolbox for polynomial optimisation? Is it > on GitHub? > I guess you wrote something's equivalent to yalmip or sostools. Did you > compare performances? > Davide
