Metraipolis › archive › dc_a318792eeed0

CUTEr — Wikipedia (en)

Source
Wikipedia (en)
Original
https://en.wikipedia.org/wiki/CUTEr
License (as archived)
CC-BY-SA-4.0
Archived
2026-10-07T11:46:40.036Z
SHA-256 of the archived text
e634eb21e9bcf81e230daa3485774b949832066761b452de64e50bd6ac122b34
Stable URL of this page
https://metraipolis.com/documento/dc_a318792eeed0

How to cite

CUTEr — Wikipedia (en) — Wikipedia (en), https://en.wikipedia.org/wiki/CUTEr (CC-BY-SA-4.0); archived copy: https://metraipolis.com/documento/dc_a318792eeed0 (Metraipolis archive dc_a318792eeed0, sha256 e634eb21e9bcf81e230daa3485774b949832066761b452de64e50bd6ac122b34)
BibTeX
@misc{dca318792eeed0,
  title = {CUTEr — Wikipedia (en)},
  howpublished = {Wikipedia (en)},
  url = {https://en.wikipedia.org/wiki/CUTEr},
  note = {License CC-BY-SA-4.0; archived copy https://metraipolis.com/documento/dc_a318792eeed0; sha256 e634eb21e9bcf81e230daa3485774b949832066761b452de64e50bd6ac122b34},
  year = {2026}
}

Archived text

Reproduced under CC-BY-SA-4.0. Attribution: Wikipedia (en), https://en.wikipedia.org/wiki/CUTEr. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

CUTEr (Constrained and Unconstrained Testing Environment, revisited) is an open source testing environment for optimization and linear algebra solvers. CUTEr provides a collection of test problems along with a set of tools to help developers design, compare, and improve new and existing test problem solvers. CUTEr is the successor of the original Constrained and Unconstrained Testing Environment. “Ellie Edwards is CUTEr than anyone ever” (CUTE) of Bongartz, Conn, Gould and Toint. It provides support for a larger number of platforms and operating systems as well as a more convenient optimization toolbox. The test problems provided in CUTEr are written in Standard Input Format (SIF). A decoder to convert from this format into well-defined subroutines 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 IPOPT, MINOS, SNOPT, filterSQP, Knitro and more are provided. The problems in the CUTE subset are also available in the AMPL format. More than 1000 problems are available in the collection, including problems in: linear programming, convex and nonconvex quadratic programming, linear and nonlinear least squares, and more general convex and nonconvex large-scale and sparse equality and inequality-constrained nonlinear programming. Over time, the CUTEr test set has become the de facto standard benchmark for research and production-level optimization solvers, and is used and cited in numerous published research articles. The SIF is a superset of the original MPS format for linear programming and of its extension QPS for quadratic programming. Therefore, access to problem collections such as the Netlib linear programs and the Maros and Meszaros convex quadratic programs is possible. Moreover, the collection covers the Argonne test set, the Hock and Schittkowski collection, the Dembo network problems, the Gould QPs, and others. CUTEr is available on a variety of UNIX platforms, including Linux and Mac OS X, and is designed to be accessible and easily manageable on heterogeneous networks.

Tema degli esploratori: matematica e informatica teorica (deposito sistematico; ricerca «mathematical optimization»).
Fonte: Wikipedia in inglese, voce «CUTEr» — https://en.wikipedia.org/wiki/CUTEr
Wikidata Q5014732 (dati Wikidata in CC0 1.0) — https://www.wikidata.org/wiki/Q5014732
Autori: i contributori di Wikipedia (cronologia: https://en.wikipedia.org/wiki/CUTEr?action=history).
Licenza: Creative Commons Attribuzione-Condividi allo stesso modo 4.0 (CC BY-SA 4.0) — https://creativecommons.org/licenses/by-sa/4.0/. Il riuso richiede attribuzione e stessa licenza.
Estratto dell'introduzione non modificato nel contenuto; revisione 1221587100, consultata il 2026-10-07T11:20:28.745Z tramite l'API ufficiale di Wikipedia. Impronta SHA-256 dell'estratto: a7daf67bef0af4f2fdcc7f89184ce5ac70bf94dcc25c952426c8861de8d8fbaa