CUTEst: a constrained and unconstrained testing environment with safe threads for mathematical optimization. (English) Zbl 1325.90004

Summary: 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.


90-04 Software, source code, etc. for problems pertaining to operations research and mathematical programming
Full Text: DOI


[1] Birgin, EG; Martinez, JM; Raydan, M, Algorithm 813: SPG-software for convex-constrained optimization, ACM Trans. Math. Softw., 27, 340-349, (2001) · Zbl 1070.65547
[2] Birgin, EG; Castillo, R; Martinez, JM, Numerical comparison of augmented Lagrangian algorithms for nonconvex problems, Comput. Optim. Appl., 31, 31-56, (2005) · Zbl 1101.90066
[3] Bongartz, I., Conn, A.R., Gould, N.I.M., Toint, Ph.L.: \({\sf CUTE}\): constrained and unconstrained testing environment. ACM Trans. Math. Softw. 21(1), 123-160 (1995) · Zbl 0886.65058
[4] Conn, A.R., Gould, N.I.M., Toint, Ph.L.: An introduction to the structure of large scale nonlinear optimization problems and the \({\sf LANCELOT}\) project. In: Glowinski, R., Lichnewsky, A. (eds.) Computing Methods in Applied Sciences and Engineering, pp. 42-51. SIAM, Philadelphia (1990) · Zbl 1258.65061
[5] Conn, A.R., Gould, N.I.M., Toint, Ph.L.: \({\sf LANCELOT}\): A Fortran Package for Large-Scale Nonlinear Optimization (Release A). Springer Series in Computational Mathematics. Springer, Heidelberg, Berlin, New York (1992) · Zbl 0761.90087
[6] Digabel, S, Algorithm 909: NOMAD: nonlinear optimization with the MADS algorithm, ACM Trans. Math. Softw., 37, 1-15, (2011) · Zbl 1365.65172
[7] Dolan, E.D., Gurson, A.P., Shepherd, P.L., Siefert, C.M., Torczon, V.J., Yates, A.: C++ direct searches. http://www.cs.wm.edu/va/software/DirectSearch/direct_code/ (2001) · Zbl 1070.65547
[8] Fletcher, R, A sequential linear constraint programming algorithm for NLP, SIAM J. Optim., 22, 772-794, (2012) · Zbl 1258.65061
[9] Gay, D.M.: Electronic mail distribution of linear programming test problems. Mathematical Programming Society COAL Newsletter, December (1985). http://www.netlib.org/lp/data/
[10] Gill, P.E., Wong, E.: Methods for convex and general quadratic programming. Technical Report NA 10-1, Department of Mathematics, University of California, San Diego, 2013. To appear Mathematical Programming Computation (2014) · Zbl 1317.90225
[11] Gould, N.I.M., Orban, D., Toint, Ph.L.: \({\sf CUTEr}\) (and \({\sf SifDec}\)), a constrained and unconstrained testing environment, revisited. ACM Trans. Math. Softw. 29(4), 373-394 (2003) · Zbl 1068.90526
[12] Gould, N.I.M., Orban, D., Toint, Ph.L.: \({\sf GALAHAD}\)—a library of thread-safe fortran 90 packages for large-scale nonlinear optimization. ACM Trans. Math. Softw. 29(4), 353-372 (2003) · Zbl 1068.90525
[13] IBM Optimization Solutions and Library: QP Solutions User Guide. IBM Corportation (1998) · Zbl 1070.65547
[14] International Business Machine Corporation: Mathematical programming system/360 version 2, linear and separable programming-user’s manual. Technical Report H20-0476-2, IBM Corporation, 1969. MPS Standard
[15] Kocvara, M; Stingl, M, PENNON: a code for convex nonlinear and semidefinite programming, Optim. Methods Softw., 18, 317-333, (2003) · Zbl 1037.90003
[16] Maros, I; Meszaros, C, A repository of convex quadratic programming problems, Optim. Methods Softw., 11-12, 671-681, (1999) · Zbl 0973.90520
[17] Ponceleón, D.B.: Barrier methods for large-scale quadratic programming. Ph.D. Thesis, Department of Computer Science, Stanford University, Stanford, CA, USA (1990)
[18] Powell, M.J.D.: The BOBYQA algorithm for bound constrained optimization without derivatives. Technical Report DAMTP NA2009/06, Department of Applied Mathematics and Theoretical Physics, Cambridge University, Cambridge, UK (2009)
[19] Powell, M.J.D.: The LINUOA software for linearly unconstrained optimization without derivatives. http://www.netlib.org/na-digest-html/13/v13n42.html (2013)
[20] Powell, MJD; Pillo, G (ed.); Roma, M (ed.), The NEWUOA software for unconstrained optimization without derivatives, No. 83, 255-297, (2006), Heidelberg, Berlin, New York · Zbl 1108.90005
[21] QPLIB2014: a Quadratic Programming Library. http://www.lamsade.dauphine.fr/QPlib2014/doku.php (2014) · Zbl 1037.90003
[22] Schittkowski, K.: NLPQLP: a Fortran implementation of a sequential quadratic programming algorithm with distributed and non-monotone line search. University of Bayreuth, Department of Computer Science, Technical report (2010) · Zbl 1365.65172
[23] Schittkowski, K.: QL: a Fortran code for convex quadratic programming-User’s guide, Version 2.11. Technical report, University of Bayreuth, Department of Computer Science (2005)
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.