Skip to search formSkip to main contentSkip to account menu

CUTEr

CUTEr (Constrained and Unconstrained Testing Environment, revisited) is an open source testing environment for optimization and linear algebra… 
Wikipedia (opens in a new tab)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2015
2015
Nonlinear conjugate gradient method is very popular in solving large-scale unconstrained minimization problems due to its simple… 
2013
2013
A globally convergent algorithm based on the stabilized sequential quadratic programming (sSQP) method is presented in order to… 
2012
2012
The proximal method is a standard regularization approach in optimization. Practical implementations of this algorithm require (i… 
Highly Cited
2012
Highly Cited
2012
Nonlinearly constrained optimization problems can be solved by minimizing a sequence of simpler unconstrained or linearly… 
Highly Cited
2011
Highly Cited
2011
An Adaptive Regularisation framework using Cubics (ARC) was proposed for unconstrained optimization and analysed in Cartis, Gould… 
Highly Cited
2007
Highly Cited
2007
  • H. Dollar
  • SIAM Journal on Matrix Analysis and Applications
  • 2007
  • Corpus ID: 8179376
The problem of finding good preconditioners for the numerical solution of an important class of indefinite linear systems is… 
Highly Cited
2006
Highly Cited
2006
Abstract.We present a primal-dual interior-point algorithm with a filter line-search method for nonlinear programming. Local and… 
Highly Cited
2005
Highly Cited
2005
A new filter-trust-region algorithm for solving unconstrained nonlinear optimization problems is introduced. Based on the filter… 
Highly Cited
2003
Highly Cited
2003
The initial release of CUTE, a widely used testing environment for optimization software, was described by Bongartz, et al. [1995…