Primal-dual interior-point code for linear programming.
- OOQP Object-oriented
interior-point code for convex quadratic programming.
Interior point method for constrained optimization. Also effective
for unconstrained problems.
Conjugate Gradient code for solving large-scale, unconstrained, nonlinear
Software package for solving large distance geometry problems in macromolecular
Limited memory quasi-Newton method for the solution of large-scale
unconstrained optimization problems.
Limited-memory quasi-Newton code for large-scale bound-constrained
or unconstrained optimization.
Trust region Newton method for the solution of large bound-constrained
Incomplete Cholesky factorization for the solution of large-scale
trust region subproblems and positive definite
systems of linear equations.
Package for automatically generating preconditioners for the conjugate
Constrained Problems Suite
A collection of large-scale nonlinearly Constrained Optimization ProblemS.