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 19 articles , 1 standard article )

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

  1. Ahookhosh, Masoud; Ghaderi, Susan: Two globally convergent nonmonotone trust-region methods for unconstrained optimization (2016)
  2. Birgin, E.G.; Bueno, L.F.; Martínez, J.M.: Sequential equality-constrained optimization for nonlinear programming (2016)
  3. Forsgren, Anders; Gill, Philip E.; Wong, Elizabeth: Primal and dual active-set methods for convex quadratic programming (2016)
  4. Karas, Elizabeth W.; Santos, Sandra A.; Svaiter, Benar F.: Algebraic rules for computing the regularization parameter of the Levenberg-Marquardt method (2016)
  5. Pestana, Jennifer; Rees, Tyrone: Null-space preconditioners for saddle point systems (2016)
  6. Potschka, Andreas: Backward step control for global Newton-type methods (2016)
  7. Rahpeymaii, Farzad; Kimiaei, Morteza; Bagheri, Alireza: A limited memory quasi-Newton trust-region method for box constrained optimization (2016)
  8. Scott, Jennifer; Tuma, Miroslav: Preconditioning of linear least squares by robust incomplete factorization for implicitly held normal equations (2016)
  9. Tröltzsch, Anke: A sequential quadratic programming algorithm for equality-constrained optimization without derivatives (2016)
  10. Audet, Charles; Le Digabel, Sébastien; Peyrega, Mathilde: Linear equalities in blackbox optimization (2015)
  11. Bellavia, Stefania; De Simone, Valentina; di Serafino, Daniela; Morini, Benedetta: Updating constraint preconditioners for KKT systems in quadratic programming via low-rank corrections (2015)
  12. Birgin, E. G.; Bueno, L. F.; Martínez, J. M.: Assessing the reliability of general-purpose inexact restoration methods (2015)
  13. Gill, Philip E.; Wong, Elizabeth: Methods for convex and general quadratic programming (2015)
  14. Gould, Nicholas I.M.; Loh, Yueling; Robinson, Daniel P.: A nonmonotone filter SQP method: local convergence and numerical results (2015)
  15. Gould, Nicholas I.M.; Orban, Dominique; Toint, Philippe L.: CUTEst: a constrained and unconstrained testing environment with safe threads for mathematical optimization (2015)
  16. Hungerländer, P.; Rendl, F.: A feasible active set method for strictly convex quadratic problems with simple bounds (2015)
  17. Mohy-ud-Din, Hassan; Robinson, Daniel P.: A solver for nonconvex bound-constrained quadratic optimization (2015)
  18. Robinson, Daniel P.: Primal-dual active-set methods for large-scale optimization (2015)
  19. Kungurtsev, Vyacheslav; Diehl, Moritz: Sequential quadratic programming methods for parametric nonlinear optimization (2014)