GALAHAD

swMATH1408MaRDI QIDQ14147FDOQ14147

Author name not available (Why is that?)

Official website: https://www.galahad.rl.ac.uk/

Source code repository: https://github.com/ralna/GALAHAD

Described by source

• GALAHAD, a library of thread-safe Fortran 90 packages for large-scale nonlinear optimization

Cited In (only showing first 100 items - show all)

• CUTEst: a constrained and unconstrained testing environment with safe threads for mathematical optimization
• Solving Large-Scale Cubic Regularization by a Generalized Eigenvalue Problem
• Efficient use of parallelism in algorithmic parameter optimization applications
• QPLIB: a library of quadratic programming instances
• Modified nonmonotone Armijo line search for descent method
• A two-stage active-set algorithm for bound-constrained optimization
• Numerical methods for large-scale nonlinear optimization
• Quasi-Newton acceleration for equality-constrained minimization
• A Multidimensional Filter Algorithm for Nonlinear Equations and Nonlinear Least-Squares
• Projection onto a polyhedron that exploits sparsity
• Solving the trust-region subproblem by a generalized eigenvalue problem
• BOX-QUACAN
• Recognizing underlying sparsity in optimization
• A nonmonotone truncated Newton-Krylov method exploiting negative curvature directions, for large scale unconstrained optimization
• A dwindling filter line search method for unconstrained optimization
• Efficient solution of quadratically constrained quadratic subproblems within the mesh adaptive direct search algorithm
• Trust-region and other regularisations of linear least-squares problems
• Trajectory-following methods for large-scale degenerate convex quadratic programming
• Nonlinear optimization with GAMS /LGO
• An active set feasible method for large-scale minimization problems with bound constraints
• Primal and dual active-set methods for convex quadratic programming
• Globally convergent DC trust-region methods
• On solving trust-region and other regularised subproblems in optimization
• BPMPD
• MA57
• Updating the regularization parameter in the adaptive cubic regularization algorithm
• TENSOLVE
• LSTRS
• CG_DESCENT
• QP
• TRON
• Filtrane
• NLPHOPDM
• QPSchur
• CQP
• GQTPAR
• CERR
• QPOPT
• SQOPT
• On the generalized Lanczos trust-region method
• ZQPCVX
• SCPIP
• CUTEst
• AD01
• QPLIB2014
• HSL_MA97
• OPTPDE
• LUMOD
• LUSOL
• LINUOA
• pySLEQP
• DQP
• Algorithm 566
• RALFit
• PRRMD
• heapsort
• How good are extrapolated bi-projection methods for linear feasibility problems?
• CUTEr and SifDec
• An augmented Lagrangian based algorithm for distributed nonconvex optimization
• A matrix-free line-search algorithm for nonconvex optimization
• HSL-VF05
• Non-monotone algorithm for minimization on arbitrary domains with applications to large-scale orthogonal Procrustes problem
• LMBOPT: a limited memory method for bound-constrained optimization
• On the convergence of an inexact Gauss-Newton trust-region method for nonlinear least-squares problems with simple bounds
• Convergence and evaluation-complexity analysis of a regularized tensor-Newton method for solving nonlinear least-squares problems
• On Augmented Lagrangian Methods with General Lower-Level Constraints
• An augmented Lagrangian method exploiting an active-set strategy and second-order information
• Parameter range reduction for ODE models using cumulative backward differentiation formulas
• LADEL
• ALADIN
• SolverBenchmark.jl
• An interior algorithm for nonlinear optimization that combines line search and trust region steps
• How good are projection methods for convex feasibility problems?
• Evaluating bound-constrained minimization software
• Algorithm 873
• A Filter-Trust-Region Method for Unconstrained Optimization
• An interior-point trust-funnel algorithm for nonlinear optimization
• On the robustness of global optima and stationary solutions to stochastic mathematical programs with equilibrium constraints. II: Applications
• First-order sequential convex programming using approximate diagonal QP subproblems
• The State-of-the-Art of Preconditioners for Sparse Linear Least-Squares Problems
• Methods for convex and general quadratic programming
• On the use of iterative methods in cubic regularization for unconstrained optimization
• \texttt{trlib}: a vector-free implementation of the GLTR method for iterative solution of the trust region problem
• QPALM: a proximal augmented Lagrangian method for nonconvex quadratic programs
• A dual gradient-projection method for large-scale strictly convex quadratic problems
• Error estimates for iterative algorithms for minimizing regularized quadratic subproblems
• A line-search algorithm inspired by the adaptive cubic regularization framework and complexity analysis
• A novel self-adaptive trust region algorithm for unconstrained optimization
• A Newton-like trust region method for large-scale unconstrained nonconvex minimization
• An adaptive nonmonotone trust region algorithm
• Implementable tensor methods in unconstrained convex optimization
• The convergence of the generalized Lanczos trust-region method for the trust-region subproblem
• Shape optimization under width constraint
• The global convergence of a new mixed conjugate gradient method for unconstrained optimization
• A competitive inexact nonmonotone filter SQP method: convergence analysis and numerical results
• How much do approximate derivatives hurt filter methods?
• On the use of the energy norm in trust-region and adaptive cubic regularization subproblems
• On the numerical performance of finite-difference-based methods for derivative-free optimization
• An active-set algorithm for nonlinear programming using parametric linear programming
• Performance enhancement of Gauss-Newton trust-region solver for distributed Gauss-Newton optimization method

This page was built for software: GALAHAD