CUTEr is a versatile testing environment for optimization and linear algebra solvers. The package contains a collection of test problems, along with Fortran 77, Fortran 90/95 and Matlab tools intended to help developers design, compare and improve new and existing solvers. The test problems provided are written in so-called Standard Input Format (SIF). A decoder to convert from this format into well-defined Fortran 77 and data files is available as a separate package. Once translated, these files may be manipulated to provide tools suitable for testing optimization packages. Ready-to-use interfaces to existing packages, such as MINOS, SNOPT, filterSQP, Knitro, and more, are provided. See the interfaces section for a complete list.

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

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

1 2 3 ... 24 25 26 next

  1. Li, Min: A three term Polak-Ribière-Polyak conjugate gradient method close to the memoryless BFGS quasi-Newton method (2020)
  2. Aminifard, Zohre; Babaie-Kafaki, Saman: An optimal parameter choice for the Dai-Liao family of conjugate gradient methods by avoiding a direction of the maximum magnification by the search direction matrix (2019)
  3. Aminifard, Zohre; Babaie-Kafaki, Saman: A modified descent Polak-Ribiére-Polyak conjugate gradient method with global convergence property for nonconvex functions (2019)
  4. Jiang, Xianzhen; Jian, Jinbao: Improved Fletcher-Reeves and Dai-Yuan conjugate gradient methods with the strong Wolfe line search (2019)
  5. Khoshgam, Zahra; Ashrafi, Ali: A new hybrid conjugate gradient method for large-scale unconstrained optimization problem with non-convex objective function (2019)
  6. Liu, Hongwei; Liu, Zexian: An efficient Barzilai-Borwein conjugate gradient method for unconstrained optimization (2019)
  7. Petra, Cosmin G.; Chiang, Naiyuan; Anitescu, Mihai: A structured quasi-Newton algorithm for optimizing with incomplete Hessian information (2019)
  8. Rezaee, Saeed; Babaie-Kafaki, Saman: An adaptive nonmonotone trust region algorithm (2019)
  9. Rezaee, Saeed; Babaie-Kafaki, Saman: An adaptive nonmonotone trust region method based on a modified scalar approximation of the Hessian in the successive quadratic subproblems (2019)
  10. Vlček, Jan; Lukšan, Ladislav: A limited-memory optimization method using the infinitely many times repeated BNS update and conjugate directions (2019)
  11. Vlček, Jan; Lukšan, Ladislav: Properties of the block BFGS update and its application to the limited-memory block BNS method for unconstrained minimization (2019)
  12. Wang, Guoqiang; Yu, Bo: PAL-Hom method for QP and an application to LP (2019)
  13. Zhang, Keke; Liu, Hongwei; Liu, Zexian: A new Dai-Liao conjugate gradient method with optimal parameter choice (2019)
  14. Zhou, W.; Akrotirianakis, I. G.; Yektamaram, S.; Griffin, J. D.: A matrix-free line-search algorithm for nonconvex optimization (2019)
  15. Ali, M. Montaz; Oliphant, Terry-Leigh: A trajectory-based method for constrained nonlinear optimization problems (2018)
  16. Amaioua, Nadir; Audet, Charles; Conn, Andrew R.; Le Digabel, Sébastien: Efficient solution of quadratically constrained quadratic subproblems within the mesh adaptive direct search algorithm (2018)
  17. Andrei, Neculai: A double parameter scaled BFGS method for unconstrained optimization (2018)
  18. Andrei, Neculai: A Dai-Liao conjugate gradient algorithm with clustering of eigenvalues (2018)
  19. Audet, Charles; Tribes, Christophe: Mesh-based Nelder-Mead algorithm for inequality constrained optimization (2018)
  20. Babaie-Kafaki, Saman: A monotone preconditioned gradient method based on banded tridiagonal inverse Hessian approximation (2018)

1 2 3 ... 24 25 26 next