Modulopt -- bound constrained optimization

Solvers of bound constrained 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

N2QP1 (*) 0.9

medium-scale
strictly convex quadratic
lower bounds only

Active set technique

Gradient projection

Cholesky factorizations
Fortran 77 DC

M2FC1

nonconvex nondifferentiable
subgradients available

bundle method
Fortran 77 DC

M2QN1 N2QN1 3.0

medium-scale
first derivatives available

Active set technique

BFGS updates
Fortran 77 DC

Name [nickname] of the code	Type of problem	Algorithmic features	Language	Communication Protocol
N2QP1 (*) 0.9	medium-scale strictly convex quadratic lower bounds only	Active set technique Gradient projection Cholesky factorizations	Fortran 77	DC
M2FC1	nonconvex nondifferentiable subgradients available	bundle method	Fortran 77	DC
M2QN1 N2QN1 3.0	medium-scale first derivatives available	Active set technique BFGS updates	Fortran 77	DC