Benoît Legat
Benoît Legat
The strategy I use for most operators (not only `==`) is to define `op(::Any, ::A)`, `op(::A, ::Any)` and `op(::A, ::A)` then you don't have any ambiguity. If several types are...
Sorry I didn't read in detail, yes indeed, it won't work of two packages do it. Would the suggestion in https://github.com/JuliaAlgebra/MultivariatePolynomials.jl/issues/290#issuecomment-2775414705 address the concern ?
The `GramMatrix` is a polynomial in the form `s = b' * Q * b` where `b` is some polynomial basis. If you want to convert it to a polynomial,...
Yes this one does exactly that https://juliaalgebra.github.io/MultivariatePolynomials.jl/stable/types/#MultivariatePolynomials.polynomial_type
Good question. I also need to do this frequently, and also for JuMP when you want to obtain the type `JuMP.AffExpr` from the type `JuMP.VariableRef` in a generic way, e.g.,...
This would also solve https://github.com/jump-dev/Dualization.jl/issues/73
We could give a partial map that errors for constraints that are bridged with a nice error message
What's the difference with `MOI.add_constrained_variable(model, MOI.Interval(lower, upper))` ?
Sounds good, can you just add tests ?
I don't understand where the added allocations come from. It seems to be because I changed `operate!!` into `buffered_operate!!`. Actually, changing to `operate!` further reduces it while it shouldn't. `promote_operation`...