Modulopt -- unconstrained optimization

Solvers of unconstrained optimization problems

Click on the code name in the first column to access its page and to have more information on the solver, including the description on how to get it.

Name
[nickname]
of the code Type of problem Algorithmic features Language Communication
Protocol

N1CV2

convex nondifferentiable
subgradients available

bundle method
Fortran 77 DC

M1CG1 1.1c

large-scale convex quadratic
Hessian-vector products available

preconditioned Fletcher-Reeves conjugate gradient
generates a (limited memory) BFGS preconditioner
Fortran 77 DC

M1QN3 3.3

large-scale nonlinear
first derivatives available

line-search
limited memory BFGS updates
Fortran 77 DC - RC

Name [nickname] of the code	Type of problem	Algorithmic features	Language	Communication Protocol
N1CV2	convex nondifferentiable subgradients available	bundle method	Fortran 77	DC
M1CG1 1.1c	large-scale convex quadratic Hessian-vector products available	preconditioned Fletcher-Reeves conjugate gradient generates a (limited memory) BFGS preconditioner	Fortran 77	DC
M1QN3 3.3	large-scale nonlinear first derivatives available	line-search limited memory BFGS updates	Fortran 77	DC - RC