GALAHAD

swMATH1408MaRDI QIDQ14147

No author found.

Described by source

No records found.

Related Items (65)

A two-stage active-set algorithm for bound-constrained optimization ⋮ On the numerical performance of finite-difference-based methods for derivative-free optimization ⋮ 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 ⋮ 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 ⋮ 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 ⋮ 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 ⋮ On Augmented Lagrangian Methods with General Lower-Level Constraints ⋮ A line-search algorithm inspired by the adaptive cubic regularization framework and complexity analysis ⋮ Implementable tensor methods in unconstrained convex optimization ⋮ Algorithm 873 ⋮ 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 ⋮ An interior-point trust-funnel algorithm for nonlinear optimization ⋮ A matrix-free line-search algorithm for nonconvex optimization ⋮ A Multidimensional Filter Algorithm for Nonlinear Equations and Nonlinear Least-Squares ⋮ 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 ⋮ A dual gradient-projection method for large-scale strictly convex quadratic problems ⋮ 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 ⋮ 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 ⋮ CUTEr and SifDec ⋮ Recognizing underlying sparsity in optimization ⋮ Trust-region and other regularisations of linear least-squares problems ⋮ A Filter-Trust-Region Method for Unconstrained Optimization ⋮ Projection onto a Polyhedron that Exploits Sparsity ⋮ Null-Space Preconditioners for Saddle Point Systems ⋮ An active-set algorithm for nonlinear programming using parametric linear programming ⋮ 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 ⋮ Numerical methods for large-scale nonlinear optimization ⋮ The State-of-the-Art of Preconditioners for Sparse Linear Least-Squares Problems ⋮ CUTEst: a constrained and unconstrained testing environment with safe threads for mathematical optimization ⋮ Methods for convex and general quadratic programming

This page was built for software: GALAHAD