A modeling language for mathematical programming
Management Science
CUTE: constrained and unconstrained testing environment
ACM Transactions on Mathematical Software (TOMS)
Numerical experiments with the LANCELOT package (release A) for large-scale nonlinear optimization
Mathematical Programming: Series A and B
Non-monotone trust-region algorithms for nonlinear optimization subject to convex constraints
Mathematical Programming: Series A and B
An Interior-Point Algorithm for Nonconvex Nonlinear Programming
Computational Optimization and Applications - Special issue on computational optimization—a tribute to Olvi Mangasarian, part II
Incomplete Cholesky Factorizations with Limited Memory
SIAM Journal on Scientific Computing
Trust-region methods
Lancelot: A FORTRAN Package for Large-Scale Nonlinear Optimization (Release A)
Lancelot: A FORTRAN Package for Large-Scale Nonlinear Optimization (Release A)
Test Examples for Nonlinear Programming Codes
Test Examples for Nonlinear Programming Codes
On the Solution of Equality Constrained Quadratic Programming Problems Arising in Optimization
SIAM Journal on Scientific Computing
SNOPT: An SQP Algorithm for Large-Scale Constrained Optimization
SIAM Journal on Optimization
Superlinear Convergence of Primal-Dual Interior Point Algorithms for Nonlinear Programming
SIAM Journal on Optimization
An Interior Point Algorithm for Large-Scale Nonlinear Programming
SIAM Journal on Optimization
Newton's Method for Large Bound-Constrained Optimization Problems
SIAM Journal on Optimization
SIAM Journal on Optimization
Solving the Trust-Region Subproblem using the Lanczos Method
SIAM Journal on Optimization
IEEE Computational Science & Engineering
ACM Transactions on Mathematical Software (TOMS)
Parameter range reduction for ODE models using cumulative backward differentiation formulas
Journal of Computational and Applied Mathematics
How good are projection methods for convex feasibility problems?
Computational Optimization and Applications
Quasi-Newton acceleration for equality-constrained minimization
Computational Optimization and Applications
A filter-trust-region method for simple-bound constrained optimization
Optimization Methods & Software
Convexity and Concavity Detection in Computational Graphs: Tree Walks for Convexity Assessment
INFORMS Journal on Computing
Combined heat and power economic dispatch by mesh adaptive direct search algorithm
Expert Systems with Applications: An International Journal
Convergence of a Regularized Euclidean Residual Algorithm for Nonlinear Least-Squares
SIAM Journal on Numerical Analysis
A Second Derivative SQP Method: Global Convergence
SIAM Journal on Optimization
A Second Derivative SQP Method: Local Convergence and Practical Issues
SIAM Journal on Optimization
Modified nonmonotone Armijo line search for descent method
Numerical Algorithms
ACM Transactions on Mathematical Software (TOMS)
Computing the geodesic interpolating spline
WBIR'06 Proceedings of the Third international conference on Biomedical Image Registration
Local search for constrained financial portfolio selection problems with short sellings
LION'05 Proceedings of the 5th international conference on Learning and Intelligent Optimization
How good are extrapolated bi-projection methods for linear feasibility problems?
Computational Optimization and Applications
First-order sequential convex programming using approximate diagonal QP subproblems
Structural and Multidisciplinary Optimization
On the linearization of separable quadratic constraints in dual sequential convex programs
Computers and Structures
Updating the regularization parameter in the adaptive cubic regularization algorithm
Computational Optimization and Applications
An active set feasible method for large-scale minimization problems with bound constraints
Computational Optimization and Applications
Evaluating bound-constrained minimization software
Computational Optimization and Applications
Synthetic Population Generation Without a Sample
Transportation Science
| Hi-index | 0.00 |
We describe the design of version 1.0 of GALAHAD, a library of Fortran 90 packages for large-scale nonlinear optimization. The library particularly addresses quadratic programming problems, containing both interior point and active set algorithms, as well as tools for preprocessing problems prior to solution. It also contains an updated version of the venerable nonlinear programming package, LANCELOT.