GALAHAD, a library of thread-safe Fortran 90 packages for large-scale nonlinear optimization
From MaRDI portal
Publication:5461067
DOI10.1145/962437.962438zbMath1068.90525OpenAlexW2026079992WikidataQ58185829 ScholiaQ58185829MaRDI QIDQ5461067
Nicholas I. M. Gould, Dominique Orban, Phillipe L. Toint
Publication date: 21 July 2005
Published in: ACM Transactions on Mathematical Software (Search for Journal in Brave)
Full work available at URL: http://purl.org/net/epubs/work/29788
Numerical mathematical programming methods (65K05) Large-scale problems in mathematical programming (90C06) Quadratic programming (90C20) Numerical algorithms for specific classes of architectures (65Y10) Software, source code, etc. for problems pertaining to operations research and mathematical programming (90-04)
Related Items
A two-stage active-set algorithm for bound-constrained optimization, On the numerical performance of finite-difference-based methods for derivative-free optimization, A scaled conjugate gradient method with moving asymptotes for unconstrained optimization problems, A class of descent four-term extension of the Dai-Liao conjugate gradient method based on the scaled memoryless BFGS update, A memory gradient method based on the nonmonotone technique, A superlinearly convergent hybrid algorithm for solving nonlinear programming, An augmented Lagrangian method exploiting an active-set strategy and second-order information, Primal and dual active-set methods for convex quadratic programming, A competitive inexact nonmonotone filter SQP method: convergence analysis and numerical results, LMBOPT: a limited memory method for bound-constrained optimization, An Interior-Point $$\boldsymbol{\ell_{1}}$$ -Penalty Method for Nonlinear Optimization, Non-monotone algorithm for minimization on arbitrary domains with applications to large-scale orthogonal Procrustes problem, Trajectory-following methods for large-scale degenerate convex quadratic programming, Parameter range reduction for ODE models using cumulative backward differentiation formulas, First-order sequential convex programming using approximate diagonal QP subproblems, Evaluating bound-constrained minimization software, An active set feasible method for large-scale minimization problems with bound constraints, Performance enhancement of Gauss-Newton trust-region solver for distributed Gauss-Newton optimization method, ALADIN‐—An open‐source MATLAB toolbox for distributed non‐convex optimization, Convergence and evaluation-complexity analysis of a regularized tensor-Newton method for solving nonlinear least-squares problems, On the use of the energy norm in trust-region and adaptive cubic regularization subproblems, Efficient use of parallelism in algorithmic parameter optimization applications, On the convergence of an inexact Gauss-Newton trust-region method for nonlinear least-squares problems with simple bounds, How good are projection methods for convex feasibility problems?, Shape optimization under width constraint, Convergence of derivative-free nonmonotone direct search methods for unconstrained and box-constrained mixed-integer optimization, On the Generalized Lanczos Trust-Region Method, How good are extrapolated bi-projection methods for linear feasibility problems?, Solving the Trust-Region Subproblem By a Generalized Eigenvalue Problem, The global convergence of a new mixed conjugate gradient method for unconstrained optimization, An adaptive nonmonotone trust region algorithm, A line-search algorithm inspired by the adaptive cubic regularization framework and complexity analysis, Implementable tensor methods in unconstrained convex optimization, Nonlinear optimization with GAMS /LGO, Solving Large-Scale Cubic Regularization by a Generalized Eigenvalue Problem, trlib: a vector-free implementation of the GLTR method for iterative solution of the trust region problem, Distributed optimization and control with ALADIN, An interior-point trust-funnel algorithm for nonlinear optimization, A matrix-free line-search algorithm for nonconvex optimization, Efficient solution of quadratically constrained quadratic subproblems within the mesh adaptive direct search algorithm, Globally convergent DC trust-region methods, Updating the regularization parameter in the adaptive cubic regularization algorithm, Modified nonmonotone Armijo line search for descent method, On the robustness of global optima and stationary solutions to stochastic mathematical programs with equilibrium constraints. II: Applications, Identifying superfluous constraints within an interior-point algorithm for convex quadratic programming, On second-order optimality conditions for nonlinear programming, An interior algorithm for nonlinear optimization that combines line search and trust region steps, On solving trust-region and other regularised subproblems in optimization, A Newton-like trust region method for large-scale unconstrained nonconvex minimization, A filter-trust-region method for simple-bound constrained optimization, QPLIB: a library of quadratic programming instances, Quasi-Newton acceleration for equality-constrained minimization, A nonmonotone truncated Newton-Krylov method exploiting negative curvature directions, for large scale unconstrained optimization, On the use of iterative methods in cubic regularization for unconstrained optimization, An Augmented Lagrangian Based Algorithm for Distributed NonConvex Optimization, Error estimates for iterative algorithms for minimizing regularized quadratic subproblems, Adaptive augmented Lagrangian methods: algorithms and practical numerical experience, Recognizing underlying sparsity in optimization, Trust-region and other regularisations of linear least-squares problems, Projection onto a Polyhedron that Exploits Sparsity, Null-Space Preconditioners for Saddle Point Systems, GALAHAD, A cubic regularization algorithm for unconstrained optimization using line search and nonmonotone techniques, How much do approximate derivatives hurt filter methods?, A dwindling filter line search method for unconstrained optimization, QPALM: a proximal augmented Lagrangian method for nonconvex quadratic programs, A novel self-adaptive trust region algorithm for unconstrained optimization, The Convergence of the Generalized Lanczos Trust-Region Method for the Trust-Region Subproblem, CUTEst: a constrained and unconstrained testing environment with safe threads for mathematical optimization, Methods for convex and general quadratic programming
Uses Software
