I have an idea for a new gradient descent algorithm. I just want to see if it does better or worse than a standard momentum methods.
How would I go about making use of the existing benchmarking suites CUTEst.jl or OptimizationProblems.jl. Their manuals show how to run them on existing solvers, but how would I go about writing my own solution method. Cant seem to find anything in the JuMP or ADNLPModels manual. The code is somewhat elaborate in JSOSolvers.jl/src at main · JuliaSmoothOptimizers/JSOSolvers.jl · GitHub. Whats the bare minimum I need to run these test suites? Thanks!
Your post Creating a JSO-compliant solver is a super helpful resource, thanks @abelsiqueira, and the hard work on these nice packages @tmigot ! It be great if this were in the docs of JSOSolvers.jl or OptimizationProblems.jl or both. I really appreciate your help. I will try this out. It may take a some days, but I will report back when i get things working or get stuck.
P.S. I don’t understand the solver skeleton package, will this make the process easier?
The motivation for the skeleton package was to have a Template to make a solver package. If you do
then you can personalize a copy of the skeleton package for your own use. It simplifies the process of making a package not necessarily coding the algorithm