About: CUTEr

Facets (new session)
Description
Metadata
Settings
- Rule:
- Inverse Functional Properties:
- "Same As":

About: CUTEr Goto Sponge NotDistinct Permalink

An Entity of Type : dbo:Software, within Data Space : dbpedia.demo.openlinksw.com associated with source document(s)
QRcode icon

http://dbpedia.demo.openlinksw.com/c/AVzF3aBs6R

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 (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.

Attributes	Values
rdf:type	software
rdfs:label	CUTEr (en)
rdfs:comment	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 (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. (en)
foaf:homepage	http://cuter.rl.ac.uk/
dct:subject	Mathematical optimization software Numerical software
Wikipage page ID	6830532 (xsd:integer)
Wikipage revision ID	1050174745 (xsd:integer)
Link from a Wikipage to another Wikipage	Open source Optimization (mathematics) Linear algebra Linux Mac OS X Least squares Linear programming AMPL Quadratic programming Mathematical optimization software Numerical software IPOPT MPS (format) Nonlinear programming Subset Solver (computer science) UNIX
Link from a Wikipage to an external page	http://cuter.rl.ac.uk/cuter-www/Doc/general/node55.html http://www.sbsi-sol-optimize.com/asp/sol_product_minos.htm http://www.doc.ic.ac.uk/~im/ http://cuter.rl.ac.uk/ http://www.sbsi-sol-optimize.com/asp/sol_product_snopt.htm http://www.netlib.org http://www.ziena.com https://web.archive.org/web/20060922220842/http:/neos.mcs.anl.gov/neos/solvers/nco:filter/AMPL.html
sameAs	CUTEr CUTEr CUTEr
dbp:wikiPageUsesTemplate	dbt:Citation_needed dbt:Reflist
has abstract	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 (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. (en)
gold:hypernym	Environment
prov:wasDerivedFrom	wikipedia-en:CUTEr?oldid=1050174745&ns=0
page length (characters) of wiki page	3870 (xsd:nonNegativeInteger)
foaf:isPrimaryTopicOf	wikipedia-en:CUTEr
is Link from a Wikipage to another Wikipage of	List of optimization software Galahad library APOPT
is foaf:primaryTopic of	wikipedia-en:CUTEr

Faceted Search & Find service v1.17_git147 as of Sep 06 2024

Alternative Linked Data Documents: ODE Content Formats:

RDF

ODATA

Microdata

About

OpenLink Virtuoso version 08.03.3331 as of Sep 2 2024, on Linux (x86_64-generic-linux-glibc212), Single-Server Edition (378 GB total memory, 69 GB memory in use)
Data on this page belongs to its respective rights holders.
Virtuoso Faceted Browser Copyright © 2009-2024 OpenLink Software