Solver-o-matic
"These days, even the most pure and abstract mathematics is in danger to be applied."
- Anonymous
Decision Tree for Nonsmooth Optimization Software
It does not really matter. Both the solvers suitable for your
problem can handle both convex and nonconvex problems.
Your first choice should be Proximal
Bundle Method (MPBNGC) by M.M. Mäkelä (you need to code
difference approximations by yourself). MPBNGC usually uses relatively
small amount of iterations and, thus, it should be an efficient choice
also with difference approximations.
The code includes the constraint handling (bound constraints,
linear constraints, and nonlinear/nonsmooth constraints). MPBNGC
can also be used
via
WWW-NIMBUS -system.
Not satisfied?
