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

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

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

  1. Chauvier, Laurent; Fuduli, Antonio; Gilbert, Jean Charles: A truncated SQP algorithm for solving nonconvex equality constrained optimization problems (2003)
  2. Dai, Yuhong; Ni, Qin: Testing different conjugate gradient methods for large-scale unconstrained optimization (2003)
  3. Gill, Philip E.; Leonard, Michael W.: Limited-memory reduced-Hessian methods for large-scale unconstrained optimization (2003)
  4. Gould, Nicholas I. M.; Orban, Dominique; Toint, Philippe L.: CUTEr and SifDec: a constrained and unconstrained testing environment, revisited (2003)
  5. Gould, Nicholas I. M.; Orban, Dominique; Toint, Philippe L.: GALAHAD, a library of thread-safe Fortran 90 packages for large-scale nonlinear optimization (2003)
  6. Moguerza, Javier M.; Prieto, Francisco J.: Combining search directions using gradient flows (2003)
  7. Morales, Joseé Luis; Nocedal, Jorge; Waltz, Richard A.; Liu, Guanghui; Goux, Jean-Pierre: Assessing the potential of interior methods for nonlinear optimization (2003)
  8. Shcherbina, Oleg; Neumaier, Arnold; Sam-Haroud, Djamila; Vu, Xuan-Ha; Nguyen, Tuan-Viet: Benchmarking global optimization and constraint satisfaction codes (2003)
  9. Vaz, A. Ismael F.; Fernandes, Edite M. G. P.; Gomes, M. Paula S. F.: A sequential quadratic programming with a dual parametrization approach to nonlinear semi-infinite programming (2003)
  10. Anitescu, Mihai: A superlinearly convergent sequential quadratically constrained quadratic programming algorithm for degenerate nonlinear programming (2002)
  11. Burdakov, Oleg P.; Martínez, José Mario; Pilotta, Elvio A.: A limited-memory multipoint symmetric secant method for bound constrained optimization (2002)
  12. Facchinei, Francisco; Lucidi, Stefano; Palagi, Laura: A truncated Newton algorithm for large scale box constrained optimization (2002)
  13. Forsgren, Anders: Inertia-controlling factorizations for optimization algorithms (2002)
  14. Grippo, L.; Sciandrone, M.: Nonmonotone globalization techniques for the Barzilai-Borwein gradient method (2002)
  15. Leibfritz, F.; Mostafa, E. M. E.: An interior point constrained trust region method for a special class of nonlinear semidefinite programming problems (2002)
  16. Maros, István; Khaliq, Mohammad Haroon: Advances in design and implementation of optimization software (2002)
  17. Morales, J. L.: A numerical study of limited memory BFGS methods (2002)
  18. Nocedal, Jorge; Sartenaer, Annick; Zhu, Ciyou: On the behavior of the gradient norm in the steepest descent method (2002)
  19. Bergamaschi, L.; Moret, I.; Zilli, G.: Inexact Quasi-Newton methods for sparse systems of nonlinear equations (2001)
  20. Birgin, Ernesto G.; Martínez, José Mario; Raydan, Marcos: Algorithm 813: SPG -- software for convex-constrained optimization (2001)

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