Cited in
(only showing first 100 items - show all)- A dual gradient-projection method for large-scale strictly convex quadratic problems
- BPMPD
- HSL
- LANCELOT
- LDL
- MA57
- NEWUOA
- QMRPACK
- SPG
- TNPACK
- PREQN
- GALAHAD
- NOMAD
- L-BFGS
- LIBOPT
- HOPSPACK
- testenv
- QPA
- BOBYQA
- LSTRS
- CG_DESCENT
- ipfilter
- GPDT
- OOQP
- IMFIL
- NewtonKKTqp
- OPALQP
- TRON
- ALGENCAN
- TANGO
- MINQ
- Filtrane
- Algorithm 500
- IPM
- CG+
- SDBOX
- SDPEN
- minpack
- SNOBFIT
- SOLNP
- tn
- ve08
- VXQR1
- MUSCOP
- QPSchur
- WSMP
- MIQR
- GQTPAR
- MultiMin
- pyMDO
- Algorithm 738
- QPOPT
- UOBYQA
- SQOPT
- NOWPAC
- MSS
- SCALCG
- CUTE
- OPAL
- ZQPCVX
- CGOPT
- LCOBYQA
- WORHP
- QPLIB2014
- QL
- HSL_MA97
- OPTPDE
- LUMOD
- LSMR
- HSL_MA87
- HSL_MI28
- MINRES
- Packmol
- LINCOA
- SYM-ILDL
- HSL_MA77
- LUSOL
- DuQuad
- LINUOA
- CIMGS
- pySLEQP
- CurveLP
- ACGSSV
- Optimization Test Environment
- MDTri
- NAPHEAP
- TROTS
- NLP.py
- PyKrylov
- DQP
- POSITRONFIT
- MVF
- CHFACT
- DFO-GN
- Py-BOBYQA
- DecFP
- DoubleDouble.jl
- DoubleFloats.jl
- NLPModelsIpopt.jl
- \texttt{trlib}: a vector-free implementation of the GLTR method for iterative solution of the trust region problem
This page was built for software: CUTEst
