The following pages link to GALAHAD (Q14147):
Displaying 50 items.
- Primal and dual active-set methods for convex quadratic programming (Q312693) (← links)
- Non-monotone algorithm for minimization on arbitrary domains with applications to large-scale orthogonal Procrustes problem (Q343664) (← links)
- First-order sequential convex programming using approximate diagonal QP subproblems (Q381733) (← links)
- How good are extrapolated bi-projection methods for linear feasibility problems? (Q429520) (← links)
- An interior-point trust-funnel algorithm for nonlinear optimization (Q507313) (← links)
- Modified nonmonotone Armijo line search for descent method (Q535246) (← links)
- Updating the regularization parameter in the adaptive cubic regularization algorithm (Q694543) (← links)
- A nonmonotone truncated Newton-Krylov method exploiting negative curvature directions, for large scale unconstrained optimization (Q732778) (← links)
- Parameter range reduction for ODE models using cumulative backward differentiation formulas (Q875157) (← links)
- On the robustness of global optima and stationary solutions to stochastic mathematical programs with equilibrium constraints. II: Applications (Q965054) (← links)
- On solving trust-region and other regularised subproblems in optimization (Q977328) (← links)
- Quasi-Newton acceleration for equality-constrained minimization (Q1001193) (← links)
- Recognizing underlying sparsity in optimization (Q1013977) (← links)
- Trust-region and other regularisations of linear least-squares problems (Q1014897) (← links)
- On the use of the energy norm in trust-region and adaptive cubic regularization subproblems (Q1694391) (← links)
- A line-search algorithm inspired by the adaptive cubic regularization framework and complexity analysis (Q1730832) (← links)
- Efficient solution of quadratically constrained quadratic subproblems within the mesh adaptive direct search algorithm (Q1754299) (← links)
- Evaluating bound-constrained minimization software (Q1928747) (← links)
- An active set feasible method for large-scale minimization problems with bound constraints (Q1928749) (← links)
- Efficient use of parallelism in algorithmic parameter optimization applications (Q1941182) (← links)
- On the convergence of an inexact Gauss-Newton trust-region method for nonlinear least-squares problems with simple bounds (Q1941187) (← links)
- Shape optimization under width constraint (Q1943659) (← links)
- The global convergence of a new mixed conjugate gradient method for unconstrained optimization (Q1952993) (← links)
- A dual gradient-projection method for large-scale strictly convex quadratic problems (Q2012229) (← links)
- A Newton-like trust region method for large-scale unconstrained nonconvex minimization (Q2015579) (← links)
- QPALM: a proximal augmented Lagrangian method for nonconvex quadratic programs (Q2088967) (← links)
- An augmented Lagrangian method exploiting an active-set strategy and second-order information (Q2139257) (← links)
- LMBOPT: a limited memory method for bound-constrained optimization (Q2146448) (← links)
- Performance enhancement of Gauss-Newton trust-region solver for distributed Gauss-Newton optimization method (Q2185999) (← links)
- Implementable tensor methods in unconstrained convex optimization (Q2227532) (← links)
- Globally convergent DC trust-region methods (Q2250078) (← links)
- QPLIB: a library of quadratic programming instances (Q2281448) (← links)
- A novel self-adaptive trust region algorithm for unconstrained optimization (Q2336586) (← links)
- CUTEst: a constrained and unconstrained testing environment with safe threads for mathematical optimization (Q2352415) (← links)
- Methods for convex and general quadratic programming (Q2356335) (← links)
- A two-stage active-set algorithm for bound-constrained optimization (Q2359771) (← links)
- Trajectory-following methods for large-scale degenerate convex quadratic programming (Q2392932) (← links)
- Convergence and evaluation-complexity analysis of a regularized tensor-Newton method for solving nonlinear least-squares problems (Q2419539) (← links)
- How good are projection methods for convex feasibility problems? (Q2427393) (← links)
- Nonlinear optimization with GAMS /LGO (Q2460112) (← links)
- An interior algorithm for nonlinear optimization that combines line search and trust region steps (Q2492700) (← links)
- On the use of iterative methods in cubic regularization for unconstrained optimization (Q2515064) (← links)
- An Augmented Lagrangian Based Algorithm for Distributed NonConvex Optimization (Q2805706) (← links)
- Projection onto a Polyhedron that Exploits Sparsity (Q2817841) (← links)
- Null-Space Preconditioners for Saddle Point Systems (Q2818269) (← links)
- Solving the Trust-Region Subproblem By a Generalized Eigenvalue Problem (Q2967610) (← links)
- An active-set algorithm for nonlinear programming using parametric linear programming (Q3093034) (← links)
- The State-of-the-Art of Preconditioners for Sparse Linear Least-Squares Problems (Q3133587) (← links)
- How much do approximate derivatives hurt filter methods? (Q3398592) (← links)
- Numerical methods for large-scale nonlinear optimization (Q3430648) (← links)
