CUTEr and SifDec: A constrained and unconstrained testing environment, revisited

The initial release of CUTE, a widely used testing environment for optimization software, was described by Bongartz, et al. [1995]. A new version, now known as CUTEr, is presented. Features include reorganisation of the environment to allow simultaneous multi-platform installation, new tools for, and interfaces to, optimization packages, and a considerably simplified and entirely automated installation procedure for unix systems. The environment is fully backward compatible with its predecessor, and offers support for Fortran 90/95 and a general C/C++ Application Programming Interface. The SIF decoder, formerly a part of CUTE, has become a separate tool, easily callable by various packages. It features simple extensions to the SIF test problem format and the generation of files suited to automatic differentiation packages.

[1]  D. Anderson,et al.  Algorithms for minimization without derivatives , 1974 .

[2]  John G. Lewis,et al.  Sparse matrix test problems , 1982, SGNM.

[3]  I. Duff,et al.  Direct Methods for Sparse Matrices , 1987 .

[4]  D. Ponceleón.  Barrier methods for large-scale quadratic programming , 1991 .

[5]  Iain S. Duff,et al.  Users' guide for the Harwell-Boeing sparse matrix collection (Release 1) , 1992 .

[6]  P. Toint,et al.  Lancelot: A FORTRAN Package for Large-Scale Nonlinear Optimization (Release A) , 1992 .

[7]  Paul DuBois.  Software portability with imake , 1993 .

[8]  David F. Shanno,et al.  Preliminary Computational Experience with Modified Log-Barrier Functions for Large-Scale Nonlinear Programming , 1994 .

[9]  Nicholas I. M. Gould,et al.  CUTE: constrained and unconstrained testing environment , 1995, TOMS.

[10]  David F. Shanno,et al.  Computational experience with penalty-barrier methods for nonlinear programming , 1996, Ann. Oper. Res..

[11]  M. Todd,et al.  Structured trust region algorithms for the minimization of nonlinear functions , 1996 .

[12]  Jorge Nocedal,et al.  Algorithm 778: L-BFGS-B: Fortran subroutines for large-scale bound-constrained optimization , 1997, TOMS.

[13]  Iain S. Duff,et al.  The Rutherford-Boeing sparse matrix collection , 1997 .

[14]  Annick Sartenaer,et al.  Automatic Determination of an Initial Trust Region in Nonlinear Programming , 1997, SIAM J. Sci. Comput..

[15]  Jorge Nocedal,et al.  On the Implementation of an Algorithm for Large-Scale Equality Constrained Optimization , 1998, SIAM J. Optim..

[16]  J. Nocedal,et al.  The modified absolute-value factorization norm for trust-region minimization , 1998 .

[17]  Homer F. Walker,et al.  NITSOL: A Newton Iterative Solver for Nonlinear Systems , 1998, SIAM J. Sci. Comput..

[18]  Sven Leyffer,et al.  User manual for filterSQP , 1998 .

[19]  Andrew R. Conn,et al.  Two-Step Algorithms for Nonlinear Optimization with Structured Applications , 1999, SIAM J. Optim..

[20]  Robert J. Vanderbei,et al.  An Interior-Point Algorithm for Nonconvex Nonlinear Programming , 1999, Comput. Optim. Appl..

[21]  C. Mészáros,et al.  A repository of convex quadratic programming problems , 1999 .

[22]  P. Gill,et al.  Combination trust-region line-search methods for unconstrained optimization , 1999 .

[23]  J. E. DENNIS,et al.  A Trust-Region Approach to Nonlinear Systems of Equalities and Inequalities , 1999, SIAM J. Optim..

[24]  Nicholas I. M. Gould,et al.  Solving the Trust-Region Subproblem using the Lanczos Method , 1999, SIAM J. Optim..

[25]  José Mario Martínez,et al.  Nonlinear programming algorithms using trust regions and augmented Lagrangians with nonmonotone penalty parameters , 1999, Math. Program..

[26]  Jorge Nocedal,et al.  A trust region method based on interior point techniques for nonlinear programming , 2000, Math. Program..

[27]  P. Toint,et al.  A primal-dual algorithm for minimizing a non-convex function subject to bound and linear equality constraints , 2000 .

[28]  Nicholas I. M. Gould,et al.  A primal-dual trust-region algorithm for non-convex nonlinear programming , 2000, Math. Program..

[29]  S. Santos,et al.  Numerical analysis of leaving-face parameters in bound-constrained quadratic minimization , 2001 .

[30]  Sven Leyffer,et al.  Nonlinear programming without a penalty function , 2002, Math. Program..

[31]  Michael A. Saunders,et al.  SNOPT: An SQP Algorithm for Large-Scale Constrained Optimization , 2002, SIAM J. Optim..

[32]  Nicholas I. M. Gould,et al.  Global Convergence of a Trust-Region SQP-Filter Algorithm for General Nonlinear Programming , 2002, SIAM J. Optim..

[33]  Jorge Nocedal,et al.  Wedge trust region methods for derivative free optimization , 2002, Math. Program..

[34]  Wei Yuan,et al.  A New Trust-Region Algorithm for Equality Constrained Optimization , 2002, Comput. Optim. Appl..

[35]  Michael A. Saunders,et al.  USER’S GUIDE FOR SNOPT 5.3: A FORTRAN PACKAGE FOR LARGE-SCALE NONLINEAR PROGRAMMING , 2002 .

[36]  Stefan Ulbrich,et al.  Non-monotone trust region methods for nonlinear equality constrained optimization without a penalty function , 2003, Math. Program..

[37]  Jorge Nocedal,et al.  Feasible Interior Methods Using Slacks for Nonlinear Optimization , 2003, Comput. Optim. Appl..

[38]  Nicholas I. M. Gould,et al.  GALAHAD, a library of thread-safe Fortran 90 packages for large-scale nonlinear optimization , 2003, TOMS.

[39]  Hiroshi Yamashita,et al.  A globally and superlinearly convergent primal-dual interior point trust region method for large scale constrained optimization , 2005, Math. Program..