Benoît Legat

* For constraints `norm(U*x)

PolyJuMP models problem where the decision variables are part of the coefficients of the polynomials. We are not trying to find values of the variables of the polynomials, we are...

> You mean something like `@test f(x)=0 has a solution with property A`? You mean something like `@test f(x)=0` has a solution with property A? Sometimes, you get the closed...

Yes, Ubuntu 32-bits with Julia v1.6.1

> Somewhat ;) Should mostly work now, but I think the problem is, that it might come up again, whenever things get out of sync On ArchLinux with an integrated...

You can use the binary produced by https://github.com/benlorenz/cddlibbuilder for python too. They are produced by a Julia package (BinaryBuilder) but it's just classical cross-compiled binaries that can be used by...

This might be related: We started a project to abstract all the code we have in JuMP/src/operator.jl to rewrite LinearAlgebra and SparseArrays code for JuMP expressions: https://github.com/JuliaOpt/MutableArithmetics.jl/blob/master/src/linear_algebra.jl The approach would...

> We should probably disable the 2nd bridge by default and let the user add it explicitly in case a large number of variables is used with low degree until...

Note: motzkin polynomial is a nice test example

Note that in YALMIP, this is done by default but it does not precompute the H-representation but rather get separating hyperplanes lazily by solving LP's in the V-representation. See section...