GALAHAD
From MaRDI portal
Cited in
(only showing first 100 items - show all)- QPALM: a proximal augmented Lagrangian method for nonconvex quadratic programs
- \texttt{trlib}: a vector-free implementation of the GLTR method for iterative solution of the trust region problem
- Performance enhancement of Gauss-Newton trust-region solver for distributed Gauss-Newton optimization method
- An active-set algorithm for nonlinear programming using parametric linear programming
- Null-space preconditioners for saddle point systems
- A dual gradient-projection method for large-scale strictly convex quadratic problems
- Modified nonmonotone Armijo line search for descent method
- Efficient use of parallelism in algorithmic parameter optimization applications
- CUTEst: a constrained and unconstrained testing environment with safe threads for mathematical optimization
- QPLIB: a library of quadratic programming instances
- Solving Large-Scale Cubic Regularization by a Generalized Eigenvalue Problem
- 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 two-stage active-set algorithm for bound-constrained optimization
- Numerical methods for large-scale nonlinear optimization
- Quasi-Newton acceleration for equality-constrained minimization
- A novel self-adaptive trust region algorithm for unconstrained optimization
- A Multidimensional Filter Algorithm for Nonlinear Equations and Nonlinear Least-Squares
- Projection onto a polyhedron that exploits sparsity
- Recognizing underlying sparsity in optimization
- Solving the trust-region subproblem by a generalized eigenvalue problem
- A nonmonotone truncated Newton-Krylov method exploiting negative curvature directions, for large scale unconstrained optimization
- Efficient solution of quadratically constrained quadratic subproblems within the mesh adaptive direct search algorithm
- A dwindling filter line search method for unconstrained optimization
- A Newton-like trust region method for large-scale unconstrained nonconvex minimization
- 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
- An adaptive nonmonotone trust region algorithm
- Primal and dual active-set methods for convex quadratic programming
- Globally convergent DC trust-region methods
- BPMPD
- LANCELOT
- MA57
- TENSOLVE
- CUTEr
- QPA
- LSTRS
- CG_DESCENT
- QP
- TRON
- Filtrane
- NLPHOPDM
- QPSchur
- CQP
- GQTPAR
- CERR
- QPOPT
- SQOPT
- ZQPCVX
- SCPIP
- CUTEst
- AD01
- QPLIB2014
- HSL_MA97
- OPTPDE
- LUMOD
- LUSOL
- LINUOA
- pySLEQP
- DQP
- Algorithm 566
- RALFit
- PRRMD
- heapsort
- HSL-VF05
- On solving trust-region and other regularised subproblems in optimization
- Updating the regularization parameter in the adaptive cubic regularization algorithm
- SIFDecode
- MultivariateOrthogonalPolynomials.jl
- Implementable tensor methods in unconstrained convex optimization
- On the generalized Lanczos trust-region method
- How good are extrapolated bi-projection methods for linear feasibility problems?
- An augmented Lagrangian based algorithm for distributed nonconvex optimization
- CUTEr and SifDec
- The convergence of the generalized Lanczos trust-region method for the trust-region subproblem
- Non-monotone algorithm for minimization on arbitrary domains with applications to large-scale orthogonal Procrustes problem
- BOX-QUACAN
- A matrix-free line-search algorithm for nonconvex optimization
- LMBOPT: a limited memory method for bound-constrained optimization
- Shape optimization under width constraint
- 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
- An augmented Lagrangian method exploiting an active-set strategy and second-order information
- On Augmented Lagrangian Methods with General Lower-Level Constraints
- Parameter range reduction for ODE models using cumulative backward differentiation formulas
- LADEL
- ALADIN
- SolverBenchmark.jl
- The global convergence of a new mixed conjugate gradient method for unconstrained optimization
- An interior algorithm for nonlinear optimization that combines line search and trust region steps
- How good are projection methods for convex feasibility problems?
- A competitive inexact nonmonotone filter SQP method: convergence analysis and numerical results
- On the use of the energy norm in trust-region and adaptive cubic regularization subproblems
- How much do approximate derivatives hurt filter methods?
- Evaluating bound-constrained minimization software
- On the numerical performance of finite-difference-based methods for derivative-free optimization
- Algorithm 873
- An interior-point trust-funnel algorithm for nonlinear optimization
This page was built for software: GALAHAD
