CUTEst
From MaRDI portal
Cited in
(only showing first 100 items - show all)- BPMPD
- HSL
- LANCELOT
- LDL
- MA57
- adaQN
- NEWUOA
- LADEL
- QMRPACK
- LMBOPT
- SolverBenchmark.jl
- Krylov.jl
- SPG
- TNPACK
- PREQN
- GALAHAD
- NOMAD
- L-BFGS
- A progressive barrier derivative-free trust-region algorithm for constrained optimization
- testenv
- LIBOPT
- A Schur complement approach to preconditioning sparse linear least-squares problems with some dense rows
- HOPSPACK
- Best practices for comparing optimization algorithms
- Speeding up the convergence of the Polyak's heavy ball algorithm
- QPA
- A primal-dual augmented Lagrangian penalty-interior-point filter line search algorithm
- Robust optimization of noisy blackbox problems using the mesh adaptive direct search algorithm
- An extended nonmonotone line search technique for large-scale unconstrained optimization
- Two new Dai-Liao-type conjugate gradient methods for unconstrained optimization problems
- An interior-point implementation developed and tuned for radiation therapy treatment planning
- TRON
- A new restarting adaptive trust-region method for unconstrained optimization
- LSTRS
- OOQP
- TANGO
- BOBYQA
- ipfilter
- GPDT
- CG_DESCENT
- IMFIL
- NewtonKKTqp
- OPALQP
- MINQ
- SDBOX
- tn
- ve08
- SDPEN
- SOLNP
- ALGENCAN
- A line-search algorithm inspired by the adaptive cubic regularization framework and complexity analysis
- IPM
- Filtrane
- VXQR1
- Algorithm 500
- CG+
- SNOBFIT
- minpack
- A new augmented Lagrangian method for equality constrained optimization with simple unconstrained subproblem
- A new regularized quasi-Newton method for unconstrained optimization
- MUSCOP
- WSMP
- QPSchur
- MIQR
- GQTPAR
- MultiMin
- pyMDO
- UOBYQA
- On the solution of linearly constrained optimization problems by means of barrier algorithms
- QPOPT
- SQOPT
- Algorithm 738
- A dual gradient-projection method for large-scale strictly convex quadratic problems
- High-order evaluation complexity for convexly-constrained optimization with non-Lipschitzian group sparsity terms
- Issues on the use of a modified bunch and Kaufman decomposition for large scale Newton's equation
- Stochastic mesh adaptive direct search for blackbox optimization using probabilistic estimates
- Approximate solution of system of equations arising in interior-point methods for bound-constrained optimization
- Secant update generalized version of PSB: a new approach
- An accelerated first-order method with complexity analysis for solving cubic regularization subproblems
- Exact linesearch limited-memory quasi-Newton methods for minimizing a quadratic function
- SCALCG
- ZQPCVX
- NOWPAC
- MSS
- An infeasible interior-point arc-search algorithm for nonlinear constrained optimization
- Block preconditioners for linear systems in interior point methods for convex constrained optimization
- Global convergence of a modified spectral three-term CG algorithm for nonconvex unconstrained optimization problems
- QPALM: a proximal augmented Lagrangian method for nonconvex quadratic programs
- Diagonal BFGS updates and applications to the limited memory BFGS method
- A derivative-free exact penalty algorithm: basic ideas, convergence theory and computational studies
- An active-set algorithm for norm constrained quadratic problems
- An augmented Lagrangian method exploiting an active-set strategy and second-order information
- LMBOPT: a limited memory method for bound-constrained optimization
- Efficient unconstrained black box optimization
- Limited-memory BFGS with displacement aggregation
- A null-space approach for large-scale symmetric saddle point systems with a small and non zero \((2, 2)\) block
- An active set trust-region method for bound-constrained optimization
- Learning to steer nonlinear interior-point methods
- A note on solving nonlinear optimization problems in variable precision
- A regularization method for constrained nonlinear least squares
This page was built for software: CUTEst
