CUTE

CUTE: Constrained and unconstrained testing environment. The purpose of this article is to discuss the scope and functionality of a versatile environment for testing small- and large-scale nonlinear optimization algorithms. Although many of these facilities were originally produced by the authors in conjunction with the software package LANCELOT, we believe that they will be useful in their own right and should be available to researchers for their development of optimization software. The tools can be obtained by anonymous ftp from a number of sources and may, in many cases, be installed automatically. The scope of a major collection of test problems written in the standard input format (SIF) used by the LANCELOT software package is described. Recognizing that most software was not written with the SIF in mind, we provide tools to assist in building an interface between this input format and other optimization packages. These tools provide a link between the SIF and a number of existing packages, including MINOS and OSL. Additionally, as each problem includes a specific classification that is designed to be useful in identifying particular classes of problems, facilities are provided to build and manage a database of this information. There is a Unix and C shell bias to many of the descriptions in the article, since, for the sake of simplicity, we do not illustrate everything in its fullest generality. We trust that the majority of potential users are sufficiently familiar with Unix that these examples will not lead to undue confusion.

This software is also peer reviewed by journal TOMS.


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

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

1 2 3 ... 6 7 8 next

  1. Gower, R.M.; Gower, A.L.: Higher-order reverse automatic differentiation with emphasis on the third-order (2016)
  2. Qiu, Songqiang; Chen, Zhongwen: A globally convergent penalty-free method for optimization with equality constraints and simple bounds (2016)
  3. Salleh, Zabidin; Alhawarat, Ahmad: An efficient modification of the Hestenes-Stiefel nonlinear conjugate gradient method with restart property (2016)
  4. Shi, Zhanwen; Yang, Guanyu; Xiao, Yunhai: A limited memory BFGS algorithm for non-convex minimization with applications in matrix largest eigenvalue problem (2016)
  5. Wang, X.Y.; Li, S.J.; Kou, Xi Peng: A self-adaptive three-term conjugate gradient method for monotone nonlinear equations with convex constraints (2016)
  6. Yu, Zhensheng; Gan, Xinyue: Global and local R-linear convergence of a spectral projected gradient method for convex optimization with singular solution (2016)
  7. Al-Baali, Mehiddin; Narushima, Yasushi; Yabe, Hiroshi: A family of three-term conjugate gradient methods with sufficient descent property for unconstrained optimization (2015)
  8. Chen, Yannan; Sun, Wenyu: A dwindling filter line search method for unconstrained optimization (2015)
  9. Gould, Nicholas I.M.; Orban, Dominique; Toint, Philippe L.: CUTEst: a constrained and unconstrained testing environment with safe threads for mathematical optimization (2015)
  10. Liu, Hao; Shao, Jianfeng; Wang, Haijun; Chang, Baoxian: An adaptive sizing BFGS method for unconstrained optimization (2015)
  11. Liu, Hao; Wang, Haijun; Qian, Xiaoyan; Rao, Feng: A conjugate gradient method with sufficient descent property (2015)
  12. Livieris, Ioannis E.; Pintelas, Panagiotis: A modified Perry conjugate gradient method and its global convergence (2015)
  13. Yang, Yaguang: A globally and quadratically convergent algorithm with efficient implementation for unconstrained optimization (2015)
  14. Zhou, Qunyan; Hang, Dan: Nonmonotone adaptive trust region method with line search based on new diagonal updating (2015)
  15. Zhou, Qunyan; Zhang, Chun: An adaptive trust region method based on simple conic models (2015)
  16. Benson, Hande Y.; Shanno, David F.: Interior-point methods for nonconvex nonlinear programming: cubic regularization (2014)
  17. Cheng, Wanyou; Chen, Zixin; Li, Dong-hui: An active set truncated Newton method for large-scale bound constrained optimization (2014)
  18. Cheng, Wanyou; Liu, Qunfeng; Li, Donghui: An accurate active set conjugate gradient algorithm with project search for bound constrained optimization (2014)
  19. Jian, Jin-bao; Chen, Qiao-fang; Huang, Zong-wen: A superlinearly convergent SQP method without boundedness assumptions on any of the iterative sequences (2014)
  20. Jian, Jinbao; Han, Daolan; Xu, Qingjuan: A fast convergent sequential linear equation method for inequality constrained optimization without strict complementarity (2014)

1 2 3 ... 6 7 8 next