CUTEr

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

Showing results 461 to 480 of 545.
Sorted by year (citations)

previous 1 2 3 ... 22 23 24 25 26 27 28 next

  1. Benzi, Michele; Golub, Gene H.; Liesen, Jörg: Numerical solution of saddle point problems (2005)
  2. Birgin, E. G.; Martínez, J. M.: Local convergence of an inexact-restoration method and numerical experiments (2005)
  3. Colson, Benoît; Toint, Philippe L.: Optimizing partially separable functions without derivatives (2005)
  4. Costa, M. Fernanda P.; Fernandes, Edite M. P. G.: A primal-dual interior-point algorithm for nonlinear least squares constrained problems (2005)
  5. Gill, Philip E.; Murray, Walter; Saunders, Michael A.: SNOPT: an SQP algorithm for large-scale constrained optimization (2005)
  6. Gould, Nicholas I. M.; Orban, Dominique; Sartenaer, Annick; Toint, Phillipe L.: Sensitivity of trust-region algorithms to their parameters (2005)
  7. Gould, Nick I. M.; Sainvitu, Caroline; Toint, Philippe L.: A filter-trust-region method for unconstrained optimization (2005)
  8. Herskovits, J.; Mappa, P.; Goulart, E.; Mota Soares, C. M.: Mathematical programming models and algorithms for engineering design optimization (2005)
  9. Marina, Andretta; Birgin, Ernesto G.; Martínez, José Mario: Practical active-set Euclidian trust-region method with spectral projected gradients for bound-constrained minimization (2005)
  10. Neumaier, Arnold; Shcherbina, Oleg; Huyer, Waltraud; Vinkó, Tamás: A comparison of complete global optimization solvers (2005)
  11. Roma, Massimo: Dynamic scaling based preconditioning for truncated Newton methods in large scale unconstrained optimization (2005)
  12. Vanden Berghen, Frank; Bersini, Hugues: CONDOR, a new parallel, constrained extension of Powell’s UOBYQA algorithm: Experimental results and comparison with the DFO algorithm (2005)
  13. Yamashita, Hiroshi; Yabe, Hiroshi; Tanabe, Takahito: A globally and superlinearly convergent primal-dual interior point trust region method for large scale constrained optimization (2005)
  14. Abramson, Mark A.; Audet, Charles; Dennis, J. E. jun.: Generalized pattern searches with derivative information (2004)
  15. Arora, Nikhil; Biegler, Lorenz T.: A trust region SQP algorithm for equality constrained parameter estimation with simple parameter bounds (2004)
  16. Benson, Hande Y.; Shanno, David F.; Vanderbei, Robert J.: Interior-point methods for nonconvex nonlinear programming: jamming and numerical testing (2004)
  17. Byrd, Richard H.; Gould, Nicholas I. M.; Nocedal, Jorge; Waltz, Richard A.: An algorithm for nonlinear optimization using linear programming and equality constrained subproblems (2004)
  18. Diniz-Ehrhardt, M. A.; Gomes-Ruggiero, M. A.; Martínez, J. M.; Santos, S. A.: Augmented Lagrangian algorithms based on the spectral projected gradient method for solving nonlinear programming problems (2004)
  19. Duff, Iain S.: MA57 -- a code for the solution of sparse symmetric definite and indefinite systems (2004)
  20. Gertz, M.; Nocedal, J.; Sartenaer, A.: A starting point strategy for nonlinear interior methods. (2004)

previous 1 2 3 ... 22 23 24 25 26 27 28 next