Tangi Migot
Tangi Migot
 The difficulty for the last problem is with the JuMP Model. The issue is with the computation of the Chebyshev polynomials that are defined recursively. I tried things like...
Well, it's true we could try to simplify the `sum` in `NLobjective` but I had similar issues for other models as well and was wondering if there was a simpler...
``` # # Problem 1 in # L. Luksan, C. Matonoha and J. Vlcek # Sparse Test Problems for Unconstrained Optimization, # Technical Report 1064, # Institute of Computer Science,...
I am wondering if there was any update on this topic?
Oh, sorry to hear that. Thanks for your answer.
I think almost all the optimization solvers have it now, see, for instance, https://github.com/JuliaSmoothOptimizers/JSOSolvers.jl/blob/21b97086a4b55b6893b7c5a2482e400aded16d68/src/R2.jl#L109
Hey @salomonl and @amontoison I don't think there is something about specifying integer or boolean in the documentation that would be really a great add-on if that's possible with Nomad.jl!
Thank you! Maybe we could add a CITATION.cff file at the origin of this repo so that Github gives the link directly. I can open a PR if you think...
Hi @vchuravy , it's slightly trickier than I thought as you have 15 authors... Would you consider some primary authors and add `and contributors` ? This is the tool: https://citation-file-format.github.io/cff-initializer-javascript/#/
The breakage fails because of the new releases of NLPModelsModifiers and to be NLPModelsTest ; I will re-run this when they arrive.