GALAHAD

We describe the design of version 1.0 of GALAHAD, a library of Fortran 90 packages for largescale 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.


References in zbMATH (referenced in 38 articles , 1 standard article )

Showing results 1 to 20 of 38.
Sorted by year (citations)

1 2 next

  1. Hager, William W.; Zhang, Hongchao: Projection onto a polyhedron that exploits sparsity (2016)
  2. Houska, Boris; Frasch, Janick; Diehl, Moritz: An augmented Lagrangian based algorithm for distributed nonconvex optimization (2016)
  3. Pestana, Jennifer; Rees, Tyrone: Null-space preconditioners for saddle point systems (2016)
  4. Bianconcini, Tommaso; Liuzzi, Giampaolo; Morini, Benedetta; Sciandrone, Marco: On the use of iterative methods in cubic regularization for unconstrained optimization (2015)
  5. Chen, Yannan; Sun, Wenyu: A dwindling filter line search method for unconstrained optimization (2015)
  6. Gill, Philip E.; Wong, Elizabeth: Methods for convex and general quadratic programming (2015)
  7. Gould, Nicholas I.M.; Orban, Dominique; Toint, Philippe L.: CUTEst: a constrained and unconstrained testing environment with safe threads for mathematical optimization (2015)
  8. Le Thi, Hoai An; Huynh Van Ngai; Dinh, Tao Pham; Vaz, A.Ismael F.; Vicente, L.N.: Globally convergent DC trust-region methods (2014)
  9. Audet, C.; Dang, C.-K.; Orban, D.: Efficient use of parallelism in algorithmic parameter optimization applications (2013)
  10. Gould, Nicholas I.M.; Orban, Dominique; Robinson, Daniel P.: Trajectory-following methods for large-scale degenerate convex quadratic programming (2013)
  11. Oudet, Édouard: Shape optimization under width constraint (2013)
  12. Porcelli, Margherita: On the convergence of an inexact Gauss-Newton trust-region method for nonlinear least-squares problems with simple bounds (2013)
  13. Weiwei, Yang; Yueting, Yang; Chenhui, Zhang; Mingyuan, Cao: A Newton-like trust region method for large-scale unconstrained nonconvex minimization (2013)
  14. Birgin, Ernesto G.; Gentil, Jan M.: Evaluating bound-constrained minimization software (2012)
  15. De Santis, M.; Di Pillo, G.; Lucidi, S.: An active set feasible method for large-scale minimization problems with bound constraints (2012)
  16. Etman, L.F.P.; Groenwold, Albert A.; Rooda, J.E.: First-order sequential convex programming using approximate diagonal QP subproblems (2012)
  17. Gould, Nicholas I.M.: How good are extrapolated bi-projection methods for linear feasibility problems? (2012)
  18. Gould, N.I.M.; Porcelli, M.; Toint, P.L.: Updating the regularization parameter in the adaptive cubic regularization algorithm (2012)
  19. Yueting, Yang; Mingyuan, Cao: The global convergence of a new mixed conjugate gradient method for unconstrained optimization (2012)
  20. Shi, Zhenjun; Wang, Shengquan: Modified nonmonotone Armijo line search for descent method (2011)

1 2 next