GALAHAD
From MaRDI portal
Software:14147
swMATH1408MaRDI QIDQ14147FDOQ14147
Author name not available (Why is that?)
Cited In (65)
- A competitive inexact nonmonotone filter SQP method: convergence analysis and numerical results
- How much do approximate derivatives hurt filter methods?
- On the numerical performance of finite-difference-based methods for derivative-free optimization
- 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
- 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 Multidimensional Filter Algorithm for Nonlinear Equations and Nonlinear Least-Squares
- A novel self-adaptive trust region algorithm for unconstrained optimization
- Projection onto a polyhedron that exploits sparsity
- Recognizing underlying sparsity in optimization
- On the Generalized Lanczos Trust-Region Method
- 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
- 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
- The Convergence of the Generalized Lanczos Trust-Region Method for the Trust-Region Subproblem
- An adaptive nonmonotone trust region algorithm
- An active set feasible method for large-scale minimization problems with bound constraints
- Primal and dual active-set methods for convex quadratic programming
- trlib: a vector-free implementation of the GLTR method for iterative solution of the trust region problem
- Globally convergent DC trust-region methods
- Solving the Trust-Region Subproblem By a Generalized Eigenvalue Problem
- On solving trust-region and other regularised subproblems in optimization
- Updating the regularization parameter in the adaptive cubic regularization algorithm
- Implementable tensor methods in unconstrained convex optimization
- 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
- 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
- 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
- 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
- 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?
- On the use of the energy norm in trust-region and adaptive cubic regularization subproblems
- 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
- QPALM: a proximal augmented Lagrangian method for nonconvex quadratic programs
- 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
- Null-space preconditioners for saddle point systems
- A dual gradient-projection method for large-scale strictly convex quadratic problems
This page was built for software: GALAHAD