On this page:


"These days, even the most pure and abstract mathematics is in danger to be applied."
- Anonymous

Decision Tree for Nonsmooth Optimization Software

QSM is a quasi-secant solver for nonsmooth possibly nonconvex minimization by A. Bagirov and A. Ganjehlou. The user can employ either analytically calculated or approximated subgradients in his experiments (this can be done automatically by selecting one parameter). The Fortran 77 source code of QSM is available for downloading.

Previous page | Back to the start | Show a list of all solvers