CUTEst

CUTEst: a constrained and unconstrained testing environment with safe threads. We describe the most recent evolution of our constrained and unconstrained testing environment and its accompanying SIF decoder. Code-named SIFDecode and CUTEst , these updated versions feature dynamic memory allocation, a modern thread-safe Fortran modular design, a new Matlab interface and a revised installation procedure integrated with GALAHAD.


References in zbMATH (referenced in 43 articles , 1 standard article )

Showing results 1 to 20 of 43.
Sorted by year (citations)

1 2 3 next

  1. Birgin, E.G.; Haeser, G.; Ramos, Alberto: Augmented Lagrangians with constrained subproblems and convergence to second-order stationary points (2018)
  2. Huang, Shuai; Wan, Zhong; Zhang, Jing: An extended nonmonotone line search technique for large-scale unconstrained optimization (2018)
  3. Liu, Jianjun; Xu, Xiangmin; Cui, Xuehui: An accelerated nonmonotone trust region method with adaptive trust region for unconstrained optimization (2018)
  4. Al-Baali, Mehiddin; Caliciotti, Andrea; Fasano, Giovanni; Roma, Massimo: Exploiting damped techniques for nonlinear conjugate gradient methods (2017)
  5. Andrea, Caliciotti; Giovanni, Fasano; Massimo, Roma: Novel preconditioners based on quasi-Newton updates for nonlinear conjugate gradient methods (2017)
  6. Armand, Paul; Lankoandé, Isaï: An inexact proximal regularization method for unconstrained optimization (2017)
  7. Birgin, E.G.; Martínez, J.M.: The use of quadratic regularization with a cubic descent condition for unconstrained optimization (2017)
  8. Breedveld, Sebastiaan; van den Berg, Bas; Heijmen, Ben: An interior-point implementation developed and tuned for radiation therapy treatment planning (2017)
  9. Cristofari, Andrea; De Santis, Marianna; Lucidi, Stefano; Rinaldi, Francesco: A two-stage active-set algorithm for bound-constrained optimization (2017)
  10. Fang, Xiaowei; Ni, Qin: A new derivative-free conjugate gradient method for large-scale nonlinear systems of equations (2017)
  11. Francisco, J.B.; Viloche Bazán, F.S.; Weber Mendonça, M.: Non-monotone algorithm for minimization on arbitrary domains with applications to large-scale orthogonal Procrustes problem (2017)
  12. Gill, Philip E.; Kungurtsev, Vyacheslav; Robinson, Daniel P.: A stabilized SQP method: superlinear convergence (2017)
  13. Gould, Nicholas I.M.; Robinson, Daniel P.: A dual gradient-projection method for large-scale strictly convex quadratic problems (2017)
  14. Gould, Nicholas; Scott, Jennifer: The state-of-the-art of preconditioners for sparse linear least-squares problems (2017)
  15. Kamandi, Ahmad; Amini, Keyvan; Ahookhosh, Masoud: An improved adaptive trust-region algorithm (2017)
  16. Kimiaei, Morteza; Ghaderi, Susan: A new restarting adaptive trust-region method for unconstrained optimization (2017)
  17. Sala, Ramses; Baldanzini, Niccolò; Pierini, Marco: Global optimization test problems based on random field composition (2017)
  18. Scott, Jennifer: On using Cholesky-based factorizations and regularization for solving rank-deficient sparse linear least-squares problems (2017)
  19. Scott, Jennifer; Tuma, Miroslav: Solving mixed sparse-dense linear least-squares problems by preconditioned iterative methods (2017)
  20. Zheng, Yutao; Zheng, Bing: Two new Dai-Liao-type conjugate gradient methods for unconstrained optimization problems (2017)

1 2 3 next