Benoît Legat

Results 481 comments of Benoît Legat

Yes, the current approach is for other packages to have SemialgebraicSets/MultivariatePolynomials in their dependency, e.g., HomotopyContinuation has SemialgebraicSets it its dependency to implement its interface and DynamicPolynomials/TypedPolynomials have MultivariatePolynomials in...

I get the same with a temporary environment: ```julia (@v1.7) pkg> activate --temp Activating new project at `/tmp/jl_AN9iCX` julia> versioninfo() Julia Version 1.7.1 Commit ac5cc99908 (2021-12-22 19:35 UTC) Platform Info:...

We have the same issue with OpenStreetMapX: https://github.com/pszufe/OpenStreetMapX.jl/pull/44#discussion_r667459615 > The count and names of fields is known during code generation, so one way could be to generate specialized code for...

> The point is just that one would have to re-write the entire code-generation logic. Indeed. It's best to try it out by manually doing it for one package. I...

If `r` is a matrix, you can just do `r * p`. This will use the V-representation. I don't know of any way to get the linear image of a...

It is already supported through bridges: https://github.com/JuliaPolyhedra/Polyhedra.jl/blob/3b289ddf7ab4c8626c87eaf8a42f0e73cc2d7e26/src/lphrep.jl#L21 `full_bridge_optimizer` adds many bridges including http://www.juliaopt.org/MathOptInterface.jl/dev/apireference/#MathOptInterface.Bridges.ScalarizeBridge which transforms `VectorAffineFunction` to `ScalarAffineFunction`.

See [this discourse](https://discourse.julialang.org/t/solve-minimization-problem-where-constraint-is-the-system-of-linear-inequation-with-mathoptinterface-efficiently/23571/3) post for how to formulate the constraint with VectorAffineFunction.

You should do `optimizer = MOI.Bridges.full_bridge_optimiezr(CDDLib.Optimizer{T}(), T)`

Which tutorial are you following ? It should now be `h = hrep(A, b)`

Thanks, we stopped using readthedocs for a while and should find a way to dismantle it.