Pages that link to "Item:Q2352415"
From MaRDI portal
The following pages link to CUTEst: a constrained and unconstrained testing environment with safe threads for mathematical optimization (Q2352415):
Displaying 50 items.
- CUTEst (Q23829) (← links)
- A limited memory quasi-Newton trust-region method for box constrained optimization (Q269370) (← links)
- 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)
- Sequential quadratic programming methods for parametric nonlinear optimization (Q480928) (← links)
- Primal-dual active-set methods for large-scale optimization (Q493264) (← links)
- An improved adaptive trust-region algorithm (Q519772) (← links)
- An inexact proximal regularization method for unconstrained optimization (Q522090) (← links)
- Global optimization test problems based on random field composition (Q523165) (← links)
- Novel preconditioners based on quasi-Newton updates for nonlinear conjugate gradient methods (Q523183) (← links)
- A stabilized SQP method: superlinear convergence (Q526843) (← links)
- A new class of conjugate gradient methods for unconstrained smooth optimization and absolute value equations (Q667882) (← links)
- Augmented Lagrangians with constrained subproblems and convergence to second-order stationary points (Q683332) (← links)
- An accelerated nonmonotone trust region method with adaptive trust region for unconstrained optimization (Q683334) (← links)
- Exploiting damped techniques for nonlinear conjugate gradient methods (Q684134) (← links)
- A progressive barrier derivative-free trust-region algorithm for constrained optimization (Q1616931) (← links)
- A Schur complement approach to preconditioning sparse linear least-squares problems with some dense rows (Q1625762) (← links)
- Best practices for comparing optimization algorithms (Q1642983) (← links)
- A primal-dual augmented Lagrangian penalty-interior-point filter line search algorithm (Q1650852) (← links)
- Robust optimization of noisy blackbox problems using the mesh adaptive direct search algorithm (Q1653265) (← links)
- An extended nonmonotone line search technique for large-scale unconstrained optimization (Q1675990) (← links)
- Two new Dai-Liao-type conjugate gradient methods for unconstrained optimization problems (Q1686668) (← links)
- A new restarting adaptive trust-region method for unconstrained optimization (Q1689065) (← links)
- A line-search algorithm inspired by the adaptive cubic regularization framework and complexity analysis (Q1730832) (← links)
- A new augmented Lagrangian method for equality constrained optimization with simple unconstrained subproblem (Q1784887) (← links)
- A new regularized quasi-Newton method for unconstrained optimization (Q1800450) (← links)
- On the solution of linearly constrained optimization problems by means of barrier algorithms (Q1979175) (← links)
- High-order evaluation complexity for convexly-constrained optimization with non-Lipschitzian group sparsity terms (Q2020600) (← links)
- Issues on the use of a modified bunch and Kaufman decomposition for large scale Newton's equation (Q2023682) (← links)
- Stochastic mesh adaptive direct search for blackbox optimization using probabilistic estimates (Q2028452) (← links)
- Approximate solution of system of equations arising in interior-point methods for bound-constrained optimization (Q2028460) (← links)
- Secant update generalized version of PSB: a new approach (Q2028481) (← links)
- An accelerated first-order method with complexity analysis for solving cubic regularization subproblems (Q2044484) (← links)
- Exact linesearch limited-memory quasi-Newton methods for minimizing a quadratic function (Q2044499) (← links)
- An infeasible interior-point arc-search algorithm for nonlinear constrained optimization (Q2066199) (← links)
- Block preconditioners for linear systems in interior point methods for convex constrained optimization (Q2084581) (← links)
- QPALM: a proximal augmented Lagrangian method for nonconvex quadratic programs (Q2088967) (← links)
- Diagonal BFGS updates and applications to the limited memory BFGS method (Q2114834) (← links)
- A derivative-free exact penalty algorithm: basic ideas, convergence theory and computational studies (Q2115032) (← links)
- A new nonmonotone adaptive trust region algorithm. (Q2128413) (← links)
- An active-set algorithm for norm constrained quadratic problems (Q2133422) (← 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)
- Efficient unconstrained black box optimization (Q2146451) (← links)
- Limited-memory BFGS with displacement aggregation (Q2149548) (← links)
- Iteratively sampling scheme for stochastic optimization with variable number sample path (Q2157906) (← links)
- A null-space approach for large-scale symmetric saddle point systems with a small and non zero \((2, 2)\) block (Q2159428) (← links)
- An active set trust-region method for bound-constrained optimization (Q2169274) (← links)
- Learning to steer nonlinear interior-point methods (Q2175369) (← links)
- A note on solving nonlinear optimization problems in variable precision (Q2191797) (← links)
