OptimizationProblems.jl problem classification

It is possible to access information on the problems implemented in OptimizationProblems.jl without loading the problems using the package's own classification. ​

using OptimizationProblems

Each problem has its own metadata structure, and there is a global metadata structure regrouping all the information.

Problem's metadata

Each problem's metadata is accessible with OptimizationProblems.nameoftheproblem_meta and regroups in a Dict most of the essential information regarding each problem.

OptimizationProblems.AMPGO02_meta
Dict{Symbol, Any} with 22 entries:
  :has_equalities_only    => false
  :origin                 => :unknown
  :has_inequalities_only  => false
  :defined_everywhere     => missing
  :has_fixed_variables    => false
  :variable_ncon          => false
  :nvar                   => 1
  :is_feasible            => true
  :url                    => "http://infinity77.net/global_optimization/test_fu…
  :minimize               => true
  :ncon                   => 0
  :name                   => "AMPGO02"
  :origin_notes           => "Problem 2 in\nhttp://infinity77.net/global_optimi…
  :best_known_lower_bound => -Inf
  :lib                    => "AMPGO:2"
  :objtype                => :other
  :best_known_upper_bound => 0.839498
  :has_bounds             => false
  :reference              => "@misc{GavanaGOTestSuite,\n  author       = {Gavan…
  ⋮                       => ⋮

See ? OptimizationProblems.meta for more documentation on the various entries and their default values.

This structure is completed by getters to access the number of variables, get_nameoftheproblem_nvar, the number of constraints, get_nameoftheproblem_ncon, the number of linear constraints, get_nameoftheproblem_nlin, the number of nonlinear constraints, get_nameoftheproblem_nnln, the number of equality constraints, get_nameoftheproblem_nequ, and the number of inequality constraints, get_nameoftheproblem_nineq.

OptimizationProblems.get_AMPGO02_nvar()
1

For scalable problems the entry :variable_nvar (and/or :variable_ncon) is set as true and one can access the number of variables by passing the parameters to the getter functions. By default, the number of variables set in the meta is obtained using OptimizationProblems.default_nvar as a parameter to define the problem.

OptimizationProblems.arglina_meta
Dict{Symbol, Any} with 22 entries:
  :has_equalities_only    => false
  :origin                 => :unknown
  :has_inequalities_only  => false
  :defined_everywhere     => missing
  :has_fixed_variables    => false
  :variable_ncon          => false
  :nvar                   => 100
  :is_feasible            => true
  :url                    => "https://doi.org/10.1145/355934.355936, https://bi…
  :minimize               => true
  :ncon                   => 0
  :name                   => "arglina"
  :origin_notes           => "Problem 32 in\nJ.J. More', B.S. Garbow and K.E. H…
  :best_known_lower_bound => -Inf
  :lib                    => "CUTEst:ARGLINA"
  :objtype                => :least_squares
  :best_known_upper_bound => 500.0
  :has_bounds             => false
  :reference              => "@article{MoreGarbowHillstrom1981,\n  author  = {M…
  ⋮                       => ⋮
OptimizationProblems.get_arglina_nvar(n = 10)
10
OptimizationProblems.PureJuMP.arglina(n = 10)
A JuMP Model
├ solver: none
├ objective_sense: MIN_SENSE
│ └ objective_function_type: JuMP.QuadExpr
├ num_variables: 10
├ num_constraints: 0
└ Names registered in the model
  └ :x

Global meta

This package collects all the metadata in a single DataFrame.

OptimizationProblems.meta
395×22 DataFrame
Rownvarvariable_nvarnconvariable_nconminimizenamehas_equalities_onlyhas_inequalities_onlyhas_boundshas_fixed_variablesobjtypecontypebest_known_lower_boundbest_known_upper_boundis_feasibledefined_everywhereoriginurlnotesorigin_notesreferencelib
Int64BoolInt64BoolBoolStringBoolBoolBoolBoolSymbolSymbolRealRealBool?Bool?SymbolStringStringStringStringString
11false0falsetrueAMPGO02falsefalsefalsefalseotherunconstrained-Inf0.839498truemissingunknownhttp://infinity77.net/global_optimization/test_functions_1d.html#d-test-functionsA one dimensional optimization problem\nProblem 2 in\nhttp://infinity77.net/global_optimization/test_functions_1d.html#d-test-functions\nAndrea Gavana\nS. Goyette, Sherbrooke 2016/2017\n@misc{GavanaGOTestSuite,\n author = {Gavana, Andrea},\n title = {Global Optimization Benchmarks},\n year = {2013},\n howpublished = {\\url{http://infinity77.net/global_optimization/}},\n note = {Collection of benchmark functions and algorithm comparisons for global optimization (including AMPGO)}\n}\nAMPGO:2
21false0falsetrueAMPGO03falsefalsefalsefalseotherunconstrained-Inf2.88961truemissingunknownhttp://infinity77.net/global_optimization/test_functions_1d.html#d-test-functionsA one dimensional optimization problem\nProblem 3 in\nhttp://infinity77.net/global_optimization/test_functions_1d.html#d-test-functions\nAndrea Gavana\nS. Goyette, Sherbrooke 2016/2017\n@misc{GavanaGOTestSuite,\n author = {Gavana, Andrea},\n title = {Global Optimization Benchmarks},\n year = {2013},\n howpublished = {\\url{http://infinity77.net/global_optimization/}},\n note = {Collection of benchmark functions and algorithm comparisons for global optimization (including AMPGO)}\n}\nAMPGO:3
31false0falsetrueAMPGO04falsefalsefalsefalseotherunconstrained-Inf-2.5666truemissingunknownhttp://infinity77.net/global_optimization/test_functions_1d.html#d-test-functionsA one dimensional optimization problem\nProblem 4 in\nhttp://infinity77.net/global_optimization/test_functions_1d.html#d-test-functions\nAndrea Gavana\nS. Goyette, Sherbrooke 2016/2017\n@misc{GavanaGOTestSuite,\n author = {Gavana, Andrea},\n title = {Global Optimization Benchmarks},\n year = {2013},\n howpublished = {\\url{http://infinity77.net/global_optimization/}},\n note = {Collection of benchmark functions and algorithm comparisons for global optimization (including AMPGO)}\n}\nAMPGO:4
41false0falsetrueAMPGO05falsefalsefalsefalseotherunconstrained-Inf-0.0truemissingunknownhttp://infinity77.net/global_optimization/test_functions_1d.html#d-test-functionsA one dimensional optimization problem\nProblem 5 in\nhttp://infinity77.net/global_optimization/test_functions_1d.html#d-test-functions\nAndrea Gavana\nS. Goyette, Sherbrooke 2016/2017\n@misc{GavanaGOTestSuite,\n author = {Gavana, Andrea},\n title = {Global Optimization Benchmarks},\n year = {2013},\n howpublished = {\\url{http://infinity77.net/global_optimization/}},\n note = {Collection of benchmark functions and algorithm comparisons for global optimization (including AMPGO)}\n}\nAMPGO:5
51false0falsetrueAMPGO06falsefalsefalsefalseotherunconstrained-Inf3.5177e-43truemissingunknownhttp://infinity77.net/global_optimization/test_functions_1d.html#d-test-functionsA one dimensional optimization problem\nProblem 6 in\nhttp://infinity77.net/global_optimization/test_functions_1d.html#d-test-functions\nAndrea Gavana\nS. Goyette, Sherbrooke 2016/2017\n@misc{GavanaGOTestSuite,\n author = {Gavana, Andrea},\n title = {Global Optimization Benchmarks},\n year = {2013},\n howpublished = {\\url{http://infinity77.net/global_optimization/}},\n note = {Collection of benchmark functions and algorithm comparisons for global optimization (including AMPGO)}\n}\nAMPGO:6
61false0falsetrueAMPGO07falsefalsefalsefalseotherunconstrained-Inf2.56475truemissingunknownhttp://infinity77.net/global_optimization/test_functions_1d.html#d-test-functionsA one dimensional optimization problem\nProblem 7 in\nhttp://infinity77.net/global_optimization/test_functions_1d.html#d-test-functions\nAndrea Gavana\nS. Goyette, Sherbrooke 2016/2017\n@misc{GavanaGOTestSuite,\n author = {Gavana, Andrea},\n title = {Global Optimization Benchmarks},\n year = {2013},\n howpublished = {\\url{http://infinity77.net/global_optimization/}},\n note = {Collection of benchmark functions and algorithm comparisons for global optimization (including AMPGO)}\n}\nAMPGO:7
71false0falsetrueAMPGO08falsefalsefalsefalseotherunconstrained-Inf-2.0928truemissingunknownhttp://infinity77.net/global_optimization/test_functions_1d.html#d-test-functionsA one dimensional optimization problem\nProblem 8 in\nhttp://infinity77.net/global_optimization/test_functions_1d.html#d-test-functions\nAndrea Gavana\nS. Goyette, Sherbrooke 2016/2017\n@misc{GavanaGOTestSuite,\n author = {Gavana, Andrea},\n title = {Global Optimization Benchmarks},\n year = {2013},\n howpublished = {\\url{http://infinity77.net/global_optimization/}},\n note = {Collection of benchmark functions and algorithm comparisons for global optimization (including AMPGO)}\n}\nAMPGO:8
81false0falsetrueAMPGO09falsefalsefalsefalseotherunconstrained-Inf0.921136truemissingunknownhttp://infinity77.net/global_optimization/test_functions_1d.html#d-test-functionsA one dimensional optimization problem\nProblem 9 in\nhttp://infinity77.net/global_optimization/test_functions_1d.html#d-test-functions\nAndrea Gavana\nS. Goyette, Sherbrooke 2016/2017\n@misc{GavanaGOTestSuite,\n author = {Gavana, Andrea},\n title = {Global Optimization Benchmarks},\n year = {2013},\n howpublished = {\\url{http://infinity77.net/global_optimization/}},\n note = {Collection of benchmark functions and algorithm comparisons for global optimization (including AMPGO)}\n}\nAMPGO:9
91false0falsetrueAMPGO10falsefalsefalsefalseotherunconstrained-Inf-0.0truemissingunknownhttp://infinity77.net/global_optimization/test_functions_1d.html#d-test-functionsA one dimensional optimization problem\nProblem 10 in\nhttp://infinity77.net/global_optimization/test_functions_1d.html#d-test-functions\nAndrea Gavana\nS. Goyette, Sherbrooke 2016/2017\n@misc{GavanaGOTestSuite,\n author = {Gavana, Andrea},\n title = {Global Optimization Benchmarks},\n year = {2013},\n howpublished = {\\url{http://infinity77.net/global_optimization/}},\n note = {Collection of benchmark functions and algorithm comparisons for global optimization (including AMPGO)}\n}\nAMPGO:10
101false0falsetrueAMPGO11falsefalsefalsefalseotherunconstrained-Inf-1.0truemissingunknownhttp://infinity77.net/global_optimization/test_functions_1d.html#d-test-functionsA one dimensional optimization problem\nProblem 11 in\nhttp://infinity77.net/global_optimization/test_functions_1d.html#d-test-functions\nAndrea Gavana\nS. Goyette, Sherbrooke 2016/2017\n@misc{GavanaGOTestSuite,\n author = {Gavana, Andrea},\n title = {Global Optimization Benchmarks},\n year = {2013},\n howpublished = {\\url{http://infinity77.net/global_optimization/}},\n note = {Collection of benchmark functions and algorithm comparisons for global optimization (including AMPGO)}\n}\nAMPGO:11
111false0falsetrueAMPGO12falsefalsefalsefalseotherunconstrained-Inf1.0truemissingunknownhttp://infinity77.net/global_optimization/test_functions_1d.html#d-test-functionsA one dimensional optimization problem\nProblem 12 in\nhttp://infinity77.net/global_optimization/test_functions_1d.html#d-test-functions\nAndrea Gavana\nS. Goyette, Sherbrooke 2016/2017\n@misc{GavanaGOTestSuite,\n author = {Gavana, Andrea},\n title = {Global Optimization Benchmarks},\n year = {2013},\n howpublished = {\\url{http://infinity77.net/global_optimization/}},\n note = {Collection of benchmark functions and algorithm comparisons for global optimization (including AMPGO)}\n}\nAMPGO:12
121false0falsetrueAMPGO13falsefalsefalsefalseotherunconstrained-1.5874-1.5874truemissingunknownhttp://infinity77.net/global_optimization/test_functions_1d.html#d-test-functionsA one dimensional optimization problem\nProblem 13 in\nhttp://infinity77.net/global_optimization/test_functions_1d.html#d-test-functions\nAndrea Gavana\nS. Goyette, Sherbrooke 2016/2017\n@misc{GavanaGOTestSuite,\n author = {Gavana, Andrea},\n title = {Global Optimization Benchmarks},\n year = {2013},\n howpublished = {\\url{http://infinity77.net/global_optimization/}},\n note = {Collection of benchmark functions and algorithm comparisons for global optimization (including AMPGO)}\n}\nAMPGO:13
131false0falsetrueAMPGO14falsefalsefalsefalseotherunconstrained-Inf-0.0truemissingunknownhttp://infinity77.net/global_optimization/test_functions_1d.html#d-test-functionsA one dimensional optimization problem\nProblem 14 in\nhttp://infinity77.net/global_optimization/test_functions_1d.html#d-test-functions\nAndrea Gavana\nS. Goyette, Sherbrooke 2016/2017\n@misc{GavanaGOTestSuite,\n author = {Gavana, Andrea},\n title = {Global Optimization Benchmarks},\n year = {2013},\n howpublished = {\\url{http://infinity77.net/global_optimization/}},\n note = {Collection of benchmark functions and algorithm comparisons for global optimization (including AMPGO)}\n}\nAMPGO:14
141false0falsetrueAMPGO15falsefalsefalsefalseotherunconstrained-Inf2.15385truemissingunknownhttp://infinity77.net/global_optimization/test_functions_1d.html#d-test-functionsA one dimensional optimization problem\nProblem 15 in\nhttp://infinity77.net/global_optimization/test_functions_1d.html#d-test-functions\nAndrea Gavana\nS. Goyette, Sherbrooke 2016/2017\n@misc{GavanaGOTestSuite,\n author = {Gavana, Andrea},\n title = {Global Optimization Benchmarks},\n year = {2013},\n howpublished = {\\url{http://infinity77.net/global_optimization/}},\n note = {Collection of benchmark functions and algorithm comparisons for global optimization (including AMPGO)}\n}\nAMPGO:15
151false0falsetrueAMPGO18falsefalsefalsefalseotherunconstrained-Inf4.0truemissingunknownhttp://infinity77.net/global_optimization/test_functions_1d.html#d-test-functionsA one dimensional optimization problem\nProblem 18 in\nhttp://infinity77.net/global_optimization/test_functions_1d.html#d-test-functions\nAndrea Gavana\nS. Goyette, Sherbrooke 2016/2017\n@misc{GavanaGOTestSuite,\n author = {Gavana, Andrea},\n title = {Global Optimization Benchmarks},\n year = {2013},\n howpublished = {\\url{http://infinity77.net/global_optimization/}},\n note = {Collection of benchmark functions and algorithm comparisons for global optimization (including AMPGO)}\n}\nAMPGO:18
161false0falsetrueAMPGO20falsefalsefalsefalseotherunconstrained-Inf3.92246e-43truemissingunknownhttp://infinity77.net/global_optimization/test_functions_1d.html#d-test-functionsA one dimensional optimization problem\nProblem 20 in\nhttp://infinity77.net/global_optimization/test_functions_1d.html#d-test-functions\nAndrea Gavana\nS. Goyette, Sherbrooke 2016/2017\n@misc{GavanaGOTestSuite,\n author = {Gavana, Andrea},\n title = {Global Optimization Benchmarks},\n year = {2013},\n howpublished = {\\url{http://infinity77.net/global_optimization/}},\n note = {Collection of benchmark functions and algorithm comparisons for global optimization (including AMPGO)}\n}\nAMPGO:20
171false0falsetrueAMPGO21falsefalsefalsefalseotherunconstrained-Inf0.0truemissingunknownhttp://infinity77.net/global_optimization/test_functions_1d.html#d-test-functionsA one dimensional optimization problem\nProblem 21 in\nhttp://infinity77.net/global_optimization/test_functions_1d.html#d-test-functions\nAndrea Gavana\nS. Goyette, Sherbrooke 2016/2017\n@misc{GavanaGOTestSuite,\n author = {Gavana, Andrea},\n title = {Global Optimization Benchmarks},\n year = {2013},\n howpublished = {\\url{http://infinity77.net/global_optimization/}},\n note = {Collection of benchmark functions and algorithm comparisons for global optimization (including AMPGO)}\n}\nAMPGO:21
181false0falsetrueAMPGO22falsefalsefalsefalseotherunconstrained-Inf1.0truemissingunknownhttp://infinity77.net/global_optimization/test_functions_1d.html#d-test-functionsA one dimensional optimization problem\nProblem 22 in\nhttp://infinity77.net/global_optimization/test_functions_1d.html#d-test-functions\nAndrea Gavana\nS. Goyette, Sherbrooke 2016/2017\n@misc{GavanaGOTestSuite,\n author = {Gavana, Andrea},\n title = {Global Optimization Benchmarks},\n year = {2013},\n howpublished = {\\url{http://infinity77.net/global_optimization/}},\n note = {Collection of benchmark functions and algorithm comparisons for global optimization (including AMPGO)}\n}\nAMPGO:22
193false1falsetrueBOX2truefalsefalsefalseotherlinear-Inf0.942284truemissingunknownhttps://bitbucket.org/optrove/sif/src/master/BOX2.SIFBox problem in 2 variables, obtained by fixing X3 = 1 in BOX2.\n\nclassification SXR2-AN-3-0\nProblem 11 in\nA.R. Buckley,\n"Test functions for unconstrained minimization",\nTR 1989CS-3, Mathematics, statistics and computing centre,\nDalhousie University, Halifax (CDN), 1989.\n\nSIF input: Ph. Toint, Dec 1989.\n@techreport{Buckley1989,\n author = {Buckley, A. R.},\n title = {Test Functions for Unconstrained Minimization},\n institution = {Mathematics, Statistics and Computing Centre, Dalhousie University},\n number = {TR 1989CS-3},\n year = {1989},\n address = {Halifax, Canada}\n}\n CUTEst:BOX2
203false0falsetrueBOX3falsefalsefalsefalseotherunconstrained-Inf662.868truemissingunknownhttps://bitbucket.org/optrove/sif/src/master/BOX3.SIFSIF input: Ph. Toint, Dec 1989.\n\nBox problem in 3 variables.\n\nclassification SUR2-AN-3-0\nProblem 12 in\nJ.J. More', B.S. Garbow and K.E. Hillstrom,\n"Testing Unconstrained Optimization Software",\nACM Transactions on Mathematical Software, vol. 7(1), pp. 17-41, 1981.\nSee also Buckley#BOX663\n\nSIF input: Ph. Toint, Dec 1989.\n@article{MoreGarbowHillstrom1981,\n author = {Mor{\\'e}, Jorge J. and Garbow, Burton S. and Hillstrom, Kenneth E.},\n title = {Testing Unconstrained Optimization Software},\n journal = {ACM Transactions on Mathematical Software},\n year = {1981},\n volume = {7},\n number = {1},\n pages = {17--41},\n doi = {10.1145/355934.355936}\n} \n CUTEst:BOX3
211false0falsetrueDus2_1falsefalsefalsefalseotherunconstrained-Inf7.38906truemissingunknownhttp://www.dmi.usherb.ca/~dussault/ROP630E17/A one dimensional optimization problem\n\nS. Goyette, Sherbrooke 2016/2017\nProblem found in\nhttp://www.dmi.usherb.ca/~dussault/ROP630E17/\nJean_pierre Dussault\n@misc{Dussault2017,\n author = {Dussault, Jean-Pierre},\n title = {Optimization Test Problems},\n howpublished = {\\url{http://www.dmi.usherb.ca/~dussault/ROP630E17/}},\n year = {2017},\n note = {Universit{\\'e} de Sherbrooke}\n}\n
221false0falsetrueDus2_3falsefalsefalsefalseotherunconstrained-Inf0.972973truemissingunknownhttp://www.dmi.usherb.ca/~dussault/ROP630E17/A one dimensional optimization problem\n\nS. Goyette, Sherbrooke 2016/2017\nProblem found in\nhttp://www.dmi.usherb.ca/~dussault/ROP630E17/\nJean_pierre Dussault\n@misc{Dussault2017,\n author = {Dussault, Jean-Pierre},\n title = {Optimization Test Problems},\n howpublished = {\\url{http://www.dmi.usherb.ca/~dussault/ROP630E17/}},\n year = {2017},\n note = {Universit{\\'e} de Sherbrooke}\n}\n
231false0falsetrueDus2_9falsefalsefalsefalseotherunconstrained-Inf1.0truemissingunknownhttp://www.dmi.usherb.ca/~dussault/ROP630E17/A one dimensional optimization problem\n\nS. Goyette, Sherbrooke 2016/2017\nProblem found in\nhttp://www.dmi.usherb.ca/~dussault/ROP630E17/\nJean_pierre Dussault\n@misc{Dussault2017,\n author = {Dussault, Jean-Pierre},\n title = {Optimization Test Problems},\n howpublished = {\\url{http://www.dmi.usherb.ca/~dussault/ROP630E17/}},\n year = {2017},\n note = {Universit{\\'e} de Sherbrooke}\n}\n
241false0falsetrueDuscubefalsefalsefalsefalseotherunconstrained-Inf-108.0truemissingunknownhttp://www.dmi.usherb.ca/~dussault/ROP630E17/A one dimensional optimization problem\n\nS. Goyette, Sherbrooke 2016/2017\nProblem found in\nhttp://www.dmi.usherb.ca/~dussault/ROP630E17/\nJean_pierre Dussault\n@misc{Dussault2017,\n author = {Dussault, Jean-Pierre},\n title = {Optimization Test Problems},\n howpublished = {\\url{http://www.dmi.usherb.ca/~dussault/ROP630E17/}},\n year = {2017},\n note = {Universit{\\'e} de Sherbrooke}\n}\n
2591true0falsetrueNZF1falsefalsefalsefalseleast_squaresunconstrained-Inf34698.4truemissingunknownhttps://doi.org/10.1080/10556780500137116"Philippe Toint (private communication)"\n\nclassification SUR2-AN-V-0\n\nA. Montoison, Montreal, 05/2018.\n\n@article{Price2006,\n title = {Exploiting problem structure in pattern search methods for unconstrained optimization},\n volume = {21},\n ISSN = {1029-4937},\n url = {https://doi.org/10.1080/10556780500137116},\n DOI = {10.1080/10556780500137116},\n number = {3},\n journal = {Optimization Methods and Software},\n publisher = {Informa UK Limited},\n author = {Price, C. J. and Toint, PH. L.},\n year = {2006},\n month = June,\n pages = {479--491}\n} \n
261false0falsetrueShpak1falsefalsefalsefalseotherunconstrained-Inf0.839498truemissingunknownhttp://www.math.md/publications/csjm/issues/v3-n2/7902/first problem of\n Global optimization in one-dimensional case\n using analytically defined derivatives of\n objective function\n\nA.Shpak\n\nComputer Science Journal of Moldova, vol.3, no.2(8), 1995\n\n@article{Shpak1995,\n author = {Shpak, Alexander},\n title = {Global Optimization in One-Dimensional Case Using Analytically Defined Derivatives of Objective Function},\n journal = {Computer Science Journal of Moldova},\n year = {1995},\n volume = {3},\n number = {2},\n pages = {168--184},\n url = {http://www.math.md/publications/csjm/issues/v3-n2/7902/}\n}\n
271false0falsetrueShpak2falsefalsefalsefalseotherunconstrained-Inf-0.747036truemissingunknownhttp://www.math.md/publications/csjm/issues/v3-n2/7902/Second problem of\n Global optimization in one-dimensional case\n using analytically defined derivatives of\n objective function\n\n A.Shpak\n\n Computer Science Journal of Moldova, vol.3, no.2(8), 1995\n S. Goyette, Sherbrooke 2016/2017\n\n@article{Shpak1995,\n author = {Shpak, Alexander},\n title = {Global Optimization in One-Dimensional Case Using Analytically Defined Derivatives of Objective Function},\n journal = {Computer Science Journal of Moldova},\n year = {1995},\n volume = {3},\n number = {2},\n pages = {168--184},\n url = {http://www.math.md/publications/csjm/issues/v3-n2/7902/}\n}\n
281false0falsetrueShpak3falsefalsefalsefalseotherunconstrained-Inf2.63055truemissingunknownhttp://www.math.md/publications/csjm/issues/v3-n2/7902/third problem of\nGlobal optimization in one-dimensional case\nusing analytically defined derivatives of\nobjective function\n\nA.Shpak\n\nComputer Science Journal of Moldova, vol.3, no.2(8), 1995\n S. Goyette, Sherbrooke 2016/2017\n\n@article{Shpak1995,\n author = {Shpak, Alexander},\n title = {Global Optimization in One-Dimensional Case Using Analytically Defined Derivatives of Objective Function},\n journal = {Computer Science Journal of Moldova},\n year = {1995},\n volume = {3},\n number = {2},\n pages = {168--184},\n url = {http://www.math.md/publications/csjm/issues/v3-n2/7902/}\n}\n
291false0falsetrueShpak4falsefalsefalsefalseotherunconstrained-Inf-0.677439truemissingunknownhttp://www.math.md/publications/csjm/issues/v3-n2/7902/4th problem of\n Global optimization in one-dimensional case\n using analytically defined derivatives of\n objective function\n\n A.Shpak\n\n Computer Science Journal of Moldova, vol.3, no.2(8), 1995\n\n S. Goyette, Sherbrooke 2016/2017\n\n@article{Shpak1995,\n author = {Shpak, Alexander},\n title = {Global Optimization in One-Dimensional Case Using Analytically Defined Derivatives of Objective Function},\n journal = {Computer Science Journal of Moldova},\n year = {1995},\n volume = {3},\n number = {2},\n pages = {168--184},\n url = {http://www.math.md/publications/csjm/issues/v3-n2/7902/}\n}\n
301false0falsetrueShpak5falsefalsefalsefalseotherunconstrained-Inf-1.00842truemissingunknownhttp://www.math.md/publications/csjm/issues/v3-n2/7902/fifth problem of\n Global optimization in one-dimensional case\n using analytically defined derivatives of\n objective function\n\n A.Shpak\n\n Computer Science Journal of Moldova, vol.3, no.2(8), 1995\n\n S. Goyette, Sherbrooke 2016/2017\n\n@article{Shpak1995,\n author = {Shpak, Alexander},\n title = {Global Optimization in One-Dimensional Case Using Analytically Defined Derivatives of Objective Function},\n journal = {Computer Science Journal of Moldova},\n year = {1995},\n volume = {3},\n number = {2},\n pages = {168--184},\n url = {http://www.math.md/publications/csjm/issues/v3-n2/7902/}\n}\n
311false0falsetrueShpak6falsefalsefalsefalseotherunconstrained-Inf-1.25667truemissingunknownhttp://www.math.md/publications/csjm/issues/v3-n2/7902/6th problem of\n Global optimization in one-dimensional case\n using analytically defined derivatives of\n objective function\n\n A.Shpak\n\nComputer Science Journal of Moldova, vol.3, no.2(8), 1995\n\n S. Goyette, Sherbrooke 2016/2017\n\n@article{Shpak1995,\n author = {Shpak, Alexander},\n title = {Global Optimization in One-Dimensional Case Using Analytically Defined Derivatives of Objective Function},\n journal = {Computer Science Journal of Moldova},\n year = {1995},\n volume = {3},\n number = {2},\n pages = {168--184},\n url = {http://www.math.md/publications/csjm/issues/v3-n2/7902/}\n}\n
328false5falsetrueaircrftatruefalsetruetrueothergeneral-Inf0truemissingunknownhttps://www.osti.gov/biblio/6449249, https://bitbucket.org/optrove/sif/src/master/AIRCRFTA.SIFThe aircraft stability problem by Rheinboldt, as a function\nof the elevator, aileron and rudder deflection controls.\n\nclassification NOR2-RN-8-5\nProblem 9 in\nJ.J. More',"A collection of nonlinear model problems"\nProceedings of the AMS-SIAM Summer Seminar on the Computational\nSolution of Nonlinear Systems of Equations, Colorado, 1988.\nArgonne National Laboratory MCS-P60-0289, 1989.\n\nSIF input: Ph. Toint, Dec 1989.\n@article{More1990,\n title = {A collection of nonlinear model problems. Computational Solution of Nonlinear Systems of Equations},\n author = {Mor{\\'e}, Jorge J.},\n journal = {Lectures in Applied Mathematics},\n volume = {26},\n pages = {723--762},\n year = {1990},\n publisher = {American Mathematical Society}\n}\nCUTEst:AIRCRFTA
334false3falsetrueallinitfalsefalsefalsefalseotherlinear-InfInfmissingmissingunknownhttps://bitbucket.org/optrove/sif/src/master/ALLINIT.SIFA problem with "all in it". Intended to verify that changes\nto LANCELOT are safe.\n\nclassification OBR2-AY-4-0\nN. Gould, private communication.\n\nSIF input: Nick Gould, June 1990.\n@article{Gould2015CUTEst,\n author = {Gould, N. I. M. and Orban, D. and Toint, Ph. L.},\n title = {{CUTEst}: a Constrained and Unconstrained Testing Environment with safe threads for mathematical optimization},\n journal = {Computational Optimization and Applications},\n year = {2015},\n volume = {60},\n number = {3},\n pages = {545--557},\n doi = {10.1007/s10589-014-9687-3}\n}\nCUTEst:ALLINIT
344false4falsetrueallinitcfalsefalsefalsefalseothergeneral-InfInfmissingmissingunknownhttps://bitbucket.org/optrove/sif/src/master/ALLINITC.SIFA problem with "all in it". Intended to verify that changes\nto LANCELOT are safe.\n\nclassification OOR2-AY-4-1\nN. Gould: private communication.\n\nSIF input: Nick Gould, June 1990.\n@article{Gould2015CUTEst,\n author = {Gould, N. I. M. and Orban, D. and Toint, Ph. L.},\n title = {{CUTEst}: a Constrained and Unconstrained Testing Environment with safe threads for mathematical optimization},\n journal = {Computational Optimization and Applications},\n year = {2015},\n volume = {60},\n number = {3},\n pages = {545--557},\n doi = {10.1007/s10589-014-9687-3}\n}\nCUTEst:ALLINITC
354false0falsetrueallinitufalsefalsefalsefalseotherunconstrained-Inf13.0truemissingunknownhttps://bitbucket.org/optrove/sif/src/master/ALLINITU.SIFA problem with "all in it". Intended to verify that changes\nto LANCELOT are safe.\n\nclassification OUR2-AY-4-0\nN. Gould, private communication.\n\nSIF input: Nick Gould, June 1990.\n@article{Gould2015CUTEst,\n author = {Gould, N. I. M. and Orban, D. and Toint, Ph. L.},\n title = {{CUTEst}: a Constrained and Unconstrained Testing Environment with safe threads for mathematical optimization},\n journal = {Computational Optimization and Applications},\n year = {2015},\n volume = {60},\n number = {3},\n pages = {545--557},\n doi = {10.1007/s10589-014-9687-3}\n}\nCUTEst:ALLINITU
362false3falsetruealsotamefalsefalsefalsefalseothergeneral-InfInfmissingmissingunknownhttps://bitbucket.org/optrove/sif/src/master/ALSOTAME.SIFAnother simple constrained problem\n\nclassification OOR2-AN-2-1\nA.R. Conn, N. Gould and Ph.L. Toint,\n"The LANCELOT User's Manual",\nDept of Maths, FUNDP, 1991.\n\nSIF input: Ph. Toint, Jan 1991.\n@techreport{ConnGouldToint1991,\n author = {Conn, A. R. and Gould, N. I. M. and Toint, Ph. L.},\n title = {{The LANCELOT User's Manual}},\n institution = {Department of Mathematics, FUNDP},\n year = {1991},\n address = {Namur, Belgium},\n note = {Technical report}\n}CUTEst:ALSOTAME
373false15falsetrueargausstruefalsefalsefalseothergeneral-InfInfmissingmissingunknownhttps://doi.org/10.1145/355934.355936, https://bitbucket.org/optrove/sif/src/master/ARGAUSS.SIFSIF input: Ph. Toint, Dec 1989.\n\nMore''s gaussian problem in 3 variables\n\nclassification NOR2-AN-3-15\nProblem 9 in\nJ.J. More', B.S. Garbow and K.E. Hillstrom,\n"Testing Unconstrained Optimization Software",\nACM Transactions on Mathematical Software, vol. 7(1), pp. 17-41, 1981.\nSee also Buckley#28\n\nSIF input: Ph. Toint, Dec 1989.\n@article{MoreGarbowHillstrom1981,\n author = {Mor{\\'e}, Jorge J. and Garbow, Burton S. and Hillstrom, Kenneth E.},\n title = {Testing Unconstrained Optimization Software},\n journal = {ACM Transactions on Mathematical Software},\n year = {1981},\n volume = {7},\n number = {1},\n pages = {17--41},\n doi = {10.1145/355934.355936}\n} \nCUTEst:ARGAUSS
38100true0falsetruearglinafalsefalsefalsefalseleast_squaresunconstrained-Inf500.0truemissingunknownhttps://doi.org/10.1145/355934.355936, https://bitbucket.org/optrove/sif/src/master/ARGLINA.SIFLinear function - full rank\n\nclassification SUR2-AN-V-0\nProblem 32 in\nJ.J. More', B.S. Garbow and K.E. Hillstrom,\n"Testing Unconstrained Optimization Software",\nACM Transactions on Mathematical Software, vol. 7(1), pp. 17-41, 1981.\nSee also Buckley#80 (with different N and M)\n\nSIF input: Ph. Toint, Dec 1989.\n@article{MoreGarbowHillstrom1981,\n author = {Mor{\\'e}, Jorge J. and Garbow, Burton S. and Hillstrom, Kenneth E.},\n title = {Testing Unconstrained Optimization Software},\n journal = {ACM Transactions on Mathematical Software},\n year = {1981},\n volume = {7},\n number = {1},\n pages = {17--41},\n doi = {10.1145/355934.355936}\n} \nCUTEst:ARGLINA
39100true0falsetruearglinbfalsefalsefalsefalseleast_squaresunconstrained-Inf6.85174e13truemissingunknownhttps://doi.org/10.1145/355934.355936, https://bitbucket.org/optrove/sif/src/master/ARGLINB.SIFLinear function - rank 1\n\nclassification SUR2-AN-V-0\nProblem 33 in\nJ.J. More', B.S. Garbow and K.E. Hillstrom,\n"Testing Unconstrained Optimization Software",\nACM Transactions on Mathematical Software, vol. 7(1), pp. 17-41, 1981.\nSee also Buckley#93 (with different N and M)\n\nSIF input: Ph. Toint, Dec 1989.\n@article{MoreGarbowHillstrom1981,\n author = {Mor{\\'e}, Jorge J. and Garbow, Burton S. and Hillstrom, Kenneth E.},\n title = {Testing Unconstrained Optimization Software},\n journal = {ACM Transactions on Mathematical Software},\n year = {1981},\n volume = {7},\n number = {1},\n pages = {17--41},\n doi = {10.1145/355934.355936}\n} \nCUTEst:ARGLINB
40100true0falsetruearglincfalsefalsefalsefalseotherunconstrained-Inf6.38544e13truemissingunknownhttps://doi.org/10.1145/355934.355936, https://bitbucket.org/optrove/sif/src/master/ARGLINC.SIFLinear function - rank 1, zero columns and rows\n\nclassification SUR2-AN-V-0\nProblem 34 in\nJ.J. More', B.S. Garbow and K.E. Hillstrom,\n"Testing Unconstrained Optimization Software",\nACM Transactions on Mathematical Software, vol. 7(1), pp. 17-41, 1981.\nSee also Buckley#101 (with different N and M)\n\nSIF input: Ph. Toint, Dec 1989.\n@article{MoreGarbowHillstrom1981,\n author = {Mor{\\'e}, Jorge J. and Garbow, Burton S. and Hillstrom, Kenneth E.},\n title = {Testing Unconstrained Optimization Software},\n journal = {ACM Transactions on Mathematical Software},\n year = {1981},\n volume = {7},\n number = {1},\n pages = {17--41},\n doi = {10.1145/355934.355936}\n} \nCUTEst:ARGLINC
41100true0falsetrueargtrigfalsefalsefalsefalseotherunconstrained-Inf0.0truemissingunknownhttps://doi.org/10.1145/355934.355936, https://bitbucket.org/optrove/sif/src/master/ARGTRIG.SIFVariable dimension trigonometric problem\nThis problem is a sum of n least-squares groups, each of\nwhich has n+1 nonlinear elements. Its Hessian matrix is dense.\n\nclassification NOR2-AN-V-V\nproblem 101 in\n A.R. Buckley,\n "Test functions for unconstrained minimization",\n TR 1989CS-3, Mathematics, statistics and computing centre,\n Dalhousie University, Halifax (CDN), 1989.\n\nProblem 26 in\nJ.J. More', B.S. Garbow and K.E. Hillstrom,\n"Testing Unconstrained Optimization Software",\nACM Transactions on Mathematical Software, vol. 7(1), pp. 17-41, 1981.\n\nSIF input: Ph. Toint, Dec 1989.\n@article{MoreGarbowHillstrom1981,\n author = {Mor{\\'e}, Jorge J. and Garbow, Burton S. and Hillstrom, Kenneth E.},\n title = {Testing Unconstrained Optimization Software},\n journal = {ACM Transactions on Mathematical Software},\n year = {1981},\n volume = {7},\n number = {1},\n pages = {17--41},\n doi = {10.1145/355934.355936}\n} \nCUTEst:ARGTRIG
42100true0falsetruearwheadfalsefalsefalsefalseotherunconstrained-Inf297.0truemissingunknownhttp://www.cs.cas.cz/matonoha/download/V1081.pdf, https://bitbucket.org/optrove/sif/src/master/ARWHEAD.SIFArrow head problem.\nA quartic problem whose Hessian is an arrow-head (downwards) with\ndiagonal central part and border-width of 1.\n\nclassification OUR2-AN-V-0\nProblem 55 in\nA.R. Conn, N.I.M. Gould, M. Lescrenier and Ph.L. Toint,\nPerformance of a multifrontal scheme for partially separable\noptimization,\nReport 88/4, Dept of Mathematics, FUNDP (Namur, B), 1988.\nSIF input: Ph. Toint, Dec 1989.\n\nSee also\n\nproblem 1 in\nL. Luksan, C. Matonoha and J. Vlcek\nModified CUTE problems for sparse unconstrained optimization,\nTechnical Report 1081,\nInstitute of Computer Science,\nAcademy of Science of the Czech Republic\n\nD. Orban, Montreal, 08/2015.\n@techreport{ConnGouldLescrenierToint1988,\n author = {Conn, A. R. and Gould, N. I. M. and Lescrenier, M. and Toint, Ph. L.},\n title = {Performance of a multifrontal scheme for partially separable optimization},\n institution = {Department of Mathematics, FUNDP},\n address = {Namur, Belgium},\n number = {Report 88/4},\n year = {1988}\n} \nCUTEst:ARWHEAD, Luksan:1
43100true0falsetrueauglagfalsefalsefalsefalseotherunconstrained-InfInfmissingmissingliteraturehttps://www.researchgate.net/publication/325314400_Sparse_Test_Problems_for_Unconstrained_OptimizationAugmented Lagrangian function\n\nProblem 11 in\nL. Luksan, C. Matonoha and J. Vlcek\nSparse Test Problems for Unconstrained Optimization,\nTechnical Report 1064,\nInstitute of Computer Science,\nAcademy of Science of the Czech Republic\n\nhttps://www.researchgate.net/publication/325314400_Sparse_Test_Problems_for_Unconstrained_Optimization\n\n@techreport{LuksanMatonohaVlcek2010Sparse,\n author = {Luksan, Ladislav and Matonoha, Ctirad and Vlcek, Jan},\n title = {Sparse Test Problems for Unconstrained Optimization},\n institution = {Institute of Computer Science, Academy of Sciences of the Czech Republic},\n number = {V-1064},\n year = {2010},\n address = {Prague, Czech Republic},\n url = {https://www.researchgate.net/publication/325314400_Sparse_Test_Problems_for_Unconstrained_Optimization}\n }\n LuksanSparse:11
4449false15falsetrueavion2truefalsetruefalseleast_squareslinear-InfInfmissingmissingunknownhttps://bitbucket.org/optrove/sif/src/master/AVION2.SIFDassault France avion (airplane design) problem\n\nclassification OLR2-RN-49-15\nSIF input: A. R. Conn, June 1993.\n@article{Gould2015CUTEst,\n author = {Gould, N. I. M. and Orban, D. and Toint, Ph. L.},\n title = {{CUTEst}: a Constrained and Unconstrained Testing Environment with safe threads for mathematical optimization},\n journal = {Computational Optimization and Applications},\n year = {2015},\n volume = {60},\n number = {3},\n pages = {545--557},\n doi = {10.1007/s10589-014-9687-3}\n}\nCUTEst:AVION2
453false0falsetruebardfalsefalsefalsefalseleast_squaresunconstrained-Inf500.0truemissingunknownhttps://bitbucket.org/optrove/sif/src/master/BARD.SIFBard problem in 3 variables.\nThis function is a nonlinear least squares with 15 groups.\nEach group has a linear and a nonlinear element.\n\nclassification SUR2-AN-3-0\nProblem 8 in\n J.J. More', B.S. Garbow and K.E. Hillstrom,\n "Testing Unconstrained Optimization Software",\n ACM Transactions on Mathematical Software, vol. 7(1), pp. 17-41, 1981.\n\nProblem 3 in\nJ.J. More', B.S. Garbow and K.E. Hillstrom,\n"Testing Unconstrained Optimization Software",\nACM Transactions on Mathematical Software, vol. 7(1), pp. 17-41, 1981.\nSee also Buckley#16.\n\nSIF input: Ph. Toint, Dec 1989.\n@article{MoreGarbowHillstrom1981,\n author = {Mor{\\'e}, Jorge J. and Garbow, Burton S. and Hillstrom, Kenneth E.},\n title = {Testing Unconstrained Optimization Software},\n journal = {ACM Transactions on Mathematical Software},\n year = {1981},\n volume = {7},\n number = {1},\n pages = {17--41},\n doi = {10.1145/355934.355936}\n} \n CUTEst:BARD
46100true0falsetruebdqrticfalsefalsefalsefalseleast_squaresunconstrained-Inf21696.0truemissingunknownhttps://bitbucket.org/optrove/sif/src/master/BDQRTIC.SIFThis problem is quartic and has a banded Hessian with bandwidth = 9\n\nclassification SUR2-AN-V-0\nProblem 61 in\nA.R. Conn, N.I.M. Gould, M. Lescrenier and Ph.L. Toint,\nPerformance of a multifrontal scheme for partially separable\noptimization,\nReport 88/4, Dept of Mathematics, FUNDP (Namur, B), 1988.\n\nSee also\n\nproblem 2 in\nL. Luksan, C. Matonoha and J. Vlcek\nModified CUTE problems for sparse unconstrained optimization,\nTechnical Report 1081,\nInstitute of Computer Science,\nAcademy of Science of the Czech Republic\n\nhttp://www.cs.cas.cz/matonoha/download/V1081.pdf\n\nSIF input: Ph. Toint, Dec 1989.\n\nD. Orban, Montreal, 08/2015.\n@techreport{ConnGouldLescrenierToint1988,\n author = {Conn, A. R. and Gould, N. I. M. and Lescrenier, M. and Toint, Ph. L.},\n title = {Performance of a multifrontal scheme for partially separable optimization},\n institution = {Department of Mathematics, FUNDP},\n address = {Namur, Belgium},\n number = {Report 88/4},\n year = {1988}\n} \n CUTEst:BDQRTIC, Luksan:2
472false0falsetruebealefalsefalsefalsefalseleast_squaresunconstrained-Inf14.2031truemissingunknownhttps://bitbucket.org/optrove/sif/src/master/BEALE.SIFBeale problem in 2 variables\n\nclassification SUR2-AN-2-0\n\nA. Cebola, Curitiba 10/2016.\nProblem 5 in\nJ.J. More', B.S. Garbow and K.E. Hillstrom,\n"Testing Unconstrained Optimization Software",\nACM Transactions on Mathematical Software, vol. 7(1), pp. 17-41, 1981.\nSee also Buckley#89.\n\nSIF input: Ph. Toint, Dec 1989.\n@article{MoreGarbowHillstrom1981,\n author = {Mor{\\'e}, Jorge J. and Garbow, Burton S. and Hillstrom, Kenneth E.},\n title = {Testing Unconstrained Optimization Software},\n journal = {ACM Transactions on Mathematical Software},\n year = {1981},\n volume = {7},\n number = {1},\n pages = {17--41},\n doi = {10.1145/355934.355936}\n} \n CUTEst:BEALE
48100true0falsetruebearingfalsefalsetruetrueotherunconstrained-Inf15.0662truemissingunknownhttps://doi.org/10.2172/834714Given observations of ns stages of a bearing species over n timesteps, \nminimize the loss between the observation and the computed law of paraneters : growth, mortality and number of specimens (g,m,x)\n\nclassification OOR2-AN-V-V\nThis is problem 16 in the COPS (Version 3) collection of \nE. Dolan and J. More'\nsee "Benchmarking Optimization Software with COPS"\nArgonne National Labs Technical Report ANL/MCS-246 (2004)\n\nJournal bearing problem\nMichael Merritt - Summer 2000\nCOPS 2.0 - September 2000\nCOPS 3.0 - November 2002\nCOPS 3.1 - March 2004\n@techreport{DolanMore2004COPS,\n author = {Dolan, Elizabeth D. and Mor{'e}, Jorge J.},\n title = {Benchmarking Optimization Software with {COPS} 3.0},\n institution = {Argonne National Laboratory},\n number = {ANL/MCS-TM-273},\n year = {2004},\n doi = {10.2172/834714}\n }\n COPS:16
493false0falsetruebennett5falsefalsefalsefalseleast_squaresunconstrained-Inf500.0truemissingunknownhttps://bitbucket.org/optrove/sif/src/master/BENNETT5.SIFhttps://www.itl.nist.gov/div898/strd/nls/data/LINKS/DATA/bennett5.dat\n\nNIST/ITL StRD\nDataset Name: Bennett5 (Bennett5.dat)\n\nFile Format: ASCII\n Starting Values (lines 41 to 43)\n Certified Values (lines 41 to 48)\n Data (lines 61 to 214)\n\nProcedure: Nonlinear Least Squares Regression\n\nDescription: These data are the result of a NIST study involving\n superconductivity magnetization modeling. The\n response variable is magnetism, and the predictor\n variable is the log of time in minutes.\n\nReference: Bennett, L., L. Swartzendruber, and H. Brown, \n NIST (1994). \n Superconductivity Magnetization Modeling.\n\nData: 1 Response Variable (y = magnetism)\n 1 Predictor Variable (x = log[time])\n 154 Observations\n Higher Level of Difficulty\n Observed Data\n\nModel: Miscellaneous Class\n 3 Parameters (b1 to b3)\n\n y = b1 * (b2+x)**(-1/b3) + e\nT. Migot, Montreal, 2023.\n\nNIST Data fitting problem BENNETT5 given as an inconsistent set of\nnonlinear equations.\nFit: y = b1 * (b2+x)**(-1/b3) + e\n\nclassification NOR2-MN-3-154\nProblem from the NIST nonlinear regression test set\nhttp://www.itl.nist.gov/div898/strd/nls/nls_main.shtml\nReference:\tBennett, L., L. Swartzendruber, H. Brown, NIST (1994).\nSuperconductivity Magnetization Modeling.\n\nSIF input: Nick Gould and Tyrone Rees, Oct 2015\n@misc{NISTStRD,\n author = {{National Institute of Standards and Technology}},\n title = {{NIST/ITL StRD}: Nonlinear Regression Reference Datasets},\n howpublished = {\\url{https://www.itl.nist.gov/div898/strd/nls/nls_main.shtml}},\n year = {1997}\n}\nCUTEst:BENNETT5, NIST:Bennett5
506false0falsetruebiggs5falsefalsetruetrueotherunconstrained-Inf-3.15621truemissingunknownhttps://bitbucket.org/optrove/sif/src/master/BIGGS5.SIFBiggs problem in 5 variables.\nThis function is a nonlinear least squares with 13 groups. It is a\nvariation on the biggs6 problem where the 6-th variable is fixed to 3.\n\nBiggs EXP problem in 5 variables\n\nclassification SXR2-AN-6-0\nInspited by problem 18 in\n J.J. More', B.S. Garbow and K.E. Hillstrom,\n "Testing Unconstrained Optimization Software",\n ACM Transactions on Mathematical Software, vol. 7(1), pp. 17-41, 1981.\n\nProblem 74 in\nA.R. Buckley,\n"Test functions for unconstrained minimization",\nTR 1989CS-3, Mathematics, statistics and computing centre,\nDalhousie University, Halifax (CDN), 1989.\n\nSIF input: Ph. Toint, Dec 1989.\n@article{MoreGarbowHillstrom1981,\n author = {Mor{\\'e}, Jorge J. and Garbow, Burton S. and Hillstrom, Kenneth E.},\n title = {Testing Unconstrained Optimization Software},\n journal = {ACM Transactions on Mathematical Software},\n year = {1981},\n volume = {7},\n number = {1},\n pages = {17--41},\n doi = {10.1145/355934.355936}\n} \n CUTEst:BIGGS5
516false0falsetruebiggs6falsefalsefalsefalseotherunconstrained-Inf-3.15621truemissingunknownhttps://bitbucket.org/optrove/sif/src/master/BIGGS6.SIFBiggs EXP problem in 6 variables\n\nclassification SUR2-AN-6-0\nproblem 18 in\nJ.J. More', B.S. Garbow and K.E. Hillstrom,\n"Testing Unconstrained Optimization Software",\nACM Transactions on Mathematical Software, vol. 7(1), pp. 17-41, 1981.\n\nProblem 21 in\nA.R. Buckley,\n"Test functions for unconstrained minimization",\nTR 1989CS-3, Mathematics, statistics and computing centre,\nDalhousie University, Halifax (CDN), 1989.\n\nSIF input: Ph. Toint, Dec 1989.\n@article{MoreGarbowHillstrom1981,\n author = {Mor{\\'e}, Jorge J. and Garbow, Burton S. and Hillstrom, Kenneth E.},\n title = {Testing Unconstrained Optimization Software},\n journal = {ACM Transactions on Mathematical Software},\n year = {1981},\n volume = {7},\n number = {1},\n pages = {17--41},\n doi = {10.1145/355934.355936}\n} \n CUTEst:BIGGS6
522false2falsetrueboothtruefalsefalsefalseotherlinear-InfInfmissingmissingunknownhttps://bitbucket.org/optrove/sif/src/master/BOOTH.SIFSIF input: Ph. Toint, Dec 1989.\n\nBooth quadratic problem in 2 variables.\n\nclassification NLR2-AN-2-2\nProblem 36 in\nA.R. Buckley,\n"Test functions for unconstrained minimization",\nTR 1989CS-3, Mathematics, statistics and computing centre,\nDalhousie University, Halifax (CDN), 1989.\n\nSIF input: Ph. Toint, Dec 1989.\n@techreport{Buckley1989,\n author = {Buckley, A. R.},\n title = {Test Functions for Unconstrained Minimization},\n institution = {Mathematics, Statistics and Computing Centre, Dalhousie University},\n number = {TR 1989CS-3},\n year = {1989},\n address = {Halifax, Canada}\n}\n CUTEst:BOOTH
53100true0falsetrueboundaryfalsefalsefalsefalseleast_squaresunconstrained-InfInftruemissingacademichttps://www.researchgate.net/publication/325314400_Sparse_Test_Problems_for_Unconstrained_OptimizationDiscrete boundary value problem\nProblem 14 in\nL. Luksan, C. Matonoha and J. Vlcek\nSparse Test Problems for Unconstrained Optimization,\nTechnical Report 1064,\nInstitute of Computer Science,\nAcademy of Science of the Czech Republic\n@techreport{LuksanMatonohaVlcek2010Sparse,\n author = {Luksan, Ladislav and Matonoha, Ctirad and Vlcek, Jan},\n title = {Sparse Test Problems for Unconstrained Optimization},\n institution = {Institute of Computer Science, Academy of Sciences of the Czech Republic},\n number = {V-1064},\n year = {2010},\n address = {Prague, Czech Republic},\n url = {https://www.researchgate.net/publication/325314400_Sparse_Test_Problems_for_Unconstrained_Optimization}\n }\n LuksanSparse:14
542false0falsetrueboxbodfalsefalsefalsefalseleast_squaresunconstrained-Inf500.0truemissingunknownhttps://bitbucket.org/optrove/sif/src/master/BOXBOD.SIFhttps://www.itl.nist.gov/div898/strd/nls/data/LINKS/DATA/boxbod.dat\n\nNIST/ITL StRD\nDataset Name: BoxBOD (BoxBOD.dat)\n\nFile Format: ASCII\n Starting Values (lines 41 to 42)\n Certified Values (lines 41 to 47)\n Data (lines 61 to 66)\n\nProcedure: Nonlinear Least Squares Regression\n\nDescription: These data are described in detail in Box, Hunter and\n Hunter (1978). The response variable is biochemical\n oxygen demand (BOD) in mg/l, and the predictor\n variable is incubation time in days.\n\nReference: Box, G. P., W. G. Hunter, and J. S. Hunter (1978).\n Statistics for Experimenters. \n New York, NY: Wiley, pp. 483-487.\n\nData: 1 Response (y = biochemical oxygen demand)\n 1 Predictor (x = incubation time)\n 6 Observations\n Higher Level of Difficulty\n Observed Data\n\nModel: Exponential Class\n 2 Parameters (b1 and b2)\n\n y = b1*(1-exp[-b2*x]) + e\nT. Migot, Montreal, 2023.\n\nNIST Data fitting problem BOXBOD given as an inconsistent set of \nnonlinear equations\nFit: y = b1*(1-exp[-b2*x]) + e\n\nclassification NOR2-MN-2-6\nProblem from the NIST nonlinear regression test set\nhttp://www.itl.nist.gov/div898/strd/nls/nls_main.shtml\nReference: Box, G. P., W. G. Hunter, and J. S. Hunter (1978).\nStatistics for Experimenters, New York, NY: Wiley, pp. 483-487.\n\nSIF input: Nick Gould and Tyrone Rees, Oct 2015\n@book{BoxHunterHunter1978,\n author = {Box, George E. P. and Hunter, William G. and Hunter, J. Stuart},\n title = {Statistics for Experimenters: An Introduction to Design, Data Analysis, and Model Building},\n publisher = {John Wiley \\& Sons},\n address = {New York},\n year = {1978}\n}\nCUTEst:BOXBOD, NIST:BoxBOD
551false1falsetruebqp1varfalsetruefalsefalseotherlinear-Inf0.3125truemissingunknownhttps://bitbucket.org/optrove/sif/src/master/BQP1VAR.SIFclassification QBR2-AN-1-0\na one variable box-constrained quadratic\n\nSIF input: Nick Gould, March 1992\n@article{Gould2015CUTEst,\n author = {Nicholas I. M. Gould and Dominique Orban and Philippe L. Toint},\n title = {{CUTEst}: a constrained and unconstrained testing environment with safe threads for mathematical optimization},\n journal = {ACM Transactions on Mathematical Software},\n volume = {40},\n number = {3},\n year = {2015},\n pages = {1--25},\n doi = {10.1145/2786885}\n} \n CUTEst:BQP1VAR
56450false360falsetruebritgastruefalsetruefalseothergeneral-InfInfmissingmissingunknownhttps://bitbucket.org/optrove/sif/src/master/BRITGAS.SIFA simple high pressure gas network problem for British Gas.\nInvented Data, but real network.\n23 node network, 8 hour operation.\n\nclassification OOI2-RN-450-360\nN. Gould, private communication,March 1990.\n\nSIF input: N. Gould, March 1990.\n@article{Gould2015CUTEst,\n author = {Nicholas I. M. Gould and Dominique Orban and Philippe L. Toint},\n title = {{CUTEst}: a constrained and unconstrained testing environment with safe threads for mathematical optimization},\n journal = {ACM Transactions on Mathematical Software},\n volume = {40},\n number = {3},\n year = {2015},\n pages = {1--25},\n doi = {10.1145/2786885}\n} \n CUTEst:BRITGAS
57100true0falsetruebrownalfalsefalsefalsefalseleast_squaresunconstrained-Inf0.0truemissingunknownhttps://bitbucket.org/optrove/sif/src/master/BROWNAL.SIFThe Brown almost linear problem in variable dimension. This is a nonlinear\nleast-squares problems with n groups.\n\nclassification SUR2-AN-V-0\nProblem 27 in\nJ.J. More', B.S. Garbow and K.E. Hillstrom,\n"Testing Unconstrained Optimization Software",\nACM Transactions on Mathematical Software, vol. 7(1), pp. 17-41, 1981.\nSee also Buckley#79\n\nSIF input: Ph. Toint, Dec 1989.\n@article{MoreGarbowHillstrom1981,\n author = {Mor{\\'e}, Jorge J. and Garbow, Burton S. and Hillstrom, Kenneth E.},\n title = {Testing Unconstrained Optimization Software},\n journal = {ACM Transactions on Mathematical Software},\n year = {1981},\n volume = {7},\n number = {1},\n pages = {17--41},\n doi = {10.1145/355934.355936}\n} \n CUTEst:BROWNAL
582false0falsetruebrownbsfalsefalsefalsefalseleast_squaresunconstrained-Inf9.99998e11truemissingunknownhttps://bitbucket.org/optrove/sif/src/master/BROWNBS.SIFBrown badly scaled problem in 2 variables.\nThis problem is a sum of n-1 sets of 3 groups, one of then involving\na nonlinear element and all being of the least square type.\nIt Hessian matrix is tridiagonal.\n\nclassification SUR2-AN-2-0\n\nA. Cebola, Curitiba 10/2016.\nProblem 4 in\nJ.J. More', B.S. Garbow and K.E. Hillstrom,\n"Testing Unconstrained Optimization Software",\nACM Transactions on Mathematical Software, vol. 7(1), pp. 17-41, 1981.\nSee also Buckley#25\n\nSIF input: Ph. Toint, Dec 1989.\n@article{MoreGarbowHillstrom1981,\n author = {Mor{\\'e}, Jorge J. and Garbow, Burton S. and Hillstrom, Kenneth E.},\n title = {Testing Unconstrained Optimization Software},\n journal = {ACM Transactions on Mathematical Software},\n year = {1981},\n volume = {7},\n number = {1},\n pages = {17--41},\n doi = {10.1145/355934.355936}\n} \n CUTEst:BROWNBS
594false0falsetruebrowndenfalsefalsefalsefalseleast_squaresunconstrained-Inf7.92669e6truemissingunknownhttps://bitbucket.org/optrove/sif/src/master/BROWNDEN.SIFBrown and Dennis function\n\nclassification SUR2-AN-4-0\nProblem 16 in\nJ.J. More', B.S. Garbow and K.E. Hillstrom,\n"Testing Unconstrained Optimization Software",\nACM Transactions on Mathematical Software, vol. 7(1), pp. 17-41, 1981.\nSee also Buckley#30\n\nSIF input: Ph. Toint, Dec 1989.\n@article{MoreGarbowHillstrom1981,\n author = {Mor{\\'e}, Jorge J. and Garbow, Burton S. and Hillstrom, Kenneth E.},\n title = {Testing Unconstrained Optimization Software},\n journal = {ACM Transactions on Mathematical Software},\n year = {1981},\n volume = {7},\n number = {1},\n pages = {17--41},\n doi = {10.1145/355934.355936}\n} \n CUTEst:BROWNDEN
60100true0falsetruebrowngen1falsefalsefalsefalseotherunconstrained-InfInfmissingmissingliteraturehttps://www.researchgate.net/publication/325314400_Sparse_Test_Problems_for_Unconstrained_OptimizationGeneralization of the Brown function 1\n\nProblem 12 in\nL. Luksan, C. Matonoha and J. Vlcek\nSparse Test Problems for Unconstrained Optimization,\nTechnical Report 1064,\nInstitute of Computer Science,\nAcademy of Science of the Czech Republic\n\nhttps://www.researchgate.net/publication/325314400_Sparse_Test_Problems_for_Unconstrained_Optimization\n\n@techreport{LuksanMatonohaVlcek2010Sparse,\n author = {Luksan, Ladislav and Matonoha, Ctirad and Vlcek, Jan},\n title = {Sparse Test Problems for Unconstrained Optimization},\n institution = {Institute of Computer Science, Academy of Sciences of the Czech Republic},\n number = {V-1064},\n year = {2010},\n address = {Prague, Czech Republic},\n url = {https://www.researchgate.net/publication/325314400_Sparse_Test_Problems_for_Unconstrained_Optimization}\n }\n LuksanSparse:12
61100true0falsetruebrowngen2falsefalsefalsefalseotherunconstrained-InfInfmissingmissingliteraturehttps://www.researchgate.net/publication/325314400_Sparse_Test_Problems_for_Unconstrained_OptimizationGeneralization of the Brown function 2\n\nProblem 13 in\nL. Luksan, C. Matonoha and J. Vlcek\nSparse Test Problems for Unconstrained Optimization,\nTechnical Report 1064,\nInstitute of Computer Science,\nAcademy of Science of the Czech Republic\n\nhttps://www.researchgate.net/publication/325314400_Sparse_Test_Problems_for_Unconstrained_Optimization\n\n@techreport{LuksanMatonohaVlcek2010Sparse,\n author = {Luksan, Ladislav and Matonoha, Ctirad and Vlcek, Jan},\n title = {Sparse Test Problems for Unconstrained Optimization},\n institution = {Institute of Computer Science, Academy of Sciences of the Czech Republic},\n number = {V-1064},\n year = {2010},\n address = {Prague, Czech Republic},\n url = {https://www.researchgate.net/publication/325314400_Sparse_Test_Problems_for_Unconstrained_Optimization}\n }\n LuksanSparse:13
62100true0falsetruebroyden3dfalsefalsefalsefalseleast_squaresunconstrained-Inf0.0truemissingunknownhttps://doi.org/10.1145/355934.355936Broyden tridiagonal problem in variable dimension. This is a nonlinear\nleast-squares problem with n groups.\nProblem 30 in\n J.J. More', B.S. Garbow and K.E. Hillstrom,\n "Testing Unconstrained Optimization Software",\n ACM Transactions on Mathematical Software, vol. 7(1), pp. 17-41, 1981.\nAlso problem 78 in \n A.R. Buckley,\n "Test functions for unconstrained minimization",\n TR 1989CS-3, Mathematics, statistics and computing centre,\n Dalhousie University, Halifax (CDN), 1989.\n@article{MoreGarbowHillstrom1981,\n author = {Mor{\\'e}, Jorge J. and Garbow, Burton S. and Hillstrom, Kenneth E.},\n title = {Testing Unconstrained Optimization Software},\n journal = {ACM Transactions on Mathematical Software},\n year = {1981},\n volume = {7},\n number = {1},\n pages = {17--41},\n doi = {10.1145/355934.355936}\n} \n MGH:30
63100true0falsetruebroyden7dfalsefalsefalsefalseleast_squaresunconstrained-InfInfmissingmissingliteraturehttps://www.researchgate.net/publication/325314400_Sparse_Test_Problems_for_Unconstrained_OptimizationSeven diagonal generalization of the Broyden tridiagonal function\n\nProblem 7 in\nL. Luksan, C. Matonoha and J. Vlcek\nSparse Test Problems for Unconstrained Optimization,\nTechnical Report 1064,\nInstitute of Computer Science,\nAcademy of Science of the Czech Republic\n\nhttps://www.researchgate.net/publication/325314400_Sparse_Test_Problems_for_Unconstrained_Optimization\n\n@techreport{LuksanMatonohaVlcek2010Sparse,\n author = {Luksan, Ladislav and Matonoha, Ctirad and Vlcek, Jan},\n title = {Sparse Test Problems for Unconstrained Optimization},\n institution = {Institute of Computer Science, Academy of Sciences of the Czech Republic},\n number = {V-1064},\n year = {2010},\n address = {Prague, Czech Republic},\n url = {https://www.researchgate.net/publication/325314400_Sparse_Test_Problems_for_Unconstrained_Optimization}\n }\n LuksanSparse:7
64100true0falsetruebroydn7dfalsefalsefalsefalseotherunconstrained-Inf274.204truemissingunknownhttps://bitbucket.org/optrove/sif/src/master/BROYDN7D.SIFA seven diagonal variant of the Broyden tridiagonal system,\nfeaturing a band far away from the diagonal.\n\nclassification OUR2-AN-V-0\nProblem 3.4 in\nPh. L. Toint,\nSome numerical results using a sparse matrix updating formula in\nunconstrained optimization,\nMathematics of Computation, vol. 32(114), pp. 839-852, 1978.\nhttps://doi.org/10.1090/S0025-5718-1978-0483452-7\n\nFrom the paper,\n\n"This function was built from a nonlinear system of equations\nsuggested originally by Broyden ..."\n\nThe system in question is described in\n\nL. K. Schubert,\nModification of a quasi-Newton method for nonlinear equations\nwith a sparse Jacobian,\nMathematics of Computation, vol. 24, pp. 27-30, 1970.\nhttps://doi.org/10.1090/S0025-5718-1970-0258276-9#sthash.yOkQUwXA.dpuf\n\nSee also, with a slight variation in the formulation,\n\nproblem 3 in\nL. Luksan, C. Matonoha and J. Vlcek\nModified CUTE problems for sparse unconstrained optimization,\nTechnical Report 1081,\nInstitute of Computer Science,\nAcademy of Science of the Czech Republic\n\nhttp://www.cs.cas.cz/matonoha/download/V1081.pdf\n\nSee also Buckley#84\n\nSIF input: Ph. Toint, Dec 1989.\n\nD. Orban, Montreal, 08/2015.\n\n# Note: discrepancy with CUTEst appears to be a bug in CUTEst, this matches the original paper\n# (See issue #36)\n@article{Toint1978MathComp,\n author = {Toint, Ph. L.},\n title = {Some numerical results using a sparse matrix updating formula in unconstrained optimization},\n journal = {Mathematics of Computation},\n year = {1978},\n volume = {32},\n number = {143},\n pages = {839--851},\n doi = {10.1090/s0025-5718-1978-0483452-7}\n} \n CUTEst:BROYDN7D, Luksan:3
65100true0falsetruebrybndfalsefalsefalsefalseleast_squaresunconstrained-Inf3600.0truemissingunknownhttps://bitbucket.org/optrove/sif/src/master/BRYBND.SIFBroyden banded system of nonlinear equations, considered in the\nleast square sense.\n\nclassification SUR2-AN-V-0\n\nD. Orban, Montreal, 08/2015.\n\n# Note: discrepancy with CUTEst appears to be a bug in CUTEst, this matches the original paper\n# (See issue #36)\nproblem 31 in\nJ.J. More', B.S. Garbow and K.E. Hillstrom,\n"Testing Unconstrained Optimization Software",\nACM Transactions on Mathematical Software, vol. 7(1), pp. 17-41, 1981.\nSee also Buckley#73 (p. 41) and Toint#18\nSDIF input: Ph. Toint, Dec 1989.\n@article{MoreGarbowHillstrom1981,\n author = {Mor{\\'e}, Jorge J. and Garbow, Burton S. and Hillstrom, Kenneth E.},\n title = {Testing Unconstrained Optimization Software},\n journal = {ACM Transactions on Mathematical Software},\n year = {1981},\n volume = {7},\n number = {1},\n pages = {17--41},\n doi = {10.1145/355934.355936}\n} \n CUTEst:BRYBND, Luksan:4
662false1falsetruebt1truefalsefalsefalseothergeneral-InfInfmissingmissingunknownhttps://bitbucket.org/optrove/sif/src/master/BT1.SIFclassification QQR2-AN-2-1\n\nA. Cebola, Curitiba 10/2016.\nproblem 13 (p. 103) in\nA.R. Buckley,\n"Test functions for unconstrained minimization",\nTR 1989CS-3, Mathematics, statistics and computing centre,\nDalhousie University, Halifax (CDN), 1989.\n\nProblem from CUTE: https://github.com/mpf/Optimization-Test-Problems/blob/master/cute/bt1.mod\n\nproblem 1 in\nP.T. Boggs and J.W. Tolle,\n"A strategy for global convergence in a sequential \nquadratic programming algorithm",\nSINUM 26(3), pp. 600-623, 1989.\n\nSIF input: Ph. Toint, June 1993.\n@techreport{Buckley1989,\n author = {Buckley, A. R.},\n title = {Test Functions for Unconstrained Minimization},\n institution = {Mathematics, Statistics and Computing Centre, Dalhousie University},\n number = {TR 1989CS-3},\n year = {1989},\n address = {Halifax, Canada}\n}\n CUTEst:BT1
67100true203truetruecamshapefalsetruetruefalseotherquadratic-InfInfmissingmissingunknownhttps://bitbucket.org/optrove/sif/src/master/CAMSHAPE.SIFMaximize the area of the valve opening for one rotation of a convex cam \nwith constraints on the curvature and on the radius of the cam\n\nclassification LOR2-AN-V-V\nThis is problem 3 in the COPS (Version 3) collection of \nE. Dolan and J. More\nsee "Benchmarking Optimization Software with COPS"\nArgonne National Labs Technical Report ANL/MCS-246 (2004)\n\nSIF input: Nick Gould, November 2000\n@techreport{DolanMore2004COPS,\n author = {Dolan, Elizabeth D. and Mor{'e}, Jorge J.},\n title = {Benchmarking Optimization Software with {COPS} 3.0},\n institution = {Argonne National Laboratory},\n number = {ANL/MCS-TM-273},\n year = {2004},\n doi = {10.2172/834714}\n }\n CUTEst:CAMSHAPE, COPS:3
6899true32truetruecatenarytruefalsetruetruelinearquadratic-InfInfmissingmissingacademichttps://bitbucket.org/optrove/sif/src/master/CATENARY.SIFThe classical problem of the hanging catenary. Here the catenary consists\nof N+1 beams of length BL, with the first beam fixed at the origin and\nthe final bean fixed at a fraction FRACT of the total length of all\nbeams.\n\nThe problem is non-convex.\n\nclassification LQR2-AY-V-V\n\nM. Gollier, Montréal, 05/2023\nK. Veselic,\n"De forma catenarum in campo gravitatis pendentium",\nKlasicna Gimnazija u Zagrebu, Zagreb, 1987.\n\nSIF input: Ph. L. Toint, May 1993.\n@book{Veselic1987,\n author = {K. Veselic},\n title = {De forma catenarum in campo gravitatis pendentium},\n publisher = {Klasična Gimnazija u Zagrebu},\n address = {Zagreb},\n year = {1987}\n} \n CUTEst:CATENARY
692302true2002truetruecatmixtruefalsetruefalseothergeneral-Inf0.0truemissingunknownhttps://bitbucket.org/optrove/sif/src/master/CATMIX.SIFCatalyst Mixing Problem\nCollocation formulation\n\nDetermine the optimal mixing policy of two catalysts along the\nlength of a tubular plug flow reactor involving several reactions\n\nclassification OOR2-AN-V-V\nThis is problem 14 in the COPS (Version 2) collection of \nE. Dolan and J. More'\nsee "Benchmarking Optimization Software with COPS"\nArgonne National Labs Technical Report ANL/MCS-246 (2000)\n\nCOPS 3.0 - November 2002\nCOPS 3.1 - March 2004\n\nSIF input: Nick Gould, November 2000\n@techreport{DolanMore2004COPS,\n author = {Dolan, Elizabeth D. and Mor{\\'e}, Jorge J.},\n title = {Benchmarking Optimization Software with {COPS} 3.0},\n institution = {Argonne National Laboratory},\n number = {ANL/MCS-TM-273},\n year = {2004},\n doi = {10.2172/834714}\n} \n CUTEst:CATMIX, COPS:14
70100true77truetruechaintruefalsefalsefalseothergeneral-InfInfmissingmissingunknownhttps://bitbucket.org/optrove/sif/src/master/CHAIN.SIFHanging Chain\n\nFind the chain (of uniform density) of length L suspended between two points with minimal\npotential energy.\n\nclassification OOR2-AN-V-V\nThis is problem 4 in the COPS (Version 3) collection of \nE. Dolan and J. More'\nsee "Benchmarking Optimization Software with COPS"\nArgonne National Labs Technical Report ANL/MCS-246 (2004)\n\nSIF input: Nick Gould, November 2000\n@techreport{DolanMore2004COPS,\n author = {Dolan, Elizabeth D. and Mor{'e}, Jorge J.},\n title = {Benchmarking Optimization Software with {COPS} 3.0},\n institution = {Argonne National Laboratory},\n number = {ANL/MCS-TM-273},\n year = {2004},\n doi = {10.2172/834714}\n }\n CUTEst:CHAIN, COPS:4
71100true0falsetruechainwoofalsefalsefalsefalseleast_squaresunconstrained-Inf3.71954e5truemissingunknownhttps://bitbucket.org/optrove/sif/src/master/CHAINWOO.SIFThe chained Woods problem, a variant on Woods function\nThis problem is a sum of n/2 sets of 6 terms, each of which is\nassigned its own group. For a given set i, the groups are\nA(i), B(i), C(i), D(i), E(i) and F(i). Groups A(i) and C(i) contain 1\nnonlinear element each, denoted Y(i) and Z(i).\nThe problem dimension is defined from the number of these sets.\nThe number of problem variables is then 2 times + 2 as large\nThis version uses a slightly unorthodox expression of Woods\nfunction as a sum of squares (see Buckley)\n\nProblem 8 in\nA. R. Conn, N. I. M. Gould and Ph. L. Toint,\nTesting a class of methods for solving minimization\nproblems with simple bounds on their variables,\nMathematics of Computation 50, p 399-430, 1988.\n\nSee also\n\nproblem 5 in\nL. Luksan, C. Matonoha and J. Vlcek\nModified CUTE problems for sparse unconstrained optimization,\nTechnical Report 1081,\nInstitute of Computer Science,\nAcademy of Science of the Czech Republic\n\nhttp://www.cs.cas.cz/matonoha/download/V1081.pdf\n\nclassification SUR2-AN-V-0\nSIF input: Nick Gould and Ph. Toint, Dec 1995.\n@article{ConnGouldToint1988MathComp,\n author = {Conn, Andrew R. and Gould, Nicholas I. M. and Toint, Philippe L.},\n title = {Testing a class of methods for solving minimization problems with simple bounds on the variables},\n journal = {Mathematics of Computation},\n year = {1988},\n volume = {50},\n number = {182},\n pages = {399--430},\n doi = {10.1090/s0025-5718-1988-0929544-3}\n} \n CUTEst:CHAINWOO, Luksan:5, LuksanSparse:2
7296true96truetruechanneltruefalsefalsefalseothergeneral-InfInfmissingmissingunknownhttps://bitbucket.org/optrove/sif/src/master/CHANNEL.SIFFlow in a Channel\n\nAnalyse the flow of a fluid during injection into a long vertical channel,\nassuming that the flow is modelled by the boundary-value problem\nu'''' = R (u'u'' - u u''') t in [0,1]\nu(0) = 0, u(1) = 1, u'(0) = 0 = u'(1)\nwhere u is the potential function, u' is the tangential velocity of\nthe field, and R is the Reynold's number\n\nclassification NOR2-AN-V-V\nThis is problem 7 in the COPS (Version 3) collection of \nE. Dolan and J. More'\nsee "Benchmarking Optimization Software with COPS"\nArgonne National Labs Technical Report ANL/MCS-246 (2004)\n\nSIF input: Nick Gould, November 2000\n@techreport{DolanMore2004COPS,\n author = {Dolan, Elizabeth D. and Mor{'e}, Jorge J.},\n title = {Benchmarking Optimization Software with {COPS} 3.0},\n institution = {Argonne National Laboratory},\n number = {ANL/MCS-TM-273},\n year = {2004},\n doi = {10.2172/834714}\n }\n CUTEst:CHANNEL, COPS:7
73100true0falsetruechnrosnb_modfalsefalsefalsefalseotherunconstrained-Inf17637.9truemissingunknownhttp://www.cs.cas.cz/matonoha/download/V1081.pdf# Chaineded Rosenbrock - modified function.\n\n# problem 27 in\n# L. Luksan, C. Matonoha and J. Vlcek\n# Modified CUTE problems for sparse unconstrained optimization,\n# Technical Report 1081,\n# Institute of Computer Science,\n# Academy of Science of the Czech Republic\n#\n# http://www.cs.cas.cz/matonoha/download/V1081.pdf\n#\n# classification SUR2-AN-V-0\n#\n# J,-P, Dussault, Rennes 09/2015.\n\n@techreport{LuksanMatonohaVlcek2003,\n author = {Luksan, Ladislav and Matonoha, Cestmir and Vlcek, Jan},\n title = {Modified {CUTE} Problems for Sparse Unconstrained Optimization},\n institution = {Institute of Computer Science, Academy of Sciences of the Czech Republic},\n number = {1081},\n year = {2003},\n address = {Prague, Czech Republic},\n url = {http://www.cs.cas.cz/matonoha/download/V1081.pdf},\n } \n Luksan:27
743false0falsetruechwirut1falsefalsefalsefalseleast_squaresunconstrained-Inf500.0truemissingunknownhttps://bitbucket.org/optrove/sif/src/master/CHWIRUT1.SIFhttps://www.itl.nist.gov/div898/strd/nls/data/LINKS/DATA/chwirut1.dat\n\nNIST/ITL StRD\nDataset Name: Chwirut1 (Chwirut1.dat)\n\nFile Format: ASCII\n Starting Values (lines 41 to 43)\n Certified Values (lines 41 to 48)\n Data (lines 61 to 274)\n\nProcedure: Nonlinear Least Squares Regression\n\nDescription: These data are the result of a NIST study involving\n ultrasonic calibration. The response variable is\n ultrasonic response, and the predictor variable is\n metal distance.\n\nReference: Chwirut, D., NIST (197?). \n Ultrasonic Reference Block Study. \n\nData: 1 Response Variable (y = ultrasonic response)\n 1 Predictor Variable (x = metal distance)\n 214 Observations\n Lower Level of Difficulty\n Observed Data\n\nModel: Exponential Class\n 3 Parameters (b1 to b3)\n\n y = exp[-b1*x]/(b2+b3*x) + e\nT. Migot, Montreal, 2023.\n\nNIST Data fitting problem CHWIRUT1 given as an inconsistent set of\nnonlinear equations.\nFit: y = exp[-b1*x]/(b2+b3*x) + e\n\nclassification NOR2-MN-3-214\nProblem from the NIST nonlinear regression test set\nhttp://www.itl.nist.gov/div898/strd/nls/nls_main.shtml\nReference: Chwirut, D., NIST (197?). \nUltrasonic Reference Block Study.\n\nSIF input: Nick Gould and Tyrone Rees, Oct 2015\n@misc{NISTStRD,\n author = {{National Institute of Standards and Technology}},\n title = {{NIST/ITL StRD}: Nonlinear Regression Reference Datasets},\n howpublished = {\\url{https://www.itl.nist.gov/div898/strd/nls/nls_main.shtml}},\n year = {1997}\n}\nCUTEst:CHWIRUT1, NIST:Chwirut1
753false0falsetruechwirut2falsefalsefalsefalseleast_squaresunconstrained-Inf500.0truemissingunknownhttps://bitbucket.org/optrove/sif/src/master/CHWIRUT2.SIFhttps://www.itl.nist.gov/div898/strd/nls/data/LINKS/DATA/chwirut2.dat\n\nNIST/ITL StRD\nDataset Name: Chwirut2 (Chwirut2.dat)\n\nFile Format: ASCII\n Starting Values (lines 41 to 43)\n Certified Values (lines 41 to 48)\n Data (lines 61 to 114)\n\nProcedure: Nonlinear Least Squares Regression\n\nDescription: These data are the result of a NIST study involving\n ultrasonic calibration. The response variable is\n ultrasonic response, and the predictor variable is\n metal distance.\n\nReference: Chwirut, D., NIST (197?). \n Ultrasonic Reference Block Study. \n\nData: 1 Response (y = ultrasonic response)\n 1 Predictor (x = metal distance)\n 54 Observations\n Lower Level of Difficulty\n Observed Data\n\nModel: Exponential Class\n 3 Parameters (b1 to b3)\n\n y = exp(-b1*x)/(b2+b3*x) + e\nT. Migot, Montreal, 2023.\n\nNIST Data fitting problem CHWIRUT2 given as an inconsistent set of\nnonlinear equations.\nFit: y = exp[-b1*x]/(b2+b3*x) + e\n\nclassification NOR2-MN-3-54\nProblem from the NIST nonlinear regression test set\nhttp://www.itl.nist.gov/div898/strd/nls/nls_main.shtml\nReference: Chwirut, D., NIST (197?). \nUltrasonic Reference Block Study.\n\nSIF input: Nick Gould and Tyrone Rees, Oct 2015\n@misc{NISTStRD,\n author = {{National Institute of Standards and Technology}},\n title = {{NIST/ITL StRD}: Nonlinear Regression Reference Datasets},\n howpublished = {\\url{https://www.itl.nist.gov/div898/strd/nls/nls_main.shtml}},\n year = {1997}\n}\nCUTEst:CHWIRUT2, NIST:Chwirut2
762false0falsetrueclifffalsefalsefalsefalseotherunconstrained-Inf4.85165e8truemissingunknownhttps://bitbucket.org/optrove/sif/src/master/CLIFF.SIFThe "cliff problem" in 2 variables\n\nclassification OUR2-AN-2-0\nproblem 206 (p. 46) in\nA.R. Buckley,\n"Test functions for unconstrained minimization",\nTR 1989CS-3, Mathematics, statistics and computing centre,\nDalhousie University, Halifax (CDN), 1989.\n\nSIF input: Ph. Toint, Dec 1989.\n@techreport{Buckley1989,\n author = {Buckley, A. R.},\n title = {Test Functions for Unconstrained Minimization},\n institution = {Mathematics, Statistics and Computing Centre, Dalhousie University},\n number = {TR 1989CS-3},\n year = {1989},\n address = {Halifax, Canada}\n}\n CUTEst:CLIFF
7799true64truetrueclnlbeamtruefalsetruefalseothergeneral-Inf350.0truemissingunknownhttps://onlinelibrary.wiley.com/doi/abs/10.1002/oca.4660120103, https://bitbucket.org/optrove/sif/src/master/CLNLBEAM.SIFThe clnlbeam problem\nhttps://jump.dev/JuMP.jl/stable/tutorials/nonlinear/clnlbeam/\n\nAn optimal control version of the CLamped NonLinear BEAM problem.\nThe energy of a beam of length 1 compressed by a force P is to be\nminimized. The control variable is the derivative of the deflection angle.\nThe problem is discretized using the trapezoidal rule. It is non-convex.\n\nclassification OOR2-MN-V-V\nH. Maurer and H.D. Mittelman,\n"The non-linear beam via optimal control with bound state variables",\nOptimal Control Applications and Methods 12, pp. 19-31, 1991.\n\nSIF input: Ph. Toint, Nov 1993.\n@article{MaurerMittelmann1991,\n author = {H. Maurer and H.D. Mittelmann},\n title = {The non-linear beam via optimal control with bound state variables},\n journal = {Optimal Control Applications and Methods},\n volume = {12},\n number = {1},\n pages = {19--31},\n year = {1991},\n doi = {10.1002/oca.4660120103}\n} \n CUTEst:CLNLBEAM
78100true0falsetrueclplateafalsefalsefalsefalseotherunconstrained-Inf0.0truemissingunknownhttps://bitbucket.org/optrove/sif/src/master/CLPLATEA.SIFThe clamped plate problem (Strang, Nocedal, Dax).\nThe problem comes from the discretization the following problem\nin mechanics: a plate is clamped on one edge and loaded on the\nopposite side. The plate is the unit square.\n\nIn this version of the problem, the weight wght is entirely put on the\nupper right corner of the plate.\n\nThe plate is clamped on its lower edge, by fixing the\ncorresponding variables to zero.\n\nclassification OXR2-MN-V-0\n\np is the number of points in one side of the unit square\nThe number of variables is p*p, of which (p-1)*(p-1) are free.\n\nFixed variables have been eliminated from the objective function.\nJ. Nocedal,\n"Solving large nonlinear systems of equations arising in mechanics",\nProceedings of the Cocoyoc Numerical Analysis Conference, Mexico,\npp. 132-141, 1981.\n\nSIF input: Ph. Toint, Dec 1989.\n@inproceedings{Nocedal1981,\n author = {J. Nocedal},\n title = {Solving large nonlinear systems of equations arising in mechanics},\n booktitle = {Proceedings of the Cocoyoc Numerical Analysis Conference},\n address = {Mexico},\n pages = {132--141},\n year = {1981}\n} \n CUTEst:CLPLATEA
79100true0falsetrueclplatebfalsefalsefalsefalseotherunconstrained-Inf0.0truemissingunknownhttps://bitbucket.org/optrove/sif/src/master/CLPLATEB.SIFThe clamped plate problem (Strang, Nocedal, Dax)\nThe problem comes from the discretization the following problem\nin mechanics: a plate is clamped on one edge and loaded on the\nopposite side. The plate is the unit square.\n\nThe plate is clamped on its lower edge, by fixing the\ncorresponding variables to zero.\n\nIn this version of the problem, the weight wght is distributed\nequally along the upper edge, introducing a symmetry with respect\nto the vertical axis.\n\nclassification OXR2-MN-V-0\n\np is the number of points in one side of the unit square\nThe number of variables is p*p, of which (p-1)*(p-1) are free.\n\nFixed variables have been eliminated from the objective function.\nJ. Nocedal,\n"Solving large nonlinear systems of equations arising in mechanics",\nProceedings of the Cocoyoc Numerical Analysis Conference, Mexico,\npp. 132-141, 1981.\n\nSIF input: Ph. Toint, Dec 1989.\n@inproceedings{Nocedal1981,\n author = {J. Nocedal},\n title = {Solving large nonlinear systems of equations arising in mechanics},\n booktitle = {Proceedings of the Cocoyoc Numerical Analysis Conference},\n address = {Mexico},\n pages = {132--141},\n year = {1981}\n} \n CUTEst:CLPLATEB
80100true0falsetrueclplatecfalsefalsefalsefalseotherunconstrained-Inf0.0truemissingunknownhttps://bitbucket.org/optrove/sif/src/master/CLPLATEC.SIFThe clamped plate problem (Strang, Nocedal, Dax).\nThe problem comes from the discretization the following problem\nin mechanics: a plate is clamped on one edge and loaded on the\nopposite side. The plate is the unit square.\n\nIn this version of the problem, part of the weight wght is put on the\nupper right corner of the plate, and the rest on the upper left corner.\n\nThe plate is clamped on its lower edge, by fixing the\ncorresponding variables to zero.\n\nclassification OXR2-MN-V-0\n\np is the number of points in one side of the unit square\nThe number of variables is p*p, of which (p-1)*(p-1) are free.\n\nFixed variables have been eliminated from the objective function.\nJ. Nocedal,\n"Solving large nonlinear systems of equations arising in mechanics",\nProceedings of the Cocoyoc Numerical Analysis Conference, Mexico,\npp. 132-141, 1981.\n\nSIF input: Ph. Toint, Dec 1989.\n@inproceedings{Nocedal1981,\n author = {J. Nocedal},\n title = {Solving large nonlinear systems of equations arising in mechanics},\n booktitle = {Proceedings of the Cocoyoc Numerical Analysis Conference},\n address = {Mexico},\n pages = {132--141},\n year = {1981}\n} \n CUTEst:CLPLATEC
81100true50truetruecontrolinvestmenttruefalsetruefalseothergeneral-Inf-0.98truemissingunknownThis is a simple investment problem in optimistic market.\nExample 5.3, Dominique Orban, Computation Optimization and Control lecture notes at Polytechnique Montréal.\n@misc{OrbanControlNotes,\n author = {Dominique Orban},\n title = {Computation Optimization and Control Lecture Notes},\n howpublished = {Lecture notes, Polytechnique Montréal},\n year = {2022}\n} \n
82100true0falsetruecosinefalsefalsefalsefalseotherunconstrained-Inf86.8807truemissingunknownhttps://bitbucket.org/optrove/sif/src/master/COSINE.SIFThe cosine function.\n\nAnother function with nontrivial groups and\nrepetitious elements.\n\nclassification OUR2-AN-V-0\n\nD. Orban, Montreal, 08/2015.\nproblem 6 in\nL. Luksan, C. Matonoha and J. Vlcek\nModified CUTE problems for sparse unconstrained optimization,\nTechnical Report 1081,\nInstitute of Computer Science,\nAcademy of Science of the Czech Republic\n\nhttp://www.cs.cas.cz/matonoha/download/V1081.pdf\n\nN. Gould, private communication.\n\nSIF input: N. Gould, Jan 1996\n@techreport{LuksanMatonohaVlcek2003,\n author = {Luksan, Ladislav and Matonoha, Cestmir and Vlcek, Jan},\n title = {Modified {CUTE} Problems for Sparse Unconstrained Optimization},\n institution = {Institute of Computer Science, Academy of Sciences of the Czech Republic},\n number = {1081},\n year = {2003},\n address = {Prague, Czech Republic},\n url = {http://www.cs.cas.cz/matonoha/download/V1081.pdf},\n } \n CUTEst:COSINE, Luksan:6
83100true0falsetruecragglvyfalsefalsefalsefalseotherunconstrained-Inf52823.1truemissingunknownhttps://bitbucket.org/optrove/sif/src/master/CRAGGLVY.SIFExtended Cragg and Levy problem.\nThis problem is a sum of m sets of 5 groups,\nThere are 2m+2 variables. The Hessian matrix is 7-diagonal.\n\nclassification OUR2-AY-V-0\nProblem 32 in\nPh. L. Toint,\nTest problems for partially separable optimization and results\nfor the routine PSPMIN,\nReport 83/4, Department of Mathematics, FUNDP (Namur, B), 1983.\n\nSee also Buckley#18\n\nproblem 7 in\nL. Luksan, C. Matonoha and J. Vlcek\nModified CUTE problems for sparse unconstrained optimization,\nTechnical Report 1081,\nInstitute of Computer Science,\nAcademy of Science of the Czech Republic\n\nhttp://www.cs.cas.cz/matonoha/download/V1081.pdf\n\nSIF input: Ph. Toint, Dec 1989.\n\nD. Orban, Montreal, 08/2015.\n@techreport{Toint1983,\n author = {Ph. L. Toint},\n title = {Test problems for partially separable optimization and results for the routine PSPMIN},\n institution = {Department of Mathematics, FUNDP (Namur, Belgium)},\n number = {Report 83/4},\n year = {1983}\n} \n CUTEst:CRAGGLVY, Luksan:7
84100true0falsetruecragglvy2falsefalsefalsefalseleast_squaresunconstrained-Inf52823.1truemissingunknownhttps://www.researchgate.net/publication/325314400_Sparse_Test_Problems_for_Unconstrained_OptimizationChained Cragg and Levy function\n\nThis is similar to cragglvy but the quartic term differs.\n\nProblem 17 in\nConn, A.R., Gould, N.I.M, Toint, P.,\nTesting a Class of Methods for Solving\nMinimization Problems with Simple Bounds on the Variables, \nMathematics of Computation, \nVol. 50, pp. 399-430, 1988.\n\nProblem 4 in\nL. Luksan, C. Matonoha and J. Vlcek\nSparse Test Problems for Unconstrained Optimization,\nTechnical Report 1064,\nInstitute of Computer Science,\nAcademy of Science of the Czech Republic\n\nhttps://www.researchgate.net/publication/325314400_Sparse_Test_Problems_for_Unconstrained_Optimization\n\n@techreport{LuksanMatonohaVlcek2010Sparse,\n author = {Luksan, Ladislav and Matonoha, Ctirad and Vlcek, Jan},\n title = {Sparse Test Problems for Unconstrained Optimization},\n institution = {Institute of Computer Science, Academy of Sciences of the Czech Republic},\n number = {V-1064},\n year = {2010},\n address = {Prague, Czech Republic},\n url = {https://www.researchgate.net/publication/325314400_Sparse_Test_Problems_for_Unconstrained_Optimization}\n }\n LuksanSparse:4
85100true0falsetruecurlyfalsefalsefalsefalseotherunconstrained-Inf-0.00623722truemissingunknownhttp://www.cs.cas.cz/matonoha/download/V1081.pdfA banded function with semi-bandwidth b and\nnegative curvature near the starting point.\n\nNote that the initial point in the reference below is erroneous.\nIn this model, we use the starting point specified in the\noriginal SIF model, part of the CUTE collection.\n\nSee also\n\nproblems 8, 9, 10 in\nL. Luksan, C. Matonoha and J. Vlcek\nModified CUTE problems for sparse unconstrained optimization,\nTechnical Report 1081,\nInstitute of Computer Science,\nAcademy of Science of the Czech Republic\n\nhttp://www.cs.cas.cz/matonoha/download/V1081.pdf\n\nclassification SUR2-AN-V-0\n\nD. Orban, Montreal, 08/2015.\n\n@techreport{LuksanMatonohaVlcek2003,\n author = {Luksan, Ladislav and Matonoha, Cestmir and Vlcek, Jan},\n title = {Modified {CUTE} Problems for Sparse Unconstrained Optimization},\n institution = {Institute of Computer Science, Academy of Sciences of the Czech Republic},\n number = {1081},\n year = {2003},\n address = {Prague, Czech Republic},\n url = {http://www.cs.cas.cz/matonoha/download/V1081.pdf},\n } \n
86100true0falsetruecurly10falsefalsefalsefalseotherunconstrained-Inf-0.00623722truemissingunknownhttps://bitbucket.org/optrove/sif/src/master/CURLY10.SIFA banded function with semi-bandwidth b and\nnegative curvature near the starting point.\n\nNote that the initial point in the reference below is erroneous.\nIn this model, we use the starting point specified in the\noriginal SIF model, part of the CUTE collection.\n\nSee also\n\nproblems 8, 9, 10 in\nL. Luksan, C. Matonoha and J. Vlcek\nModified CUTE problems for sparse unconstrained optimization,\nTechnical Report 1081,\nInstitute of Computer Science,\nAcademy of Science of the Czech Republic\n\nhttp://www.cs.cas.cz/matonoha/download/V1081.pdf\n\nA banded function with semi-bandwidth 10 and\nnegative curvature near the starting point\n\nclassification OUR2-AN-V-0\n\nclassification SUR2-AN-V-0\n\nD. Orban, Montreal, 08/2015.\nNick Gould\n\nSIF input: Nick Gould, September 1997.\n@techreport{LuksanMatonohaVlcek2003,\n author = {Luksan, Ladislav and Matonoha, Cestmir and Vlcek, Jan},\n title = {Modified {CUTE} Problems for Sparse Unconstrained Optimization},\n institution = {Institute of Computer Science, Academy of Sciences of the Czech Republic},\n number = {1081},\n year = {2003},\n address = {Prague, Czech Republic},\n url = {http://www.cs.cas.cz/matonoha/download/V1081.pdf},\n } \n CUTEst:CURLY10
87100true0falsetruecurly20falsefalsefalsefalseotherunconstrained-Inf-0.0129654truemissingunknownhttps://bitbucket.org/optrove/sif/src/master/CURLY20.SIFA banded function with semi-bandwidth b and\nnegative curvature near the starting point.\n\nNote that the initial point in the reference below is erroneous.\nIn this model, we use the starting point specified in the\noriginal SIF model, part of the CUTE collection.\n\nSee also\n\nproblems 8, 9, 10 in\nL. Luksan, C. Matonoha and J. Vlcek\nModified CUTE problems for sparse unconstrained optimization,\nTechnical Report 1081,\nInstitute of Computer Science,\nAcademy of Science of the Czech Republic\n\nhttp://www.cs.cas.cz/matonoha/download/V1081.pdf\n\nA banded function with semi-bandwidth 20 and\nnegative curvature near the starting point\n\nclassification OUR2-AN-V-0\n\nclassification SUR2-AN-V-0\n\nD. Orban, Montreal, 08/2015.\nNick Gould\n\nSIF input: Nick Gould, September 1997.\n@techreport{LuksanMatonohaVlcek2003,\n author = {Luksan, Ladislav and Matonoha, Cestmir and Vlcek, Jan},\n title = {Modified {CUTE} Problems for Sparse Unconstrained Optimization},\n institution = {Institute of Computer Science, Academy of Sciences of the Czech Republic},\n number = {1081},\n year = {2003},\n address = {Prague, Czech Republic},\n url = {http://www.cs.cas.cz/matonoha/download/V1081.pdf},\n } \n CUTEst:CURLY20
88100true0falsetruecurly30falsefalsefalsefalseotherunconstrained-Inf-0.020383truemissingunknownhttps://bitbucket.org/optrove/sif/src/master/CURLY30.SIFA banded function with semi-bandwidth b and\nnegative curvature near the starting point.\n\nNote that the initial point in the reference below is erroneous.\nIn this model, we use the starting point specified in the\noriginal SIF model, part of the CUTE collection.\n\nSee also\n\nproblems 8, 9, 10 in\nL. Luksan, C. Matonoha and J. Vlcek\nModified CUTE problems for sparse unconstrained optimization,\nTechnical Report 1081,\nInstitute of Computer Science,\nAcademy of Science of the Czech Republic\n\nhttp://www.cs.cas.cz/matonoha/download/V1081.pdf\n\nA banded function with semi-bandwidth 30 and\nnegative curvature near the starting point\n\nclassification OUR2-AN-V-0\n\nclassification SUR2-AN-V-0\n\nD. Orban, Montreal, 08/2015.\nNick Gould\n\nSIF input: Nick Gould, September 1997.\n@techreport{LuksanMatonohaVlcek2003,\n author = {Luksan, Ladislav and Matonoha, Cestmir and Vlcek, Jan},\n title = {Modified {CUTE} Problems for Sparse Unconstrained Optimization},\n institution = {Institute of Computer Science, Academy of Sciences of the Czech Republic},\n number = {1081},\n year = {2003},\n address = {Prague, Czech Republic},\n url = {http://www.cs.cas.cz/matonoha/download/V1081.pdf},\n } \n CUTEst:CURLY30
892false0falsetruedanwoodfalsefalsefalsefalseleast_squaresunconstrained-Inf500.0truemissingunknownhttps://www.itl.nist.gov/div898/strd/nls/data/LINKS/DATA/danwood.dat, https://bitbucket.org/optrove/sif/src/master/DANWOOD.SIFNIST/ITL StRD\nDataset Name: DanWood (DanWood.dat)\n\nFile Format: ASCII\n Starting Values (lines 41 to 42)\n Certified Values (lines 41 to 47)\n Data (lines 61 to 66)\n\nProcedure: Nonlinear Least Squares Regression\n\nDescription: These data and model are described in Daniel and Wood\n (1980), and originally published in E.S.Keeping, \n "Introduction to Statistical Inference," Van Nostrand\n Company, Princeton, NJ, 1962, p. 354. The response\n variable is energy radieted from a carbon filament\n lamp per cm**2 per second, and the predictor variable\n is the absolute temperature of the filament in 1000\n degrees Kelvin.\n\nReference: Daniel, C. and F. S. Wood (1980).\n Fitting Equations to Data, Second Edition. \n New York, NY: John Wiley and Sons, pp. 428-431.\n\nData: 1 Response Variable (y = energy)\n 1 Predictor Variable (x = temperature)\n 6 Observations\n Lower Level of Difficulty\n Observed Data\n\nModel: Miscellaneous Class\n 2 Parameters (b1 and b2)\n\n y = b1*x**b2 + e\n\nT. Migot, Montreal, 2023.\n\nNIST Data fitting problem DANWOOD given as an inconsistent set of\nnonlinear equations (incorrect formulation). See DANIWOOS.SIF for\nthe correct formulation\nFit: y = (b1*x)**b2 + e\n\nclassification NOR2-MN-2-6\nProblem from the NIST nonlinear regression test set\nhttp://www.itl.nist.gov/div898/strd/nls/nls_main.shtml\nDaniel, C. and F. S. Wood (1980).\nFitting Equations to Data, Second Edition.\nNew York, NY: John Wiley and Sons, pp. 428-431.\n\nSIF input: Nick Gould and Tyrone Rees, Oct 2015\n@book{DanielWood1980,\n author = {C. Daniel and F. S. Wood},\n title = {Fitting Equations to Data},\n edition = {Second},\n publisher = {John Wiley and Sons},\n address = {New York, NY},\n year = {1980},\n pages = {428--431}\n} \n CUTEst:DANWOOD, NIST:DanWood
9099true0falsetruedixmaanefalsefalsefalsefalseotherunconstrained-Inf731.833truemissingunknownhttp://www.cs.cas.cz/matonoha/download/V1081.pdfThe Dixon-Maany test problem (version E by default)\n\nclassification OUR2-AN-V-0\n\nD. Orban, Montreal, 08/2015.\nL. C. W. Dixon and Z. Maany,\nA family of test problems with sparse Hessians for unconstrained\noptimization,\nTR 206, Numerical Optimization Centre, Hatfield Polytechnic, 1988.\n\nSee also\n\nproblems 11, 12, 13, 14 in\nL. Luksan, C. Matonoha and J. Vlcek\nModified CUTE problems for sparse unconstrained optimization,\nTechnical Report 1081,\nInstitute of Computer Science,\nAcademy of Science of the Czech Republic\n@techreport{DixonMaany1988,\n author = {L. C. W. Dixon and Z. Maany},\n title = {A family of test problems with sparse Hessians for unconstrained optimization},\n institution = {Numerical Optimization Centre, Hatfield Polytechnic},\n number = {TR 206},\n year = {1988}\n}\n Luksan:11
9199true0falsetruedixmaanffalsefalsefalsefalseotherunconstrained-Inf1348.42truemissingunknownhttp://www.cs.cas.cz/matonoha/download/V1081.pdf, https://bitbucket.org/optrove/sif/src/master/DIXMAANF.SIFThe Dixon-Maany test problem (version E by default)\n\nclassification OUR2-AN-V-0\n\nD. Orban, Montreal, 08/2015.\nproblems 11, 12, 13, 14 in\nL. Luksan, C. Matonoha and J. Vlcek\nModified CUTE problems for sparse unconstrained optimization,\nTechnical Report 1081,\nInstitute of Computer Science,\nAcademy of Science of the Czech Republic\n\nL.C.W. Dixon and Z. Maany,\n"A family of test problems with sparse Hessians for unconstrained\noptimization",\nTR 206, Numerical Optimization Centre, Hatfield Polytechnic, 1988.\nSee also Buckley#221 (p. 49)\n\nSIF input: Ph. Toint, Dec 1989.\n@techreport{DixonMaany1988,\n author = {L. C. W. Dixon and Z. Maany},\n title = {A family of test problems with sparse Hessians for unconstrained optimization},\n institution = {Numerical Optimization Centre, Hatfield Polytechnic},\n number = {TR 206},\n year = {1988}\n}\n CUTEst:DIXMAANF,Luksan:12
9299true0falsetruedixmaangfalsefalsefalsefalseotherunconstrained-Inf2495.83truemissingunknownhttp://www.cs.cas.cz/matonoha/download/V1081.pdf, https://bitbucket.org/optrove/sif/src/master/DIXMAANG.SIFThe Dixon-Maany test problem (version E by default)\n\nclassification OUR2-AN-V-0\n\nD. Orban, Montreal, 08/2015.\nproblems 11, 12, 13, 14 in\nL. Luksan, C. Matonoha and J. Vlcek\nModified CUTE problems for sparse unconstrained optimization,\nTechnical Report 1081,\nInstitute of Computer Science,\nAcademy of Science of the Czech Republic\n\nL.C.W. Dixon and Z. Maany,\n"A family of test problems with sparse Hessians for unconstrained\noptimization",\nTR 206, Numerical Optimization Centre, Hatfield Polytechnic, 1988.\nSee also Buckley#221 (p. 49)\n\nSIF input: Ph. Toint, Dec 1989.\n@techreport{DixonMaany1988,\n author = {L. C. W. Dixon and Z. Maany},\n title = {A family of test problems with sparse Hessians for unconstrained optimization},\n institution = {Numerical Optimization Centre, Hatfield Polytechnic},\n number = {TR 206},\n year = {1988}\n}\n CUTEst:DIXMAANG,Luksan:13
9399true0falsetruedixmaanhfalsefalsefalsefalseotherunconstrained-Inf4974.25truemissingunknownhttp://www.cs.cas.cz/matonoha/download/V1081.pdf, https://bitbucket.org/optrove/sif/src/master/DIXMAANH.SIFThe Dixon-Maany test problem (version E by default)\n\nclassification OUR2-AN-V-0\n\nD. Orban, Montreal, 08/2015.\nproblems 11, 12, 13, 14 in\nL. Luksan, C. Matonoha and J. Vlcek\nModified CUTE problems for sparse unconstrained optimization,\nTechnical Report 1081,\nInstitute of Computer Science,\nAcademy of Science of the Czech Republic\n\nL.C.W. Dixon and Z. Maany,\n"A family of test problems with sparse Hessians for unconstrained\noptimization",\nTR 206, Numerical Optimization Centre, Hatfield Polytechnic, 1988.\nSee also Buckley#221 (p. 49)\n\nSIF input: Ph. Toint, Dec 1989.\n@techreport{DixonMaany1988,\n author = {L. C. W. Dixon and Z. Maany},\n title = {A family of test problems with sparse Hessians for unconstrained optimization},\n institution = {Numerical Optimization Centre, Hatfield Polytechnic},\n number = {TR 206},\n year = {1988}\n}\n CUTEst:DIXMAANH,Luksan:14
9499true0falsetruedixmaanifalsefalsefalsefalseotherunconstrained-Inf663.646truemissingunknownhttp://www.cs.cas.cz/matonoha/download/V1081.pdfThe Dixon-Maany test problem (version I by default)\n\nclassification OUR2-AN-V-0\n\nD. Orban, Montreal, 08/2015.\nL. C. W. Dixon and Z. Maany,\nA family of test problems with sparse Hessians for unconstrained\noptimization,\nTR 206, Numerical Optimization Centre, Hatfield Polytechnic, 1988.\n\nSee also\n\nproblems 15, 16, 17, 18 in\nL. Luksan, C. Matonoha and J. Vlcek\nModified CUTE problems for sparse unconstrained optimization,\nTechnical Report 1081,\nInstitute of Computer Science,\nAcademy of Science of the Czech Republic\n@techreport{DixonMaany1988,\n author = {L. C. W. Dixon and Z. Maany},\n title = {A family of test problems with sparse Hessians for unconstrained optimization},\n institution = {Numerical Optimization Centre, Hatfield Polytechnic},\n number = {TR 206},\n year = {1988}\n}\n Luksan:15
9599true0falsetruedixmaanjfalsefalsefalsefalseotherunconstrained-Inf1281.33truemissingunknownhttp://www.cs.cas.cz/matonoha/download/V1081.pdf, https://bitbucket.org/optrove/sif/src/master/DIXMAANJ.SIFThe Dixon-Maany test problem (version I by default)\n\nclassification OUR2-AN-V-0\n\nD. Orban, Montreal, 08/2015.\nproblems 15, 16, 17, 18 in\nL. Luksan, C. Matonoha and J. Vlcek\nModified CUTE problems for sparse unconstrained optimization,\nTechnical Report 1081,\nInstitute of Computer Science,\nAcademy of Science of the Czech Republic\n\nL.C.W. Dixon and Z. Maany,\n"A family of test problems with sparse Hessians for unconstrained\noptimization",\nTR 206, Numerical Optimization Centre, Hatfield Polytechnic, 1988.\nSee also Buckley#221 (p. 49)\n\nSIF input: Ph. Toint, Dec 1989.\n@techreport{DixonMaany1988,\n author = {L. C. W. Dixon and Z. Maany},\n title = {A family of test problems with sparse Hessians for unconstrained optimization},\n institution = {Numerical Optimization Centre, Hatfield Polytechnic},\n number = {TR 206},\n year = {1988}\n} \n CUTEst:DIXMAANJ,Luksan:16
9699true0falsetruedixmaankfalsefalsefalsefalseotherunconstrained-Inf2427.65truemissingunknownhttp://www.cs.cas.cz/matonoha/download/V1081.pdf, https://bitbucket.org/optrove/sif/src/master/DIXMAANK.SIFThe Dixon-Maany test problem (version I by default)\n\nclassification OUR2-AN-V-0\n\nD. Orban, Montreal, 08/2015.\nproblems 15, 16, 17, 18 in\nL. Luksan, C. Matonoha and J. Vlcek\nModified CUTE problems for sparse unconstrained optimization,\nTechnical Report 1081,\nInstitute of Computer Science,\nAcademy of Science of the Czech Republic\n\nL.C.W. Dixon and Z. Maany,\n"A family of test problems with sparse Hessians for unconstrained\noptimization",\nTR 206, Numerical Optimization Centre, Hatfield Polytechnic, 1988.\nSee also Buckley#221 (p. 49)\n\nSIF input: Ph. Toint, Dec 1989.\n@techreport{DixonMaany1988,\n author = {L. C. W. Dixon and Z. Maany},\n title = {A family of test problems with sparse Hessians for unconstrained optimization},\n institution = {Numerical Optimization Centre, Hatfield Polytechnic},\n number = {TR 206},\n year = {1988}\n}\n CUTEst:DIXMAANK,Luksan:17
9799true0falsetruedixmaanlfalsefalsefalsefalseotherunconstrained-Inf4903.7truemissingunknownhttp://www.cs.cas.cz/matonoha/download/V1081.pdf, https://bitbucket.org/optrove/sif/src/master/DIXMAANL.SIFThe Dixon-Maany test problem (version I by default)\n\nclassification OUR2-AN-V-0\n\nD. Orban, Montreal, 08/2015.\nproblems 15, 16, 17, 18 in\nL. Luksan, C. Matonoha and J. Vlcek\nModified CUTE problems for sparse unconstrained optimization,\nTechnical Report 1081,\nInstitute of Computer Science,\nAcademy of Science of the Czech Republic\n\nL.C.W. Dixon and Z. Maany,\n"A family of test problems with sparse Hessians for unconstrained\noptimization",\nTR 206, Numerical Optimization Centre, Hatfield Polytechnic, 1988.\nSee also Buckley#221 (p. 49)\n\nSIF input: Ph. Toint, Dec 1989.\n@techreport{DixonMaany1988,\n author = {L. C. W. Dixon and Z. Maany},\n title = {A family of test problems with sparse Hessians for unconstrained optimization},\n institution = {Numerical Optimization Centre, Hatfield Polytechnic},\n number = {TR 206},\n year = {1988}\n}\n CUTEst:DIXMAANL,Luksan:18
9899true0falsetruedixmaanmfalsefalsefalsefalseotherunconstrained-Inf314.313truemissingunknownhttp://www.cs.cas.cz/matonoha/download/V1081.pdfThe Dixon-Maany test problem (version M by default)\n\nD. Orban, Montreal, 08/2015.\nL. C. W. Dixon and Z. Maany,\nA family of test problems with sparse Hessians for unconstrained\noptimization,\nTR 206, Numerical Optimization Centre, Hatfield Polytechnic, 1988.\n\nSee also\n\nproblems 19, 20, 21, 22 in\nL. Luksan, C. Matonoha and J. Vlcek\nModified CUTE problems for sparse unconstrained optimization,\nTechnical Report 1081,\nInstitute of Computer Science,\nAcademy of Science of the Czech Republic\n@techreport{DixonMaany1988,\n author = {L. C. W. Dixon and Z. Maany},\n title = {A family of test problems with sparse Hessians for unconstrained optimization},\n institution = {Numerical Optimization Centre, Hatfield Polytechnic},\n number = {TR 206},\n year = {1988}\n}\n Luksan:19
9999true0falsetruedixmaannfalsefalsefalsefalseotherunconstrained-Inf665.66truemissingunknownhttp://www.cs.cas.cz/matonoha/download/V1081.pdf, https://bitbucket.org/optrove/sif/src/master/DIXMAANN.SIFThe Dixon-Maany test problem (version M by default)\n\nD. Orban, Montreal, 08/2015.\n\nclassification OUR2-AN-V-0\nSee also\n\nL. Luksan, C. Matonoha and J. Vlcek \nModified CUTE problems for sparse unconstraoined optimization\nTechnical Report 1081\nInstitute of Computer Science\nAcademy of Science of the Czech Republic\n(problem 20) based on\nL.C.W. Dixon and Z. Maany,\n"A family of test problems with sparse Hessians for unconstrained\noptimization",\nTR 206, Numerical Optimization Centre, Hatfield Polytechnic, 1988.\n\nSIF input: Ph. Toint, Dec 1989.\n@techreport{DixonMaany1988,\n author = {L. C. W. Dixon and Z. Maany},\n title = {A family of test problems with sparse Hessians for unconstrained optimization},\n institution = {Numerical Optimization Centre, Hatfield Polytechnic},\n number = {TR 206},\n year = {1988}\n}\n CUTEst:DIXMAANN,Luksan:20
10099true0falsetruedixmaanofalsefalsefalsefalseotherunconstrained-Inf1196.31truemissingunknownhttp://www.cs.cas.cz/matonoha/download/V1081.pdf, https://bitbucket.org/optrove/sif/src/master/DIXMAANO.SIFThe Dixon-Maany test problem (version M by default)\n\nD. Orban, Montreal, 08/2015.\n\nclassification OUR2-AN-V-0\nSee also\n\nL. Luksan, C. Matonoha and J. Vlcek \nModified CUTE problems for sparse unconstraoined optimization\nTechnical Report 1081\nInstitute of Computer Science\nAcademy of Science of the Czech Republic\n(problem 21) based on\nL.C.W. Dixon and Z. Maany,\n"A family of test problems with sparse Hessians for unconstrained\noptimization",\nTR 206, Numerical Optimization Centre, Hatfield Polytechnic, 1988.\n\nSIF input: Ph. Toint, Dec 1989.\n@techreport{DixonMaany1988,\n author = {L. C. W. Dixon and Z. Maany},\n title = {A family of test problems with sparse Hessians for unconstrained optimization},\n institution = {Numerical Optimization Centre, Hatfield Polytechnic},\n number = {TR 206},\n year = {1988}\n} \n CUTEst:DIXMAANO,Luksan:21
10199true0falsetruedixmaanpfalsefalsefalsefalseotherunconstrained-Inf2342.52truemissingunknownhttp://www.cs.cas.cz/matonoha/download/V1081.pdf, https://bitbucket.org/optrove/sif/src/master/DIXMAANP.SIFThe Dixon-Maany test problem (version M by default)\n\nD. Orban, Montreal, 08/2015.\n\nclassification OUR2-AN-V-0\nSee also\n\nL. Luksan, C. Matonoha and J. Vlcek \nModified CUTE problems for sparse unconstraoined optimization\nTechnical Report 1081\nInstitute of Computer Science\nAcademy of Science of the Czech Republic\n(problem 22) based on\nL.C.W. Dixon and Z. Maany,\n"A family of test problems with sparse Hessians for unconstrained\noptimization",\nTR 206, Numerical Optimization Centre, Hatfield Polytechnic, 1988.\n\nSIF input: Ph. Toint, Dec 1989.\n@techreport{DixonMaany1988,\n author = {L. C. W. Dixon and Z. Maany},\n title = {A family of test problems with sparse Hessians for unconstrained optimization},\n institution = {Numerical Optimization Centre, Hatfield Polytechnic},\n number = {TR 206},\n year = {1988}\n}\n CUTEst:DIXMAANP,Luksan:22
102100true0falsetruedixon3dqfalsefalsefalsefalseleast_squaresunconstrained-Inf8.0truemissingunknownhttps://bitbucket.org/optrove/sif/src/master/DIXON3DQ.SIFDixon's tridiagonal quadratic.\n\nclassification QUR2-AN-V-0\nproblem 156 (p. 51) in\nA.R. Buckley,\n"Test functions for unconstrained minimization",\nTR 1989CS-3, Mathematics, statistics and computing centre,\nDalhousie University, Halifax (CDN), 1989.\n\nSIF input: Ph. Toint, Dec 1989.\n@techreport{Buckley1989,\n author = {Buckley, A. R.},\n title = {Test Functions for Unconstrained Minimization},\n institution = {Mathematics, Statistics and Computing Centre, Dalhousie University},\n number = {TR 1989CS-3},\n year = {1989},\n address = {Halifax, Canada}\n}\n CUTEst:DIXON3DQ
103100true0falsetruedqdrticfalsefalsefalsefalseotherunconstrained-Inf177282.0truemissingunknownhttps://bitbucket.org/optrove/sif/src/master/DQDRTIC.SIFDiagonal quadratic problem\n\nclassification QUR2-AN-V-0\nproblem 22 in\nPh. L. Toint,\n"Test problems for partially separable optimization and results\nfor the routine PSPMIN",\nReport 83/4, Department of Mathematics, FUNDP (Namur, B), 1983.\n\nSIF input: Ph. Toint, Dec 1989.\n@techreport{Toint1983,\n author = {Ph. L. Toint},\n title = {Test problems for partially separable optimization and results for the routine PSPMIN},\n institution = {Department of Mathematics, FUNDP (Namur, Belgium)},\n number = {Report 83/4},\n year = {1983}\n} \n CUTEst:DQDRTIC
104100true0falsetruedqrticfalsefalsefalsefalseotherunconstrained-Inf1.85427e9truemissingunknownhttp://www.cs.cas.cz/matonoha/download/V1081.pdf, https://bitbucket.org/optrove/sif/src/master/DQRTIC.SIFVariable dimension diagonal quartic problem.\n\nclassification OUR2-AN-V-0\nProblem 157 (p. 87) in\nA.R. Buckley,\nTest functions for unconstrained minimization,\nTR 1989CS-3, Mathematics, statistics and computing centre,\nDalhousie University, Halifax (CDN), 1989.\n\nSee also\n\nproblem 23 in\nL. Luksan, C. Matonoha and J. Vlcek\nModified CUTE problems for sparse unconstrained optimization,\nTechnical Report 1081,\nInstitute of Computer Science,\nAcademy of Science of the Czech Republic\n\nSIF input: Ph. Toint, Dec 1989.\n\nD. Orban, Montreal, 08/2015.\n@techreport{Buckley1989,\n author = {Buckley, A. G.},\n title = {Test functions for unconstrained minimization},\n institution = {Computing Science Division, Dalhousie University},\n address = {Dalhousie, Canada},\n number = {CS-3},\n year = {1989}\n} \n CUTEst:DQRTIC, Luksan:23
1053false0falsetrueeckerle4falsefalsefalsefalseleast_squaresunconstrained-Inf500.0truemissingunknownhttps://bitbucket.org/optrove/sif/src/master/ECKERLE4.SIFhttps://www.itl.nist.gov/div898/strd/nls/data/LINKS/DATA/eckerle4.dat\n\nNIST/ITL StRD\nDataset Name: Eckerle4 (Eckerle4.dat)\n\nFile Format: ASCII\n Starting Values (lines 41 to 43)\n Certified Values (lines 41 to 48)\n Data (lines 61 to 95)\n\nProcedure: Nonlinear Least Squares Regression\n\nDescription: These data are the result of a NIST study involving\n circular interference transmittance. The response\n variable is transmittance, and the predictor variable\n is wavelength.\n\nReference: Eckerle, K., NIST (197?). \n Circular Interference Transmittance Study.\n\nData: 1 Response Variable (y = transmittance)\n 1 Predictor Variable (x = wavelength)\n 35 Observations\n Higher Level of Difficulty\n Observed Data\n\nModel: Exponential Class\n 3 Parameters (b1 to b3)\nT. Migot, Montreal, 2023.\n\nNIST Data fitting problem ECKERLE4 given as an inconsistent set of\nnonlinear equations.\nFit: y = (b1/b2) * exp[-0.5*((x-b3)/b2)**2] + e\n\nclassification NOR2-MN-3-35\nProblem from the NIST nonlinear regression test set\nhttp://www.itl.nist.gov/div898/strd/nls/nls_main.shtml\nReference: Eckerle, K., NIST (197?). \nCircular Interference Transmittance Study.\n\nSIF input: Nick Gould and Tyrone Rees, Oct 2015\n@misc{NISTStRD,\n author = {{National Institute of Standards and Technology}},\n title = {{NIST/ITL StRD}: Nonlinear Regression Reference Datasets},\n howpublished = {\\url{https://www.itl.nist.gov/div898/strd/nls/nls_main.shtml}},\n year = {1997}\n}\nCUTEst:ECKERLE4, NIST:Eckerle4
106100true0falsetrueedenschfalsefalsefalsefalseotherunconstrained-Inf1699.0truemissingunknownhttps://bitbucket.org/optrove/sif/src/master/EDENSCH.SIFThe extended Dennis and Schnabel problem, as defined by Li.\n\nclassification OUR2-AN-V-0\nG. Li,\nThe secant/finite difference algorithm for solving sparse\nnonlinear systems of equations,\nSIAM Journal on Numerical Analysis, 25(5), pp. 1181-1196, 1988.\n\nSee also\n\nproblem 24 in\nL. Luksan, C. Matonoha and J. Vlcek\nModified CUTE problems for sparse unconstrained optimization,\nTechnical Report 1081,\nInstitute of Computer Science,\nAcademy of Science of the Czech Republic\n\nhttp://www.cs.cas.cz/matonoha/download/V1081.pdf\n\nSIF input: Ph. Toint, Apr 1990.\nminor correction by Ph. Shott, January 1995.\n\nD. Orban, Montreal, 08/2015.\n@article{Li1988SIAMJNA,\n author = {Li, Guangye},\n title = {The Secant/Finite Difference Algorithm for Solving Sparse Nonlinear Systems of Equations},\n journal = {SIAM Journal on Numerical Analysis},\n year = {1988},\n volume = {25},\n number = {5},\n pages = {1181--1196},\n doi = {10.1137/0725067}\n} \n CUTEst:EDENSCH, Luksan:24
107100true0falsetrueeg2falsefalsefalsefalseotherunconstrained-Inf-83.3056truemissingunknownhttps://bitbucket.org/optrove/sif/src/master/EG2.SIFA simple nonlinear problem given as an example in Section 1.2.4 of\nthe LANCELOT Manual.\nThe problem is non convex and has several local minima.\n\nclassification OUR2-AN-1000-0\nSection 1.2.4 of\nA. R. Conn, N. I. M. Gould and Ph. L. Toint,\nLANCELOT, A Fortran Package for Large-Scale Nonlinear Optimization\n(Release A)\nSpringer Verlag, 1992.\n\nSee also\n\nproblem 25 in\nL. Luksan, C. Matonoha and J. Vlcek\nModified CUTE problems for sparse unconstrained optimization,\nTechnical Report 1081,\nInstitute of Computer Science,\nAcademy of Science of the Czech Republic\n\nhttp://www.cs.cas.cz/matonoha/download/V1081.pdf\n\nSIF input: N. Gould and Ph. Toint, June 1994.\n\nD. Orban, Montreal, 08/2015.\n@book{ConnGouldToint1992LANCELOT,\n author = {Conn, A. R. and Gould, N. I. M. and Toint, Ph. L.},\n title = {{LANCELOT}: a {Fortran} package for large-scale nonlinear optimization ({Release A})},\n series = {Springer Series in Computational Mathematics},\n volume = {17},\n publisher = {Springer},\n address = {Heidelberg},\n year = {1992},\n doi = {10.1007/978-3-662-12211-2}\n} \n CUTEst:EG2, Luksan:25
10899true33truetrueelectruefalsefalsefalseotherquadratic-InfInfmissingmissingunknownhttps://bitbucket.org/optrove/sif/src/master/ELEC.SIFGiven np electrons, find the equilibrium state distribution of minimal\nColumb potential of the electrons positioned on a conducting sphere\n\nclassification OOR2-AN-V-V\nThis is problem 2 in the COPS (Version 3) collection of \nE. Dolan and J. More'\nsee "Benchmarking Optimization Software with COPS"\nArgonne National Labs Technical Report ANL/MCS-246 (2004)\n\nSIF input: Nick Gould, November 2000\n@techreport{DolanMore2004COPS,\n author = {Dolan, Elizabeth D. and Mor{'e}, Jorge J.},\n title = {Benchmarking Optimization Software with {COPS} 3.0},\n institution = {Argonne National Laboratory},\n number = {ANL/MCS-TM-273},\n year = {2004},\n doi = {10.2172/834714}\n }\n CUTEst:ELEC, COPS:2
109100true0falsetrueengval1falsefalsefalsefalseotherunconstrained-Inf5841.0truemissingunknownhttps://bitbucket.org/optrove/sif/src/master/ENGVAL1.SIFThe ENGVAL1 problem.\nThis problem is a sum of 2n-2 groups, n-1 of which contain 2 nonlinear\nelements.\n\nclassification OUR2-AN-V-0\nProblem 31 in\nPh.L. Toint,\nTest problems for partially separable optimization and results\nfor the routine PSPMIN,\nReport 83/4, Department of Mathematics, FUNDP (Namur, B), 1983.\n\nSee also\n\nproblem 26 in\nL. Luksan, C. Matonoha and J. Vlcek\nModified CUTE problems for sparse unconstrained optimization,\nTechnical Report 1081,\nInstitute of Computer Science,\nAcademy of Science of the Czech Republic\n\nhttp://www.cs.cas.cz/matonoha/download/V1081.pdf\n\nSee also Buckley#172 (p. 52)\n\nSIF input: Ph. Toint and N. Gould, Dec 1989.\n\nD. Orban, Montreal, 08/2015.\n@techreport{Toint1983,\n author = {Ph. L. Toint},\n title = {Test problems for partially separable optimization and results for the routine PSPMIN},\n institution = {Department of Mathematics, FUNDP (Namur, Belgium)},\n number = {Report 83/4},\n year = {1983}\n} \n CUTEst:ENGVAL1, Luksan:26
1109false0falsetrueensofalsefalsefalsefalseleast_squaresunconstrained-Inf500.0truemissingunknownhttps://bitbucket.org/optrove/sif/src/master/ENSO.SIFhttps://www.itl.nist.gov/div898/strd/nls/data/LINKS/DATA/enso.dat\n\nNIST/ITL StRD\nDataset Name: ENSO (ENSO.dat)\n\nFile Format: ASCII\n Starting Values (lines 41 to 49)\n Certified Values (lines 41 to 54)\n Data (lines 61 to 228)\n\nProcedure: Nonlinear Least Squares Regression\n\nDescription: The data are monthly averaged atmospheric pressure \n differences between Easter Island and Darwin, \n Australia. This difference drives the trade winds in \n the southern hemisphere. Fourier analysis of the data\n reveals 3 significant cycles. The annual cycle is the\n strongest, but cycles with periods of approximately 44\n and 26 months are also present. These cycles\n correspond to the El Nino and the Southern Oscillation.\n Arguments to the SIN and COS functions are in radians.\n\nReference: Kahaner, D., C. Moler, and S. Nash, (1989). \n Numerical Methods and Software. \n Englewood Cliffs, NJ: Prentice Hall, pp. 441-445.\n\nData: 1 Response (y = atmospheric pressure)\n 1 Predictor (x = time)\n 168 Observations\n Average Level of Difficulty\n Observed Data\n\nModel: Miscellaneous Class\n 9 Parameters (b1 to b9)\n\n y = b1 + b2*cos( 2*pi*x/12 ) + b3*sin( 2*pi*x/12 ) \n + b5*cos( 2*pi*x/b4 ) + b6*sin( 2*pi*x/b4 )\n + b8*cos( 2*pi*x/b7 ) + b9*sin( 2*pi*x/b7 ) + e\n\nNIST Data fitting problem ENSO given as an inconsistent set of\nnonlinear equations.\nFit: y = b1 + b2*cos( 2*pi*x/12 ) + b3*sin( 2*pi*x/12 ) \n+ b5*cos( 2*pi*x/b4 ) + b6*sin( 2*pi*x/b4 )\n+ b8*cos( 2*pi*x/b7 ) + b9*sin( 2*pi*x/b7 ) + e\n\nclassification NOR2-MN-9-168\nProblem from the NIST nonlinear regression test set\nhttp://www.itl.nist.gov/div898/strd/nls/nls_main.shtml\nReference: Kahaner, D., C. Moler, and S. Nash, (1989). \nNumerical Methods and Software. \nEnglewood Cliffs, NJ: Prentice Hall, pp. 441-445.\n\nSIF input: Nick Gould and Tyrone Rees, Oct 2015\n@book{KahanerMolerNash1989,\n author = {Kahaner, David and Moler, Cleve and Nash, Stephen},\n title = {Numerical Methods and Software},\n publisher = {Prentice Hall},\n address = {Englewood Cliffs, NJ},\n year = {1989}\n}\nCUTEst:ENSO, NIST:ENSO
111100true0falsetrueerrinros_modfalsefalsefalsefalseleast_squaresunconstrained-Inf3.13991e5truemissingunknownhttp://www.cs.cas.cz/matonoha/download/V1081.pdfErrin Rosenbrock - modified function.\n\nproblem 28 in\nL. Luksan, C. Matonoha and J. Vlcek\nModified CUTE problems for sparse unconstrained optimization,\nTechnical Report 1081,\nInstitute of Computer Science,\nAcademy of Science of the Czech Republic\n\nhttp://www.cs.cas.cz/matonoha/download/V1081.pdf\n\nclassification SUR2-AN-V-0\n\nJ,-P, Dussault, Rennes 09/2015.\n\n@techreport{LuksanMatonohaVlcek2003,\n author = {Luksan, Ladislav and Matonoha, Cestmir and Vlcek, Jan},\n title = {Modified {CUTE} Problems for Sparse Unconstrained Optimization},\n institution = {Institute of Computer Science, Academy of Sciences of the Czech Republic},\n number = {1081},\n year = {2003},\n address = {Prague, Czech Republic},\n url = {http://www.cs.cas.cz/matonoha/download/V1081.pdf},\n } \n Luksan:28
112100true0falsetrueextrosnbfalsefalsefalsefalseotherunconstrained-Inf39604.0truemissingunknownhttps://bitbucket.org/optrove/sif/src/master/EXTROSNB.SIFThe extended Rosenbrock function (nonseparable version).\n\nclassification SUR2-AN-V-0\nProblem 10 in\nPh.L. Toint,\n"Test problems for partially separable optimization and results\nfor the routine PSPMIN",\nReport 83/4, Department of Mathematics, FUNDP (Namur, B), 1983.\n\nSee also Buckley#116. Note that MGH#21 is the separable version.\nSIF input: Ph. Toint, Dec 1989.\n\nproblem 29 in\nL. Luksan, C. Matonoha and J. Vlcek\nModified CUTE problems for sparse unconstrained optimization,\nTechnical Report 1081,\nInstitute of Computer Science,\nAcademy of Science of the Czech Republic\n\nhttp://www.cs.cas.cz/matonoha/download/V1081.pdf\n\nJ.-P. Dussault, Rennes 09/2015.\n@techreport{Toint1983,\n author = {Ph. L. Toint},\n title = {Test problems for partially separable optimization and results for the routine PSPMIN},\n institution = {Department of Mathematics, FUNDP (Namur, Belgium)},\n number = {Report 83/4},\n year = {1983}\n} \n CUTEst:EXTROSNB, Luksan:29
113100true0falsetruefletcbv2falsefalsefalsefalseotherunconstrained-Inf-0.513108truemissingunknownhttps://bitbucket.org/optrove/sif/src/master/FLETCBV2.SIFAnother Boundary Value problem.\n\nclassification OUR2-AN-V-0\nThe first problem given by\nR. Fletcher,\n"An optimal positive definite update for sparse Hessian matrices"\nNumerical Analysis report NA/145, University of Dundee, 1992.\nbut assuming that the 1/h**2 term should read h**2\nThis is what Fletcher intended (private communication).\nThe author comments: "The problem arises from discretizing the bvp\nx"=-2+sin x in [0,1]\nwith x(0)=0, x(1)=1. This gives a symmetric system of equations,\nthe residual vector of which is the gradient of the given function."\nHe multiplies through by h^2 before integrating.\n\nScaled version.\n\nSIF input: Nick Gould, Nov 1992.\n\nproblem 31 in\nL. Luksan, C. Matonoha and J. Vlcek\nModified CUTE problems for sparse unconstrained optimization,\nTechnical Report 1081,\nInstitute of Computer Science,\nAcademy of Science of the Czech Republic\n\nhttp://www.cs.cas.cz/matonoha/download/V1081.pdf\n\nJ,-P, Dussault, Rennes 09/2015.\n@techreport{Fletcher1992,\n author = {Fletcher, R.},\n title = {An Optimal Positive Definite Update for Sparse {Hessian} Matrices},\n institution = {University of Dundee},\n type = {Numerical Analysis Report},\n number = {NA/145},\n year = {1992}\n} \n CUTEst:FLETCBV2, Luksan:31
114100true0falsetruefletcbv3_modfalsefalsefalsefalseotherunconstrained-Inf-0.0187925truemissingunknownhttp://www.cs.cas.cz/matonoha/download/V1081.pdfclassification OUR2-AN-V-0\n\nJ.-P. Dussault, Rennes 09/2015.\nThe first problem given by\nR. Fletcher,\n"An optimal positive definite update for sparse Hessian matrices"\nNumerical Analysis report NA/145, University of Dundee, 1992.\n\nScaled version.\n\nSIF input: Nick Gould, Oct 1992.\n\nproblem 30 in\nL. Luksan, C. Matonoha and J. Vlcek\nModified CUTE problems for sparse unconstrained optimization,\nTechnical Report 1081,\nInstitute of Computer Science,\nAcademy of Science of the Czech Republic\n\nhttp://www.cs.cas.cz/matonoha/download/V1081.pdf\n@techreport{LuksanMatonohaVlcek2003,\n author = {Luksan, Ladislav and Matonoha, Cestmir and Vlcek, Jan},\n title = {Modified {CUTE} Problems for Sparse Unconstrained Optimization},\n institution = {Institute of Computer Science, Academy of Sciences of the Czech Republic},\n number = {1081},\n year = {2003},\n address = {Prague, Czech Republic},\n url = {http://www.cs.cas.cz/matonoha/download/V1081.pdf},\n } \n Luksan:30
115100true0falsetruefletchcrfalsefalsefalsefalseotherunconstrained-Inf9900.0truemissingunknownhttps://bitbucket.org/optrove/sif/src/master/FLETCHCR.SIFThe chained Rosenbrock function as given by Fletcher.\n\nclassification OUR2-AN-V-0\nproblem 32 in\nL. Luksan, C. Matonoha and J. Vlcek\nModified CUTE problems for sparse unconstrained optimization,\nTechnical Report 1081,\nInstitute of Computer Science,\nAcademy of Science of the Czech Republic\n\nhttp://www.cs.cas.cz/matonoha/download/V1081.pdf\n\nCUTEst cites\n The second problem given by\n R. Fletcher,\n "An optimal positive definite update for sparse Hessian matrices"\n Numerical Analysis report NA/145, University of Dundee, 1992.\n\nScaled version.\n\nSIF input: Nick Gould, Oct 1992.\n\nas source for this problem.\nIt is possible that Fletcher may have used this problem in his\ntechnical report, but the published version of his report\n\nSIAM J. Optimization, 5(1), pp 192-218, 1995\n\nuses the chained Rosenbrock problem, not the one below.\n\nJ.-P. Dussault, Rennes 09/2015.\n@techreport{Fletcher1992,\n author = {Fletcher, R.},\n title = {An Optimal Positive Definite Update for Sparse {Hessian} Matrices},\n institution = {University of Dundee},\n type = {Numerical Analysis Report},\n number = {NA/145},\n year = {1992}\n} \n CUTEst:FLETCHCR, Luksan:32
116100false0falsetruefminsrf2falsefalsefalsefalseotherunconstrained-Inf2504.27truemissingunknownhttps://bitbucket.org/optrove/sif/src/master/FMINSRF2.SIFThe free boundary minimum surface problem.\nThe problem comes from the discretization of the minimum surface\nproblem on the unit square with "free boundary conditions"\none must find the minumum surface over the unit square \n(which is clearly 1.0). Furthermore, the distance of the surface\nfrom zero at the centre of the unit square is also minimized.\nThe unit square is discretized into (p-1)**2 little squares. The\nheights of the considered surface above the corners of these little\nsquares are the problem variables, There are p**2 of them.\nGiven these heights, the area above a little square is\napproximated by the\nS(i,j) = sqrt( 1 + 0.5(p-1)**2 ( a(i,j) + b(i,j) ) ) / (p-1)**2\nwhere\na(i,j) = x(i,j) - x(i+1,j+1)\nand\nb(i,j) = x(i+1,j) - x(i,j+1)\n\nclassification OUR2-MY-V-0\nSetting the boundary free in\nA Griewank and Ph. Toint,\n"Partitioned variable metric updates for large structured\noptimization problems",\nNumerische Mathematik 39:429-448, 1982.\n\nSIF input: Ph. Toint, November 1991.\n\nProblem 33 in\nL. Luksan, C. Matonoha and J. Vlcek\nModified CUTE problems for sparse unconstrained optimization,\nTechnical Report 1081,\nInstitute of Computer Science,\nAcademy of Science of the Czech Republic\n\nhttp://www.cs.cas.cz/matonoha/download/V1081.pdf\nJ.-P. Dussault, Rennes 09/2015.\n@article{GriewankToint1982NM,\n author = {Griewank, A. and Toint, Ph. L.},\n title = {Partitioned variable metric updates for large structured optimization problems},\n journal = {Numerische Mathematik},\n year = {1982},\n volume = {39},\n number = {1},\n pages = {119--137},\n doi = {10.1007/bf01399316}\n} \n CUTEst:FMINSRF2, Luksan:33
117100true0falsetruefreurothfalsefalsefalsefalseleast_squaresunconstrained-Inf99556.5truemissingunknownhttp://www.cs.cas.cz/matonoha/download/V1081.pdf, https://bitbucket.org/optrove/sif/src/master/FREUROTH.SIFThe Freudentstein and Roth test problem\n\nclassification SUR2-AN-V-0\nJ.-P. Dussault, Rennes 09/2015.\nproblem 34 in\nL. Luksan, C. Matonoha and J. Vlcek\nModified CUTE problems for sparse unconstrained optimization,\nTechnical Report 1081,\nInstitute of Computer Science,\nAcademy of Science of the Czech Republic\n\nproblem 2 in\nJ.J. More', B.S. Garbow and K.E. Hillstrom,\n"Testing Unconstrained Optimization Software",\nACM Transactions on Mathematical Software, vol. 7(1), pp. 17-41, 1981.\nSee also Toint#33, Buckley#24\n\nSIF input: Ph. Toint, Dec 1989.\n@article{MoreGarbowHillstrom1981,\n author = {Mor{\\'e}, Jorge J. and Garbow, Burton S. and Hillstrom, Kenneth E.},\n title = {Testing Unconstrained Optimization Software},\n journal = {ACM Transactions on Mathematical Software},\n year = {1981},\n volume = {7},\n number = {1},\n pages = {17--41},\n doi = {10.1145/355934.355936}\n} \n CUTEst:FREUROTH, Luksan:34
1182603true2600truetruegasoiltruefalsetruefalseothergeneral-InfInfmissingmissingunknownhttps://bitbucket.org/optrove/sif/src/master/GASOIL.SIFCatalytic Cracking of Gas Oil Problem\nCollocation formulation\n\nDetermine the reaction coefficients for the catalytic cracking of gas oil\nand other byproducts. The nonlinear model that describes the process is\ny_1' = - (theta_1 + theta_3 ) y_1^2\ny_2' = theta_1 y_1^2 + theta_2 y_2\nwith given initial conditions. The problem is to minimize\nsum{i=1,20} || y(tau_i,theta) - z_i||^2\nwhere the z_i are concentration measurements for y at times tau_i (i=1,20)\n\nclassification OOR2-AN-V-V\nThis is problem 12 in the COPS (Version 2) collection of \nE. Dolan and J. More'\nsee "Benchmarking Optimization Software with COPS"\nArgonne National Labs Technical Report ANL/MCS-246 (2000)\n\nMichael Merritt - Summer 2000\nCOPS 2.0 - September 2000\nCOPS 3.0 - November 2002\nCOPS 3.1 - March 2004\n\nSIF input: Nick Gould, November 2000\n@techreport{DolanMore2004COPS,\n author = {Dolan, Elizabeth D. and Mor{'e}, Jorge J.},\n title = {Benchmarking Optimization Software with {COPS} 3.0},\n institution = {Argonne National Laboratory},\n number = {ANL/MCS-TM-273},\n year = {2004},\n doi = {10.2172/834714}\n }\n CUTEst:GASOIL, COPS:12
1198false0falsetruegauss1falsefalsefalsefalseleast_squaresunconstrained-Inf500.0truemissingunknownhttps://bitbucket.org/optrove/sif/src/master/GAUSS1.SIFhttps://www.itl.nist.gov/div898/strd/nls/data/LINKS/DATA/gauss1.dat\n\nNIST/ITL StRD\nDataset Name: Gauss1 (Gauss1.dat)\n\nFile Format: ASCII\n Starting Values (lines 41 to 48)\n Certified Values (lines 41 to 53)\n Data (lines 61 to 310)\n\nProcedure: Nonlinear Least Squares Regression\n\nDescription: The data are two well-separated Gaussians on a \n decaying exponential baseline plus normally \n distributed zero-mean noise with variance = 6.25.\n\nReference: Rust, B., NIST (1996).\n\nData: 1 Response (y)\n 1 Predictor (x)\n 250 Observations\n Lower Level of Difficulty\n Generated Data\n\nModel: Exponential Class\n 8 Parameters (b1 to b8) \n\n y = b1*exp( -b2*x ) + b3*exp( -(x-b4)**2 / b5**2 )\n + b6*exp( -(x-b7)**2 / b8**2 ) + e\nT. Migot, Montreal, 2023.\n\nNIST Data fitting problem GAUSS1 given as an inconsistent set of\nnonlinear equations.\nFit: y = b1*exp( -b2*x ) + b3*exp( -(x-b4)**2 / b5**2 )\n+ b6*exp( -(x-b7)**2 / b8**2 ) + e\n\nclassification NOR2-MN-8-250\nProblem from the NIST nonlinear regression test set\nhttp://www.itl.nist.gov/div898/strd/nls/nls_main.shtml\nReference: Rust, B., NIST (1996).\n\nSIF input: Nick Gould and Tyrone Rees, Oct 2015\n@misc{NISTStRD,\n author = {{National Institute of Standards and Technology}},\n title = {{NIST/ITL StRD}: Nonlinear Regression Reference Datasets},\n howpublished = {\\url{https://www.itl.nist.gov/div898/strd/nls/nls_main.shtml}},\n year = {1997}\n}\nCUTEst:GAUSS1, NIST:Gauss1
1208false0falsetruegauss2falsefalsefalsefalseleast_squaresunconstrained-Inf500.0truemissingunknownhttps://bitbucket.org/optrove/sif/src/master/GAUSS2.SIFhttps://www.itl.nist.gov/div898/strd/nls/data/LINKS/DATA/gauss2.dat\n\nNIST/ITL StRD\nDataset Name: Gauss2 (Gauss2.dat)\n\nFile Format: ASCII\n Starting Values (lines 41 to 48)\n Certified Values (lines 41 to 53)\n Data (lines 61 to 310)\n\nProcedure: Nonlinear Least Squares Regression\n\nDescription: The data are two slightly-blended Gaussians on a \n decaying exponential baseline plus normally \n distributed zero-mean noise with variance = 6.25. \n\nReference: Rust, B., NIST (1996). \n\nData: 1 Response (y)\n 1 Predictor (x)\n 250 Observations\n Lower Level of Difficulty\n Generated Data\n\nModel: Exponential Class\n 8 Parameters (b1 to b8)\n\n y = b1*exp( -b2*x ) + b3*exp( -(x-b4)**2 / b5**2 ) \n + b6*exp( -(x-b7)**2 / b8**2 ) + e\nT. Migot, Montreal, 2023.\n\nNIST Data fitting problem GAUSS2 given as an inconsistent set of\nnonlinear equations.\nFit: y = b1*exp( -b2*x ) + b3*exp( -(x-b4)**2 / b5**2 )\n+ b6*exp( -(x-b7)**2 / b8**2 ) + e\n\nclassification NOR2-MN-8-250\nProblem from the NIST nonlinear regression test set\nhttp://www.itl.nist.gov/div898/strd/nls/nls_main.shtml\nReference: Rust, B., NIST (1996).\n\nSIF input: Nick Gould and Tyrone Rees, Oct 2015\n@misc{NISTStRD,\n author = {{National Institute of Standards and Technology}},\n title = {{NIST/ITL StRD}: Nonlinear Regression Reference Datasets},\n howpublished = {\\url{https://www.itl.nist.gov/div898/strd/nls/nls_main.shtml}},\n year = {1997}\n}\nCUTEst:GAUSS2, NIST:Gauss2
1218false0falsetruegauss3falsefalsefalsefalseleast_squaresunconstrained-Inf500.0truemissingunknownhttps://bitbucket.org/optrove/sif/src/master/GAUSS3.SIFhttps://www.itl.nist.gov/div898/strd/nls/data/LINKS/DATA/gauss3.dat\n\nNIST/ITL StRD\nDataset Name: Gauss3 (Gauss3.dat)\n\nFile Format: ASCII\n Starting Values (lines 41 to 48)\n Certified Values (lines 41 to 53)\n Data (lines 61 to 310)\n\nProcedure: Nonlinear Least Squares Regression\n\nDescription: The data are two strongly-blended Gaussians on a \n decaying exponential baseline plus normally \n distributed zero-mean noise with variance = 6.25.\n\nReference: Rust, B., NIST (1996).\n\nData: 1 Response (y)\n 1 Predictor (x)\n 250 Observations\n Average Level of Difficulty\n Generated Data\n\nModel: Exponential Class\n 8 Parameters (b1 to b8)\n\n y = b1*exp( -b2*x ) + b3*exp( -(x-b4)**2 / b5**2 )\n + b6*exp( -(x-b7)**2 / b8**2 ) + e\n# T. Migot, Montreal, 2023.\n\nNIST Data fitting problem GAUSS3 given as an inconsistent set of\nnonlinear equations.\nFit: y = b1*exp( -b2*x ) + b3*exp( -(x-b4)**2 / b5**2 )\n+ b6*exp( -(x-b7)**2 / b8**2 ) + e\n\nclassification NOR2-MN-8-250\nProblem from the NIST nonlinear regression test set\nhttp://www.itl.nist.gov/div898/strd/nls/nls_main.shtml\nReference: Rust, B., NIST (1996).\n\nSIF input: Nick Gould and Tyrone Rees, Oct 2015\n@misc{NISTStRD,\n author = {{National Institute of Standards and Technology}},\n title = {{NIST/ITL StRD}: Nonlinear Regression Reference Datasets},\n howpublished = {\\url{https://www.itl.nist.gov/div898/strd/nls/nls_main.shtml}},\n year = {1997}\n}\nCUTEst:GAUSS3, NIST:Gauss3
1223false0falsetruegaussianfalsefalsefalsefalseleast_squaresunconstrained-Inf3.88811e-6truemissingunknownhttps://bitbucket.org/optrove/sif/src/master/GAUSSIAN.SIFMore''s gaussian problem in 3 variables. This is a nonlinear least-squares\nversion of problem ARGAUSS.\n\nclassification SUR2-AN-3-0\nProblem 9 in\nJ.J. More', B.S. Garbow and K.E. Hillstrom,\n"Testing Unconstrained Optimization Software",\nACM Transactions on Mathematical Software, vol. 7(1), pp. 17-41, 1981.\nSee also Buckley#28\n\nSIF input: Ph. Toint, Dec 1989.\n@article{MoreGarbowHillstrom1981,\n author = {Mor{\\'e}, Jorge J. and Garbow, Burton S. and Hillstrom, Kenneth E.},\n title = {Testing Unconstrained Optimization Software},\n journal = {ACM Transactions on Mathematical Software},\n year = {1981},\n volume = {7},\n number = {1},\n pages = {17--41},\n doi = {10.1145/355934.355936}\n} \n CUTEst:GAUSSIAN
123100true0falsetruegenbroydenbfalsefalsefalsefalseleast_squaresunconstrained-InfInfmissingmissingliteraturehttps://www.researchgate.net/publication/325314400_Sparse_Test_Problems_for_Unconstrained_OptimizationGeneralized Broyden banded function\nProblem 6 in\nL. Luksan, C. Matonoha and J. Vlcek\nSparse Test Problems for Unconstrained Optimization,\nTechnical Report 1064,\nInstitute of Computer Science,\nAcademy of Science of the Czech Republic\n@techreport{LuksanMatonohaVlcek2010Sparse,\n author = {Luksan, Ladislav and Matonoha, Ctirad and Vlcek, Jan},\n title = {Sparse Test Problems for Unconstrained Optimization},\n institution = {Institute of Computer Science, Academy of Sciences of the Czech Republic},\n number = {V-1064},\n year = {2010},\n address = {Prague, Czech Republic},\n url = {https://www.researchgate.net/publication/325314400_Sparse_Test_Problems_for_Unconstrained_Optimization}\n }\n LuksanSparse:6
124100true0falsetruegenbroydentrifalsefalsefalsefalseleast_squaresunconstrained-InfInfmissingmissingliteraturehttps://www.researchgate.net/publication/325314400_Sparse_Test_Problems_for_Unconstrained_Optimization\nGeneralized Broyden Tridiagonal Function\nProblem 5 in\nL. Luksan, C. Matonoha and J. Vlcek\nSparse Test Problems for Unconstrained Optimization,\nTechnical Report 1064,\nInstitute of Computer Science,\nAcademy of Science of the Czech Republic\n@techreport{LuksanMatonohaVlcek2010Sparse,\n author = {Luksan, Ladislav and Matonoha, Ctirad and Vlcek, Jan},\n title = {Sparse Test Problems for Unconstrained Optimization},\n institution = {Institute of Computer Science, Academy of Sciences of the Czech Republic},\n number = {V-1064},\n year = {2010},\n address = {Prague, Czech Republic},\n url = {https://www.researchgate.net/publication/325314400_Sparse_Test_Problems_for_Unconstrained_Optimization}\n }\n LuksanSparse:5
125100true0falsetruegenhumpsfalsefalsefalsefalseotherunconstrained-Inf2.53684e6truemissingunknownhttp://www.cs.cas.cz/matonoha/download/V1081.pdf, https://bitbucket.org/optrove/sif/src/master/GENHUMPS.SIFA multi-dimensional variant of HUMPS, a two dimensional function\nwith a lot of humps. The density of humps increases with the\nparameter ZETA, making the problem more difficult.\nThe problem is nonconvex.\n\nclassification OUR2-AN-V-0\n\nclassification SUR2-AN-V-0\nJ.-P. Dussault, Rennes 09/2015.\nproblem 35 in\nL. Luksan, C. Matonoha and J. Vlcek\nModified CUTE problems for sparse unconstrained optimization,\nTechnical Report 1081,\nInstitute of Computer Science,\nAcademy of Science of the Czech Republic\n\nPh. Toint, private communication, 1997.\nSDIF input: N. Gould and Ph. Toint, November 1997.\n@techreport{LuksanMatonohaVlcek2003,\n author = {Luksan, Ladislav and Matonoha, Cestmir and Vlcek, Jan},\n title = {Modified {CUTE} Problems for Sparse Unconstrained Optimization},\n institution = {Institute of Computer Science, Academy of Sciences of the Czech Republic},\n number = {1081},\n year = {2003},\n address = {Prague, Czech Republic},\n url = {http://www.cs.cas.cz/matonoha/download/V1081.pdf},\n } \n CUTEst:GENHUMPS, Luksan:35
126100true0falsetruegenrosefalsefalsefalsefalseleast_squaresunconstrained-Inf405.106truemissingunknownhttps://bitbucket.org/optrove/sif/src/master/GENROSE.SIFGeneralized Rosenbrock function.\n\nclassification SUR2-AN-V-0\n\nproblem 36 in\nL. Luksan, C. Matonoha and J. Vlcek\nModified CUTE problems for sparse unconstrained optimization,\nTechnical Report 1081,\nInstitute of Computer Science,\nAcademy of Science of the Czech Republic\nproblem 5 in\nS. Nash,\n"Newton-type minimization via the Lanczos process",\nSIAM J. Num. Anal. 21, 1984, 770-788.\n\nSIF input: Nick Gould, Oct 1992.\n@article{Nash1984SIAMNA,\n author = {Nash, Stephen G.},\n title = {Newton-Type Minimization via the {Lanczos} Method},\n journal = {SIAM Journal on Numerical Analysis},\n year = {1984},\n volume = {21},\n number = {4},\n pages = {770--788},\n doi = {10.1137/0721052}\n} \n CUTEst:GENROSE, Luksan:36
127100true0falsetruegenrose_nashfalsefalsefalsefalseotherunconstrained-Inf404.126truemissingunknownhttp://www.cs.cas.cz/matonoha/download/V1081.pdfGeneralized Rosenbrock function.\n\nclassification SUR2-AN-V-0\n\nNote: this variant does not reduce to the classical\nRosenbrock function when n = 2, described in\n\nH. H. Rosenbrock,\nAn automatic method for finding the greatest or least value\nof a function\nThe Computer Journal 3: 175–184, 1960.\nhttps://doi.org/10.1093/comjnl/3.3.175\n\nD. Orban, Montreal, 08/2015.\n\n \n# Institute of Computer Science,\n# Academy of Science of the Czech Republic\n#\n# http://www.cs.cas.cz/matonoha/download/V1081.pdf\n#\n# classification SUR2-AN-V-0\n#\n# D. Orban, Montreal, 08/2015.\n\n# Note: difference from CUTEst is due to the constant 1.0,\n# which does not affect its utility as a test problem other than perhaps\n# for convergence-testing.\n\n# Difference with the following is the initial guess.\n#\n# Problem 1 in\n# L. Luksan, C. Matonoha and J. Vlcek\n# Sparse Test Problems for Unconstrained Optimization,\n# Technical Report 1064,\n# Institute of Computer Science,\n# Academy of Science of the Czech Republic\n#\n# https://www.researchgate.net/publication/325314400_Sparse_Test_Problems_for_Unconstrained_Optimization\n#\nproblem 4 in\nS. Nash,\nNewton-type minimization via the Lanczos process,\nSIAM J. Num. Anal. 21, 770-788, 1984,\n\nand\n\nproblem 36 in\nL. Luksan, C. Matonoha and J. Vlcek\nModified CUTE problems for sparse unconstrained optimization,\nTechnical Report 1081,\nInstitute of Computer Science,\nAcademy of Science of the Czech Republic\n@article{Nash1984SIAMNA,\n author = {Nash, Stephen G.},\n title = {Newton-Type Minimization via the {Lanczos} Method},\n journal = {SIAM Journal on Numerical Analysis},\n year = {1984},\n volume = {21},\n number = {4},\n pages = {770--788},\n doi = {10.1137/0721052}\n} \n Luksan:36, LuksanSparse:1
128506true407truefalseglidertruefalsetruefalseothergeneral-InfInfmissingmissingunknownhttps://bitbucket.org/optrove/sif/src/master/GLIDER.SIFHang Glider Problem\nTrapezoidal formulation\n\nMaximize the final horizontal position of a hang glider in the presence\nof a thermal updraft.\n\nclassification OOR2-AN-V-V\nThis is problem 11 in the COPS (Version 2) collection of \nE. Dolan and J. More'\nsee "Benchmarking Optimization Software with COPS"\nArgonne National Labs Technical Report ANL/MCS-246 (2000)\n\nDavid Bortz - Summer 1998\nCOPS 2.0 - September 2000\nCOPS 3.0 - November 2002\nCOPS 3.1 - March 2004\n\nSIF input: Nick Gould, December 2000\n@techreport{DolanMore2004COPS,\n author = {Dolan, Elizabeth D. and Mor{'e}, Jorge J.},\n title = {Benchmarking Optimization Software with {COPS} 3.0},\n institution = {Argonne National Laboratory},\n number = {ANL/MCS-TM-273},\n year = {2004},\n doi = {10.2172/834714}\n }\n CUTEst:GLIDER, COPS:11
1293false0falsetruegulffalsefalsefalsefalseleast_squaresunconstrained-Inf0.0truefalserealhttps://bitbucket.org/optrove/sif/src/master/GULF.SIFThe Gulf research and development function for m = 99. \n\nSUR2-MN-3-0\n\nThe Gulf RD test problem in 3 variables.\nThis function is a nonlinear least squares with 99 groups. Each\ngroup has a nonlinear element of exponential type.\nThe number of groups may be varied, but must be larger or equal to 3\n\nclassification SUR2-MN-3-0\nproblem 27 (p. 57) in\n A.R. Buckley,\n "Test functions for unconstrained minimization",\n TR 1989CS-3, Mathematics, statistics and computing centre,\n Dalhousie University, Halifax (CDN), 1989.\n\nproblem 11 in\nJ.J. More', B.S. Garbow and K.E. Hillstrom,\n"Testing Unconstrained Optimization Software",\nACM Transactions on Mathematical Software, vol. 7(1), pp. 17-41, 1981.\nSee also Buckley#27\n\nSIF input: Ph. Toint, Dec 1989.\n@article{MoreGarbowHillstrom1981,\n author = {Mor{\\'e}, Jorge J. and Garbow, Burton S. and Hillstrom, Kenneth E.},\n title = {Testing Unconstrained Optimization Software},\n journal = {ACM Transactions on Mathematical Software},\n year = {1981},\n volume = {7},\n number = {1},\n pages = {17--41},\n doi = {10.1145/355934.355936}\n} \n CUTEst:GULF
1307false0falsetruehahn1falsefalsefalsefalseleast_squaresunconstrained-Inf500.0truemissingunknownhttps://www.itl.nist.gov/div898/strd/nls/data/LINKS/DATA/hahn1.dat, https://bitbucket.org/optrove/sif/src/master/HAHN1.SIFNIST/ITL StRD\nDataset Name: Hahn1 (Hahn1.dat)\n\nFile Format: ASCII\n Starting Values (lines 41 to 47)\n Certified Values (lines 41 to 52)\n Data (lines 61 to 296)\n\nProcedure: Nonlinear Least Squares Regression\n\nDescription: These data are the result of a NIST study involving\n the thermal expansion of copper. The response \n variable is the coefficient of thermal expansion, and\n the predictor variable is temperature in degrees \n kelvin.\n\nReference: Hahn, T., NIST (197?). \n Copper Thermal Expansion Study.\n\nData: 1 Response (y = coefficient of thermal expansion)\n 1 Predictor (x = temperature, degrees kelvin)\n 236 Observations\n Average Level of Difficulty\n Observed Data\n\nModel: Rational Class (cubic/cubic)\n 7 Parameters (b1 to b7)\n\n y = (b1+b2*x+b3*x**2+b4*x**3) /\n (1+b5*x+b6*x**2+b7*x**3) + e\n# T. Migot, Montreal, 2023.\n\nNIST Data fitting problem HAHN1 given as an inconsistent set of\nnonlinear equations.\nFit: y = (b1 + b2*x + b3*x**2 + b4*x**3) / \n(1 + b5*x + b6*x**2 + b7*x**3) + e\n\nclassification NOR2-MN-7-37\nProblem from the NIST nonlinear regression test set\nhttp://www.itl.nist.gov/div898/strd/nls/nls_main.shtml\nReference: Hahn, T., NIST (197?). \nCopper Thermal Expansion Study.\n\nSIF input: Nick Gould and Tyrone Rees, Oct 2015\n@misc{NISTStRD,\n author = {{National Institute of Standards and Technology}},\n title = {{NIST/ITL StRD}: Nonlinear Regression Reference Datasets},\n howpublished = {\\url{https://www.itl.nist.gov/div898/strd/nls/nls_main.shtml}},\n year = {1997}\n}\nCUTEst:HAHN1, NIST:Hahn1
1313false0falsetruehelicalfalsefalsefalsefalseotherunconstrained-Inf0.0truemissingunknownhttps://doi.org/10.1145/355934.355936\nproblem 7 in\nJ.J. More', B.S. Garbow and K.E. Hillstrom,\n"Testing Unconstrained Optimization Software",\nACM Transactions on Mathematical Software, vol. 7(1), pp. 17-41, 1981.\n@article{MoreGarbowHillstrom1981,\n author = {Mor{\\'e}, Jorge J. and Garbow, Burton S. and Hillstrom, Kenneth E.},\n title = {Testing Unconstrained Optimization Software},\n journal = {ACM Transactions on Mathematical Software},\n year = {1981},\n volume = {7},\n number = {1},\n pages = {17--41},\n doi = {10.1145/355934.355936}\n} \n MGH:7
13298true68truetruehovercraft1dtruefalsefalsefalseleast_squareslinear-InfInfmissingmissingunknownhttps://laurentlessard.com/teaching/524-intro-to-optimization/\nJuMP model follows Laurent Lessard CS/ECE/ISyE 524, University of Wisconsin–Madison, \nIntroduction to Optimization class.\n\nHovercraft 1D example\nhttps://laurentlessard.com/teaching/524-intro-to-optimization/\n@misc{Lessard524,\n author = {Lessard, Laurent},\n title = {Introduction to Optimization, {CS/ECE/ISyE} 524},\n howpublished = {Lecture notes, University of Wisconsin--Madison},\n url = {https://laurentlessard.com/teaching/524-intro-to-optimization/},\n year = {2023}\n}\n
1332false0falsetruehs1falsefalsetruefalseotherunconstrained-Inf909.0truemissingunknownhttps://bitbucket.org/optrove/sif/src/master/HS1.SIFHock and Schittkowski problem number 1.\n\nThe ever famous 2 variables Rosenbrock "banana valley" problem\nwith a single lower bound.\n\nclassification SBR2-AN-2-0\n\nN. Antunes, Curitiba, 10/2016.\nproblem 1 in\nW. Hock and K. Schittkowski,\n"Test examples for nonlinear programming codes",\nLectures Notes in Economics and Mathematical Systems 187, Springer\nVerlag, Heidelberg, 1981.\n\nSIF input: A.R. Conn, March 1990.\n@book{HockSchittkowski1981,\n author = {Hock, W. and Schittkowski, K.},\n title = {Test Examples for Nonlinear Programming Codes},\n series = {Lecture Notes in Economics and Mathematical Systems},\n volume = {187},\n publisher = {Springer-Verlag},\n address = {Heidelberg},\n year = {1981}\n} \n CUTEst:HS1, HS:1
1342false1falsetruehs10falsetruefalsefalseothergeneral-InfInfmissingmissingunknownhttps://bitbucket.org/optrove/sif/src/master/HS10.SIFHock and Schittkowski problem number 10.\n\nclassification LQR2-AN-2-1\n\nN. Antunes, Curitiba, 10/2016.\nproblem 10 in\nW. Hock and K. Schittkowski,\n"Test examples for nonlinear programming codes",\nLectures Notes in Economics and Mathematical Systems 187, Springer\nVerlag, Heidelberg, 1981.\n\nSIF input: A.R. Conn March 1990\n@book{HockSchittkowski1981,\n author = {Hock, W. and Schittkowski, K.},\n title = {Test Examples for Nonlinear Programming Codes},\n series = {Lecture Notes in Economics and Mathematical Systems},\n volume = {187},\n publisher = {Springer-Verlag},\n address = {Heidelberg},\n year = {1981}\n} \n CUTEst:HS10, HS:10
1357false4falsetruehs100falsetruefalsefalseothergeneral-Inf714.0truemissingunknownhttps://bitbucket.org/optrove/sif/src/master/HS100.SIFHock and Schittkowski problem number 100.\n\nclassification OOR2-AN-7-4\n\nclassification PPR-AN-7-4\n\nA. Montoison, Montreal, 05/2018.\nproblem 100 in\nW. Hock and K. Schittkowski,\n"Test examples for nonlinear programming codes",\nLectures Notes in Economics and Mathematical Systems 187, Springer\nVerlag, Heidelberg, 1981.\n\nSIF input: Ph. Toint, April 1991.\n@book{HockSchittkowski1981,\n author = {Hock, W. and Schittkowski, K.},\n title = {Test Examples for Nonlinear Programming Codes},\n series = {Lecture Notes in Economics and Mathematical Systems},\n volume = {187},\n publisher = {Springer-Verlag},\n address = {Heidelberg},\n year = {1981}\n} \n CUTEst:HS100, HS:100
1367false5falsetruehs101falsetruetruefalseothergeneral-InfInfmissingmissingunknownhttps://bitbucket.org/optrove/sif/src/master/HS101.SIFHock and Schittkowski problem number 101.\n\nclassification OOR2-AN-7-5\n\nclassification PPR-AN-7-6\n\nA. Montoison, Montreal, 05/2018.\nproblem 101 in\nW. Hock and K. Schittkowski,\n"Test examples for nonlinear programming codes",\nLectures Notes in Economics and Mathematical Systems 187, Springer\nVerlag, Heidelberg, 1981.\n\nSIF input: N. Gould, December 1989.\n@book{HockSchittkowski1981,\n author = {Hock, W. and Schittkowski, K.},\n title = {Test Examples for Nonlinear Programming Codes},\n series = {Lecture Notes in Economics and Mathematical Systems},\n volume = {187},\n publisher = {Springer-Verlag},\n address = {Heidelberg},\n year = {1981}\n} \n CUTEst:HS101, HS:101
1377false5falsetruehs102falsetruetruefalseothergeneral-InfInfmissingmissingunknownhttps://bitbucket.org/optrove/sif/src/master/HS102.SIFHock and Schittkowski problem number 102.\n\nclassification OOR2-AN-7-5\n\nclassification PPR-AN-7-6\n\nA. Montoison, Montreal, 05/2018.\nproblem 102 in\nW. Hock and K. Schittkowski,\n"Test examples for nonlinear programming codes",\nLectures Notes in Economics and Mathematical Systems 187, Springer\nVerlag, Heidelberg, 1981.\n\nSIF input: N. Gould, December 1989.\n@book{HockSchittkowski1981,\n author = {Hock, W. and Schittkowski, K.},\n title = {Test Examples for Nonlinear Programming Codes},\n series = {Lecture Notes in Economics and Mathematical Systems},\n volume = {187},\n publisher = {Springer-Verlag},\n address = {Heidelberg},\n year = {1981}\n} \n CUTEst:HS102, HS:102
1387false5falsetruehs103falsetruetruefalseothergeneral-InfInfmissingmissingunknownhttps://bitbucket.org/optrove/sif/src/master/HS103.SIFHock and Schittkowski problem number 103.\n\nclassification OOR2-AN-7-5\n\nclassification PPR-AN-7-6\n\nA. Montoison, Montreal, 05/2018.\nproblem 103 in\nW. Hock and K. Schittkowski,\n"Test examples for nonlinear programming codes",\nLectures Notes in Economics and Mathematical Systems 187, Springer\nVerlag, Heidelberg, 1981.\n\nSIF input: N. Gould, December 1989.\n@book{HockSchittkowski1981,\n author = {Hock, W. and Schittkowski, K.},\n title = {Test Examples for Nonlinear Programming Codes},\n series = {Lecture Notes in Economics and Mathematical Systems},\n volume = {187},\n publisher = {Springer-Verlag},\n address = {Heidelberg},\n year = {1981}\n} \n CUTEst:HS103, HS:103
1398false5falsetruehs104falsetruetruefalseothergeneral-InfInfmissingmissingunknownhttps://bitbucket.org/optrove/sif/src/master/HS104.SIFHock and Schittkowski problem number 104.\n\nclassification OOR2-AN-8-5\n\nclassification PPR-AN-8-6\n\nA. Montoison, Montreal, 05/2018.\nproblem 104 in\nW. Hock and K. Schittkowski,\n"Test examples for nonlinear programming codes",\nLectures Notes in Economics and Mathematical Systems 187, Springer\nVerlag, Heidelberg, 1981.\n\nSIF input: Nick Gould, August 1991.\n@book{HockSchittkowski1981,\n author = {Hock, W. and Schittkowski, K.},\n title = {Test Examples for Nonlinear Programming Codes},\n series = {Lecture Notes in Economics and Mathematical Systems},\n volume = {187},\n publisher = {Springer-Verlag},\n address = {Heidelberg},\n year = {1981}\n} \n CUTEst:HS104, HS:104
1408false1falsetruehs105falsetruetruefalseotherlinear-InfInfmissingmissingunknownhttps://bitbucket.org/optrove/sif/src/master/HS105.SIFHock and Schittkowski problem number 105.\n\nclassification OLR2-AY-8-1\n\nclassification GLR-AN-8-1\n\nA. Montoison, Montreal, 05/2018.\nproblem 105 in\nW. Hock and K. Schittkowski,\n"Test examples for nonlinear programming codes",\nLectures Notes in Economics and Mathematical Systems 187, Springer\nVerlag, Heidelberg, 1981.\n\nSIF input: Nick Gould, August 1991.\n@book{HockSchittkowski1981,\n author = {Hock, W. and Schittkowski, K.},\n title = {Test Examples for Nonlinear Programming Codes},\n series = {Lecture Notes in Economics and Mathematical Systems},\n volume = {187},\n publisher = {Springer-Verlag},\n address = {Heidelberg},\n year = {1981}\n} \n CUTEst:HS105, HS:105
1418false6falsetruehs106falsetruetruefalseothergeneral-InfInfmissingmissingunknownhttps://bitbucket.org/optrove/sif/src/master/HS106.SIFHock and Schittkowski problem number 106.\n\nA heat exchanger design problem.\n\nclassification LQR2-MN-8-6\n\nclassification LQR-AN-8-6\n\nA. Montoison, Montreal, 05/2018.\nproblem 106 in\nW. Hock and K. Schittkowski,\n"Test examples for nonlinear programming codes",\nLectures Notes in Economics and Mathematical Systems 187, Springer\nVerlag, Heidelberg, 1981.\n\nSIF input: J-M COLLIN.\n@book{HockSchittkowski1981,\n author = {Hock, W. and Schittkowski, K.},\n title = {Test Examples for Nonlinear Programming Codes},\n series = {Lecture Notes in Economics and Mathematical Systems},\n volume = {187},\n publisher = {Springer-Verlag},\n address = {Heidelberg},\n year = {1981}\n} \n CUTEst:HS106, HS:106
1429false6falsetruehs107truefalsetruefalseothergeneral-InfInfmissingmissingunknownhttps://bitbucket.org/optrove/sif/src/master/HS107.SIFHock and Schittkowski problem number 107.\n\nA static power scheduling problem.\nThere are note enough components for the starting point in the\nproblem description in the source. The initial value for X7 has\nbeen set to 1.0454, as for X5 and X6.\n\nclassification OOR2-MY-9-6\n\nclassification PGR-AN-9-6\n\nA. Montoison, Montreal, 05/2018.\nproblem 107 in\nW. Hock and K. Schittkowski,\n"Test examples for nonlinear programming codes",\nLectures Notes in Economics and Mathematical Systems 187, Springer\nVerlag, Heidelberg, 1981.\n\nSIF input: Ph. Toint, April 1991.\n@book{HockSchittkowski1981,\n author = {Hock, W. and Schittkowski, K.},\n title = {Test Examples for Nonlinear Programming Codes},\n series = {Lecture Notes in Economics and Mathematical Systems},\n volume = {187},\n publisher = {Springer-Verlag},\n address = {Heidelberg},\n year = {1981}\n} \n CUTEst:HS107, HS:107
1439false12falsetruehs108falsetruetruefalseothergeneral-InfInfmissingmissingunknownhttps://bitbucket.org/optrove/sif/src/master/HS108.SIFHock and Schittkowski problem number 108.\n\nclassification QQR2-AY-9-13\n\nclassification QQR-AN-9-13\n\nA. Montoison, Montreal, 05/2018.\nproblem 108 in\nW. Hock and K. Schittkowski,\n"Test examples for nonlinear programming codes",\nLectures Notes in Economics and Mathematical Systems 187, Springer\nVerlag, Heidelberg, 1981.\n\nSIF input: J-M Collin and Ph. Toint, Apr 1990.\n@book{HockSchittkowski1981,\n author = {Hock, W. and Schittkowski, K.},\n title = {Test Examples for Nonlinear Programming Codes},\n series = {Lecture Notes in Economics and Mathematical Systems},\n volume = {187},\n publisher = {Springer-Verlag},\n address = {Heidelberg},\n year = {1981}\n} \n CUTEst:HS108, HS:108
1449false9falsetruehs109falsefalsetruefalseothergeneral-InfInfmissingmissingunknownhttps://bitbucket.org/optrove/sif/src/master/HS109.SIFHock and Schittkowski problem number 109.\n\nclassification OOR2-AY-9-10\n\nclassification PGR-AN-9-10\n\nA. Montoison, Montreal, 05/2018.\nProblem 109 in\n W. Hock and K. Schittkowski,\n Test examples for nonlinear programming codes,\n Lectures Notes in Economics and Mathematical Systems 187,\n Springer Verlag, Heidelberg, 1981.\n\nproblem 80 in\nW. Hock and K. Schittkowski,\n"Test examples for nonlinear programming codes",\nLectures Notes in Economics and Mathematical Systems 187, Springer\nVerlag, Heidelberg, 1981.\n\nSIF input: A.R. Conn, June 1990.\n@book{HockSchittkowski1981,\n author = {Hock, W. and Schittkowski, K.},\n title = {Test Examples for Nonlinear Programming Codes},\n series = {Lecture Notes in Economics and Mathematical Systems},\n volume = {187},\n publisher = {Springer-Verlag},\n address = {Heidelberg},\n year = {1981}\n} \n CUTEst:HS109, HS:109
1452false1falsetruehs11falsetruefalsefalseothergeneral-InfInfmissingmissingunknownhttps://bitbucket.org/optrove/sif/src/master/HS11.SIFHock and Schittkowski problem number 11.\n\nclassification SQR2-AN-2-1\n\nN. Antunes, Curitiba, 10/2016.\nproblem 11 in\nW. Hock and K. Schittkowski,\n"Test examples for nonlinear programming codes",\nLectures Notes in Economics and Mathematical Systems 187, Springer\nVerlag, Heidelberg, 1981.\n\nSIF input: Ph. L. Toint, October 1990.\n@book{HockSchittkowski1981,\n author = {Hock, W. and Schittkowski, K.},\n title = {Test Examples for Nonlinear Programming Codes},\n series = {Lecture Notes in Economics and Mathematical Systems},\n volume = {187},\n publisher = {Springer-Verlag},\n address = {Heidelberg},\n year = {1981}\n} \n CUTEst:HS11, HS:11
14610false0falsetruehs110falsefalsetruefalseotherunconstrained-Inf-43.1343truemissingunknownhttps://bitbucket.org/optrove/sif/src/master/HS110.SIFHock and Schittkowski problem number 110.\n\nThis problem is a sum of 2n+1 groups, 2n of which contain 1 linear\nelement and the other one contains n elements.\n\nclassification SBR2-AN-V-0\n\nclassification GBR-AN-10-0\n\nA. Montoison, Montreal, 05/2018.\nproblem 110 in\nW. Hock and K. Schittkowski,\n"Test examples for nonlinear programming codes",\nLectures Notes in Economics and Mathematical Systems 187, Springer\nVerlag, Heidelberg, 1981.\n\nSIF input: A.R. Conn, Mar 1990.\n@book{HockSchittkowski1981,\n author = {Hock, W. and Schittkowski, K.},\n title = {Test Examples for Nonlinear Programming Codes},\n series = {Lecture Notes in Economics and Mathematical Systems},\n volume = {187},\n publisher = {Springer-Verlag},\n address = {Heidelberg},\n year = {1981}\n} \n CUTEst:HS110, HS:110
14710false3falsetruehs111truefalsetruefalseothergeneral-InfInfmissingmissingunknownhttps://bitbucket.org/optrove/sif/src/master/HS111.SIFHock and Schittkowski problem number 111.\n\nThis problem is a chemical equilibrium problem involving 3 linear\nequality constraints.\n\nclassification OOR2-AN-10-3\n\nN. Antunes, Curitiba, 10/2016.\nproblem 111 in\nW. Hock and K. Schittkowski,\n"Test examples for nonlinear programming codes",\nLectures Notes in Economics and Mathematical Systems 187, Springer\nVerlag, Heidelberg, 1981.\n\nSIF input: Nick Gould, August 1991.\n@book{HockSchittkowski1981,\n author = {Hock, W. and Schittkowski, K.},\n title = {Test Examples for Nonlinear Programming Codes},\n series = {Lecture Notes in Economics and Mathematical Systems},\n volume = {187},\n publisher = {Springer-Verlag},\n address = {Heidelberg},\n year = {1981}\n} \n CUTEst:HS111, HS:111
14810false3falsetruehs112truefalsetruefalseotherlinear-InfInfmissingmissingunknownhttps://bitbucket.org/optrove/sif/src/master/HS112.SIFHock and Schittkowski problem number 112.\n\nThis problem is a chemical equilibrium problem involving 3 linear\nequality constraints.\n\nclassification OLR2-MY-10-3\n\nN. Antunes, Curitiba, 10/2016.\nProblem 112 in\n W. Hock and K. Schittkowski,\n Test examples for nonlinear programming codes,\n Lectures Notes in Economics and Mathematical Systems 187,\n Springer Verlag, Heidelberg, 1981.\n\nproblem 80 in\nW. Hock and K. Schittkowski,\n"Test examples for nonlinear programming codes",\nLectures Notes in Economics and Mathematical Systems 187, Springer\nVerlag, Heidelberg, 1981.\n\nSIF input: A.R. Conn, Mar 1990.\n@book{HockSchittkowski1981,\n author = {Hock, W. and Schittkowski, K.},\n title = {Test Examples for Nonlinear Programming Codes},\n series = {Lecture Notes in Economics and Mathematical Systems},\n volume = {187},\n publisher = {Springer-Verlag},\n address = {Heidelberg},\n year = {1981}\n} \n CUTEst:HS112, HS:112
14910false8falsetruehs113falsetruefalsefalseothergeneral-Inf753.0truemissingunknownhttps://bitbucket.org/optrove/sif/src/master/HS113.SIFHock and Schittkowski problem number 113.\n\nclassification QQR2-AN-10-8\n\nclassification QQR-AN-10-8\n\nA. Montoison, Montreal, 05/2018.\nProblem 113 in\n W. Hock and K. Schittkowski,\n Test examples for nonlinear programming codes,\n Lectures Notes in Economics and Mathematical Systems 187,\n Springer Verlag, Heidelberg, 1981.\n\nproblem 80 in\nW. Hock and K. Schittkowski,\n"Test examples for nonlinear programming codes",\nLectures Notes in Economics and Mathematical Systems 187, Springer\nVerlag, Heidelberg, 1981.\n\nSIF input: J-M Collin, Mar 1990.\n@book{HockSchittkowski1981,\n author = {Hock, W. and Schittkowski, K.},\n title = {Test Examples for Nonlinear Programming Codes},\n series = {Lecture Notes in Economics and Mathematical Systems},\n volume = {187},\n publisher = {Springer-Verlag},\n address = {Heidelberg},\n year = {1981}\n} \n CUTEst:HS113, HS:113
15010false11falsetruehs114falsefalsetruefalseothergeneral-InfInfmissingmissingunknownhttps://bitbucket.org/optrove/sif/src/master/HS114.SIFHock and Schittkowski problem number 114.\n\nAn alkylation process problem.\n\nclassification QOR2-MY-10-11\n\nclassification QGR-AN-10-11\n\nA. Montoison, Montreal, 05/2018.\nproblem 114 in\nW. Hock and K. Schittkowski,\n"Test examples for nonlinear programming codes",\nLectures Notes in Economics and Mathematical Systems 187, Springer\nVerlag, Heidelberg, 1981.\n\nSIF input: J.M. Collin, Jan 1990.\n@book{HockSchittkowski1981,\n author = {Hock, W. and Schittkowski, K.},\n title = {Test Examples for Nonlinear Programming Codes},\n series = {Lecture Notes in Economics and Mathematical Systems},\n volume = {187},\n publisher = {Springer-Verlag},\n address = {Heidelberg},\n year = {1981}\n} \n CUTEst:HS114, HS:114
15113false15falsetruehs116falsetruetruefalseothergeneral-InfInfmissingmissingunknownhttps://bitbucket.org/optrove/sif/src/master/HS116.SIFHock and Schittkowski problem number 116.\n\nA 3 stage membrane separation model\n\nclassification LQR2-MN-13-14\n\nclassification QGR-AN-13-14\n\nA. Montoison, Montreal, 05/2018.\nproblem 116 in\nW. Hock and K. Schittkowski,\n"Test examples for nonlinear programming codes",\nLectures Notes in Economics and Mathematical Systems 187, Springer\nVerlag, Heidelberg, 1981.\n\nSIF input: B. Debarsy, Feb 1990.\n@book{HockSchittkowski1981,\n author = {Hock, W. and Schittkowski, K.},\n title = {Test Examples for Nonlinear Programming Codes},\n series = {Lecture Notes in Economics and Mathematical Systems},\n volume = {187},\n publisher = {Springer-Verlag},\n address = {Heidelberg},\n year = {1981}\n} \n CUTEst:HS116, HS:116
15215false5falsetruehs117falsetruetruefalseothergeneral-Inf2400.11truemissingunknownhttps://bitbucket.org/optrove/sif/src/master/HS117.SIFHock and Schittkowski problem number 117.\n\nclassification OQR2-AN-15-5\n\nclassification PQR-AN-15-5\n\nA. Montoison, Montreal, 05/2018.\nproblem 117 in\nW. Hock and K. Schittkowski,\n"Test examples for nonlinear programming codes",\nLectures Notes in Economics and Mathematical Systems 187, Springer\nVerlag, Heidelberg, 1981.\n\nSIF input: Nick Gould, August 1991.\n@book{HockSchittkowski1981,\n author = {Hock, W. and Schittkowski, K.},\n title = {Test Examples for Nonlinear Programming Codes},\n series = {Lecture Notes in Economics and Mathematical Systems},\n volume = {187},\n publisher = {Springer-Verlag},\n address = {Heidelberg},\n year = {1981}\n} \n CUTEst:HS117, HS:117
15315false17falsetruehs118falsetruetruefalseotherlinear-Inf942.716truemissingunknownhttps://bitbucket.org/optrove/sif/src/master/HS118.SIFHock and Schittkowski problem number 118.\n\nclassification QLR2-AN-15-17\n\nclassification QLR-AN-15-17\n\nA. Montoison, Montreal, 05/2018.\nproblem 118 in\nW. Hock and K. Schittkowski,\n"Test examples for nonlinear programming codes",\nLectures Notes in Economics and Mathematical Systems 187, Springer\nVerlag, Heidelberg, 1981.\n\nSIF input: B Baudson, Jan 1990.\n@book{HockSchittkowski1981,\n author = {Hock, W. and Schittkowski, K.},\n title = {Test Examples for Nonlinear Programming Codes},\n series = {Lecture Notes in Economics and Mathematical Systems},\n volume = {187},\n publisher = {Springer-Verlag},\n address = {Heidelberg},\n year = {1981}\n} \n CUTEst:HS118, HS:118
15416false8falsetruehs119truefalsetruefalseotherlinear-InfInfmissingmissingunknownhttps://bitbucket.org/optrove/sif/src/master/HS119.SIFHock and Schittkowski problem number 119.\n\nclassification OLR2-AN-16-8\n\nclassification PLR-AN-16-8\n\nA. Montoison, Montreal, 05/2018.\nproblem 119 in\nW. Hock and K. Schittkowski,\n"Test examples for nonlinear programming codes",\nLectures Notes in Economics and Mathematical Systems 187, Springer\nVerlag, Heidelberg, 1981.\nOriginal Source: problem 7 in\nA.R. Colville\n"A comparative study on nonlinear programming"\nIBM Scientific Center Report 320-2949, New York, 1968.\n\nSIF input: A.R. Conn, March 1991.\n@book{HockSchittkowski1981,\n author = {Hock, W. and Schittkowski, K.},\n title = {Test Examples for Nonlinear Programming Codes},\n series = {Lecture Notes in Economics and Mathematical Systems},\n volume = {187},\n publisher = {Springer-Verlag},\n address = {Heidelberg},\n year = {1981}\n} \n CUTEst:HS119, HS:119
1552false1falsetruehs12falsetruefalsefalseothergeneral-Inf0.0truemissingunknownhttps://bitbucket.org/optrove/sif/src/master/HS12.SIFHock and Schittkowski problem number 12.\n\nclassification QQR2-AN-2-1\n\nN. Antunes, Curitiba, 10/2016.\nproblem 12 in\nW. Hock and K. Schittkowski,\n"Test examples for nonlinear programming codes",\nLectures Notes in Economics and Mathematical Systems 187, Springer\nVerlag, Heidelberg, 1981.\n\nSIF input: A.R. Conn March 1990\n@book{HockSchittkowski1981,\n author = {Hock, W. and Schittkowski, K.},\n title = {Test Examples for Nonlinear Programming Codes},\n series = {Lecture Notes in Economics and Mathematical Systems},\n volume = {187},\n publisher = {Springer-Verlag},\n address = {Heidelberg},\n year = {1981}\n} \n CUTEst:HS12, HS:12
1562false1falsetruehs13falsetruetruefalseleast_squaresgeneral-InfInfmissingmissingunknownhttps://bitbucket.org/optrove/sif/src/master/HS13.SIFHock and Schittkowski problem number 13.\n\nA problem in 2 variables where constraint qualification does not\nhold.\n\nclassification QOR2-AN-2-1\n\nclassification QQR2-AN-2-1\n\n N. Antunes, Curitiba, 10/2016.\nproblem 13 in\nW. Hock and K. Schittkowski,\n"Test examples for nonlinear programming codes",\nLectures Notes in Economics and Mathematical Systems 187, Springer\nVerlag, Heidelberg, 1981.\n\nSIF input: A.R. Conn March 1990\n@book{HockSchittkowski1981,\n author = {Hock, W. and Schittkowski, K.},\n title = {Test Examples for Nonlinear Programming Codes},\n series = {Lecture Notes in Economics and Mathematical Systems},\n volume = {187},\n publisher = {Springer-Verlag},\n address = {Heidelberg},\n year = {1981}\n} \n CUTEst:HS13, HS:13
1572false2falsetruehs14falsefalsefalsefalseleast_squaresgeneral-InfInfmissingmissingunknownhttps://bitbucket.org/optrove/sif/src/master/HS14.SIFHock and Schittkowski problem number 14.\n\nclassification SQR2-AN-2-2\n\n N. Antunes, Curitiba, 10/2016.\nproblem 14 in\nW. Hock and K. Schittkowski,\n"Test examples for nonlinear programming codes",\nLectures Notes in Economics and Mathematical Systems 187, Springer\nVerlag, Heidelberg, 1981.\n\nSIF input: A.R. Conn March 1990\n@book{HockSchittkowski1981,\n author = {Hock, W. and Schittkowski, K.},\n title = {Test Examples for Nonlinear Programming Codes},\n series = {Lecture Notes in Economics and Mathematical Systems},\n volume = {187},\n publisher = {Springer-Verlag},\n address = {Heidelberg},\n year = {1981}\n} \n CUTEst:HS14, HS:14
1582false2falsetruehs15falsetruetruefalseothergeneral-InfInfmissingmissingunknownhttps://bitbucket.org/optrove/sif/src/master/HS15.SIFHock and Schittkowski problem number 15.\n\nclassification SQR2-AN-2-2\n\n N. Antunes, Curitiba, 10/2016.\nproblem 15 in\nW. Hock and K. Schittkowski,\n"Test examples for nonlinear programming codes",\nLectures Notes in Economics and Mathematical Systems 187, Springer\nVerlag, Heidelberg, 1981.\n\nSIF input: A.R. Conn March 1990\n@book{HockSchittkowski1981,\n author = {Hock, W. and Schittkowski, K.},\n title = {Test Examples for Nonlinear Programming Codes},\n series = {Lecture Notes in Economics and Mathematical Systems},\n volume = {187},\n publisher = {Springer-Verlag},\n address = {Heidelberg},\n year = {1981}\n} \n CUTEst:HS15, HS:15
1592false2falsetruehs16falsetruetruefalseothergeneral-InfInfmissingmissingunknownhttps://bitbucket.org/optrove/sif/src/master/HS16.SIFHock and Schittkowski problem number 16.\n\nclassification SQR2-AN-2-2\n\n N. Antunes, Curitiba, 10/2016.\nproblem 16 in\nW. Hock and K. Schittkowski,\n"Test examples for nonlinear programming codes",\nLectures Notes in Economics and Mathematical Systems 187, Springer\nVerlag, Heidelberg, 1981.\n\nSIF input: A.R. Conn March 1990\n@book{HockSchittkowski1981,\n author = {Hock, W. and Schittkowski, K.},\n title = {Test Examples for Nonlinear Programming Codes},\n series = {Lecture Notes in Economics and Mathematical Systems},\n volume = {187},\n publisher = {Springer-Verlag},\n address = {Heidelberg},\n year = {1981}\n} \n CUTEst:HS16, HS:16
1602false2falsetruehs17falsetruetruefalseothergeneral-InfInfmissingmissingunknownhttps://bitbucket.org/optrove/sif/src/master/HS17.SIFHock and Schittkowski problem number 17.\n\nclassification SQR2-AN-2-2\n\n N. Antunes, Curitiba, 10/2016.\nproblem 17 in\nW. Hock and K. Schittkowski,\n"Test examples for nonlinear programming codes",\nLectures Notes in Economics and Mathematical Systems 187, Springer\nVerlag, Heidelberg, 1981.\n\nSIF input: A.R. Conn March 1990\n@book{HockSchittkowski1981,\n author = {Hock, W. and Schittkowski, K.},\n title = {Test Examples for Nonlinear Programming Codes},\n series = {Lecture Notes in Economics and Mathematical Systems},\n volume = {187},\n publisher = {Springer-Verlag},\n address = {Heidelberg},\n year = {1981}\n} \n CUTEst:HS17, HS:17
1612false2falsetruehs18falsetruetruefalseothergeneral-InfInfmissingmissingunknownhttps://bitbucket.org/optrove/sif/src/master/HS18.SIFHock and Schittkowski problem number 18.\n\nclassification SQR2-AN-2-2\n\n N. Antunes, Curitiba, 10/2016.\nproblem 18 in\nW. Hock and K. Schittkowski,\n"Test examples for nonlinear programming codes",\nLectures Notes in Economics and Mathematical Systems 187, Springer\nVerlag, Heidelberg, 1981.\n\nSIF input: A.R. Conn March 1990\n@book{HockSchittkowski1981,\n author = {Hock, W. and Schittkowski, K.},\n title = {Test Examples for Nonlinear Programming Codes},\n series = {Lecture Notes in Economics and Mathematical Systems},\n volume = {187},\n publisher = {Springer-Verlag},\n address = {Heidelberg},\n year = {1981}\n} \n CUTEst:HS18, HS:18
1622false2falsetruehs19falsetruetruefalseothergeneral-InfInfmissingmissingunknownhttps://bitbucket.org/optrove/sif/src/master/HS19.SIFHock and Schittkowski problem number 19.\n\nclassification OQR2-AN-2-2\n\nclassification PQR2-AN-2-2\n\n A. Montoison, Montreal, 04/2018.\nproblem 19 in\nW. Hock and K. Schittkowski,\n"Test examples for nonlinear programming codes",\nLectures Notes in Economics and Mathematical Systems 187, Springer\nVerlag, Heidelberg, 1981.\n\nSIF input: A.R. Conn April 1990\n@book{HockSchittkowski1981,\n author = {Hock, W. and Schittkowski, K.},\n title = {Test Examples for Nonlinear Programming Codes},\n series = {Lecture Notes in Economics and Mathematical Systems},\n volume = {187},\n publisher = {Springer-Verlag},\n address = {Heidelberg},\n year = {1981}\n} \n CUTEst:HS19, HS:19
1632false0falsetruehs2falsefalsetruefalseotherunconstrained-Inf909.0truemissingunknownhttps://bitbucket.org/optrove/sif/src/master/HS2.SIFHock and Schittkowski problem number 2.\n\nThe ever famous 2 variables Rosenbrock "banana valley" problem\nwith a single lower bound.\n\nclassification SBR2-AN-2-0\n\nclassification PBR2-AN-2-0\n\nA. Montoison, Montreal, 04/2018.\nproblem 2 in\nW. Hock and K. Schittkowski,\n"Test examples for nonlinear programming codes",\nLectures Notes in Economics and Mathematical Systems 187, Springer\nVerlag, Heidelberg, 1981.\n\nSIF input: A.R. Conn, March 1990.\n@book{HockSchittkowski1981,\n author = {Hock, W. and Schittkowski, K.},\n title = {Test Examples for Nonlinear Programming Codes},\n series = {Lecture Notes in Economics and Mathematical Systems},\n volume = {187},\n publisher = {Springer-Verlag},\n address = {Heidelberg},\n year = {1981}\n} \n CUTEst:HS2, HS:2
1642false3falsetruehs20falsetruetruefalseothergeneral-InfInfmissingmissingunknownhttps://bitbucket.org/optrove/sif/src/master/HS20.SIFHock and Schittkowski problem number 20.\n\nclassification SQR2-AN-2-3\n\n N. Antunes, Curitiba, 10/2016.\nproblem 20 in\nW. Hock and K. Schittkowski,\n"Test examples for nonlinear programming codes",\nLectures Notes in Economics and Mathematical Systems 187, Springer\nVerlag, Heidelberg, 1981.\n\nSIF input: A.R. Conn, April 1990\n@book{HockSchittkowski1981,\n author = {Hock, W. and Schittkowski, K.},\n title = {Test Examples for Nonlinear Programming Codes},\n series = {Lecture Notes in Economics and Mathematical Systems},\n volume = {187},\n publisher = {Springer-Verlag},\n address = {Heidelberg},\n year = {1981}\n} \n CUTEst:HS20, HS:20
1652false0falsetruehs201falsefalsefalsefalseotherunconstrained-Inf45.0truemissingunknownhttps://doi.org/10.1007/978-3-642-61582-5Hock and Schittkowski problem number 201.\nProblem 201 in\n K. Schittkowski,\n More Test Examples for Nonlinear Programming Codes,\n Lectures Notes in Economics and Mathematical Systems 282,\n Springer Verlag, Heidelberg, 1987.\n@book{Schittkowski1987,\n author = {Schittkowski, Klaus},\n title = {More Test Examples for Nonlinear Programming Codes},\n series = {Lecture Notes in Economics and Mathematical Systems},\n volume = {282},\n publisher = {Springer-Verlag},\n address = {Heidelberg},\n year = {1987}\n}\n HS2:201
1662false1falsetruehs21falsetruetruefalseotherlinear-InfInfmissingmissingunknownhttps://bitbucket.org/optrove/sif/src/master/HS21.SIFHock and Schittkowski problem number 21.\n\nclassification QLR2-AN-2-1\n\n A. Montoison, Montreal, 04/2018.\nproblem 21 in\nW. Hock and K. Schittkowski,\n"Test examples for nonlinear programming codes",\nLectures Notes in Economics and Mathematical Systems 187, Springer\nVerlag, Heidelberg, 1981.\n\nSIF input: A.R. Conn, April 1990\n@book{HockSchittkowski1981,\n author = {Hock, W. and Schittkowski, K.},\n title = {Test Examples for Nonlinear Programming Codes},\n series = {Lecture Notes in Economics and Mathematical Systems},\n volume = {187},\n publisher = {Springer-Verlag},\n address = {Heidelberg},\n year = {1981}\n} \n CUTEst:HS21, HS:21
1672false0falsetruehs211falsefalsefalsefalseotherunconstrained-Inf750.0truemissingunknownhttps://doi.org/10.1007/978-3-642-61582-5Hock and Schittkowski problem number 211.\nProblem 211 in\n K. Schittkowski,\n More Test Examples for Nonlinear Programming Codes,\n Lectures Notes in Economics and Mathematical Systems 282,\n Springer Verlag, Heidelberg, 1987.\n@book{Schittkowski1987,\n author = {Schittkowski, Klaus},\n title = {More Test Examples for Nonlinear Programming Codes},\n series = {Lecture Notes in Economics and Mathematical Systems},\n volume = {282},\n publisher = {Springer-Verlag},\n address = {Heidelberg},\n year = {1987}\n}\n HS2:211
1684false2falsetruehs219truefalsefalsefalselineargeneral-1.0-1.0truetrueunknownhttps://doi.org/10.1007/978-3-642-61582-5Schittkowski problem number 219.\n\nSolution is: (1, 1, 0, 0) with f(x^*) = -1\nProblem 219 in\n Schittkowski, K. (1987). \n More Test Examples for Nonlinear Programming Codes. \n Lecture Notes in Economics and Mathematical Systems.\n doi:10.1007/978-3-642-61582-5\n\nclassification LPR-T1-1\n@book{Schittkowski1987,\n author = {Schittkowski, Klaus},\n title = {More Test Examples for Nonlinear Programming Codes},\n series = {Lecture Notes in Economics and Mathematical Systems},\n volume = {282},\n publisher = {Springer-Verlag},\n address = {Heidelberg},\n year = {1987}\n}\n HS2:219
1692false2falsetruehs22falsetruefalsefalseleast_squaresgeneral-InfInfmissingmissingunknownhttps://bitbucket.org/optrove/sif/src/master/HS22.SIFHock and Schittkowski problem number 22.\n\nclassification QQR2-AN-2-2\n\n A. Montoison, Montreal, 04/2018.\nproblem 22 in\nW. Hock and K. Schittkowski,\n"Test examples for nonlinear programming codes",\nLectures Notes in Economics and Mathematical Systems 187, Springer\nVerlag, Heidelberg, 1981.\n\nSIF input: A.R. Conn, April 1990\n@book{HockSchittkowski1981,\n author = {Hock, W. and Schittkowski, K.},\n title = {Test Examples for Nonlinear Programming Codes},\n series = {Lecture Notes in Economics and Mathematical Systems},\n volume = {187},\n publisher = {Springer-Verlag},\n address = {Heidelberg},\n year = {1981}\n} \n CUTEst:HS22, HS:22
1702false1falsetruehs220truefalsetruefalseothergeneral125000truemissingunknownhttps://doi.org/10.1007/978-3-642-61582-5Hock and Schittkowski problem number 220.\nProblem 220 in\n K. Schittkowski,\n More Test Examples for Nonlinear Programming Codes,\n Lectures Notes in Economics and Mathematical Systems 282,\n Springer Verlag, Heidelberg, 1987.\n@book{Schittkowski1987,\n author = {Schittkowski, Klaus},\n title = {More Test Examples for Nonlinear Programming Codes},\n series = {Lecture Notes in Economics and Mathematical Systems},\n volume = {282},\n publisher = {Springer-Verlag},\n address = {Heidelberg},\n year = {1987}\n}\n HS2:220
1712false1falsetruehs221falsetruetruefalseothergeneral-1-0.25truemissingunknownhttps://doi.org/10.1007/978-3-642-61582-5Hock and Schittkowski problem number 221.\nProblem 221 in\n K. Schittkowski,\n More Test Examples for Nonlinear Programming Codes,\n Lectures Notes in Economics and Mathematical Systems 282,\n Springer Verlag, Heidelberg, 1987.\n@book{Schittkowski1987,\n author = {Schittkowski, Klaus},\n title = {More Test Examples for Nonlinear Programming Codes},\n series = {Lecture Notes in Economics and Mathematical Systems},\n volume = {282},\n publisher = {Springer-Verlag},\n address = {Heidelberg},\n year = {1987}\n}\n HS2:221
1722false1falsetruehs222falsetruetruefalseothergeneral-1.5-1.3truemissingunknownhttps://doi.org/10.1007/978-3-642-61582-5Hock and Schittkowski problem number 222.\nProblem 222 in\n K. Schittkowski,\n More Test Examples for Nonlinear Programming Codes,\n Lectures Notes in Economics and Mathematical Systems 282,\n Springer Verlag, Heidelberg, 1987.\n@book{Schittkowski1987,\n author = {Schittkowski, Klaus},\n title = {More Test Examples for Nonlinear Programming Codes},\n series = {Lecture Notes in Economics and Mathematical Systems},\n volume = {282},\n publisher = {Springer-Verlag},\n address = {Heidelberg},\n year = {1987}\n}\n HS2:222
1732false2falsetruehs223falsetruetruefalseothergeneral-0.834032-0.1truemissingunknownhttps://doi.org/10.1007/978-3-642-61582-5Hock and Schittkowski problem number 223.\nProblem 223 in\n K. Schittkowski,\n More Test Examples for Nonlinear Programming Codes,\n Lectures Notes in Economics and Mathematical Systems 282,\n Springer Verlag, Heidelberg, 1987.\n@book{Schittkowski1987,\n author = {Schittkowski, Klaus},\n title = {More Test Examples for Nonlinear Programming Codes},\n series = {Lecture Notes in Economics and Mathematical Systems},\n volume = {282},\n publisher = {Springer-Verlag},\n address = {Heidelberg},\n year = {1987}\n}\n HS2:223
1742false4falsetruehs224falsetruetruefalseotherlinear-304-304truemissingunknownhttps://doi.org/10.1007/978-3-642-61582-5Hock and Schittkowski problem number 224.\nProblem 224 in\n K. Schittkowski,\n More Test Examples for Nonlinear Programming Codes,\n Lectures Notes in Economics and Mathematical Systems 282,\n Springer Verlag, Heidelberg, 1987.\n@book{Schittkowski1987,\n author = {Schittkowski, Klaus},\n title = {More Test Examples for Nonlinear Programming Codes},\n series = {Lecture Notes in Economics and Mathematical Systems},\n volume = {282},\n publisher = {Springer-Verlag},\n address = {Heidelberg},\n year = {1987}\n}\n HS2:224
1752false5falsetruehs225falsetruefalsefalseothergeneral22truemissingunknownhttps://doi.org/10.1007/978-3-642-61582-5Hock and Schittkowski problem number 225.\nProblem 225 in\n K. Schittkowski,\n More Test Examples for Nonlinear Programming Codes,\n Lectures Notes in Economics and Mathematical Systems 282,\n Springer Verlag, Heidelberg, 1987.\n@book{Schittkowski1987,\n author = {Schittkowski, Klaus},\n title = {More Test Examples for Nonlinear Programming Codes},\n series = {Lecture Notes in Economics and Mathematical Systems},\n volume = {282},\n publisher = {Springer-Verlag},\n address = {Heidelberg},\n year = {1987}\n}\n HS2:225
1762false2falsetruehs226falsetruetruefalseothergeneral-0.5-0.5truemissingunknownhttps://doi.org/10.1007/978-3-642-61582-5Hock and Schittkowski problem number 226.\nProblem 226 in\n K. Schittkowski,\n More Test Examples for Nonlinear Programming Codes,\n Lectures Notes in Economics and Mathematical Systems 282,\n Springer Verlag, Heidelberg, 1987.\n@book{Schittkowski1987,\n author = {Schittkowski, Klaus},\n title = {More Test Examples for Nonlinear Programming Codes},\n series = {Lecture Notes in Economics and Mathematical Systems},\n volume = {282},\n publisher = {Springer-Verlag},\n address = {Heidelberg},\n year = {1987}\n}\n HS2:226
1772false2falsetruehs227falsetruefalsefalseothergeneral11truemissingunknownhttps://doi.org/10.1007/978-3-642-61582-5Hock and Schittkowski problem number 227.\nProblem 227 in\n K. Schittkowski,\n More Test Examples for Nonlinear Programming Codes,\n Lectures Notes in Economics and Mathematical Systems 282,\n Springer Verlag, Heidelberg, 1987.\n@book{Schittkowski1987,\n author = {Schittkowski, Klaus},\n title = {More Test Examples for Nonlinear Programming Codes},\n series = {Lecture Notes in Economics and Mathematical Systems},\n volume = {282},\n publisher = {Springer-Verlag},\n address = {Heidelberg},\n year = {1987}\n}\n HS2:227
1782false2falsetruehs228falsetruefalsefalseothergeneral-3-3truemissingunknownhttps://doi.org/10.1007/978-3-642-61582-5Hock and Schittkowski problem number 228.\nProblem 228 in\n K. Schittkowski,\n More Test Examples for Nonlinear Programming Codes,\n Lectures Notes in Economics and Mathematical Systems 282,\n Springer Verlag, Heidelberg, 1987.\n@book{Schittkowski1987,\n author = {Schittkowski, Klaus},\n title = {More Test Examples for Nonlinear Programming Codes},\n series = {Lecture Notes in Economics and Mathematical Systems},\n volume = {282},\n publisher = {Springer-Verlag},\n address = {Heidelberg},\n year = {1987}\n}\n HS2:228
1792false0falsetruehs229falsefalsetruefalseotherunconstrained00truemissingunknownhttps://doi.org/10.1007/978-3-642-61582-5Hock and Schittkowski problem number 229.\nProblem 229 in\n K. Schittkowski,\n More Test Examples for Nonlinear Programming Codes,\n Lectures Notes in Economics and Mathematical Systems 282,\n Springer Verlag, Heidelberg, 1987.\n@book{Schittkowski1987,\n author = {Schittkowski, Klaus},\n title = {More Test Examples for Nonlinear Programming Codes},\n series = {Lecture Notes in Economics and Mathematical Systems},\n volume = {282},\n publisher = {Springer-Verlag},\n address = {Heidelberg},\n year = {1987}\n}\n HS2:229
1802false5falsetruehs23falsetruetruefalseleast_squaresgeneral-InfInfmissingmissingunknownhttps://bitbucket.org/optrove/sif/src/master/HS23.SIFHock and Schittkowski problem number 23.\n\nclassification QQR2-AN-2-5\n\nA. Montoison, Montreal, 04/2018.\nproblem 23 in\nW. Hock and K. Schittkowski,\n"Test examples for nonlinear programming codes",\nLectures Notes in Economics and Mathematical Systems 187, Springer\nVerlag, Heidelberg, 1981.\n\nSIF input: A.R. Conn, April 1990\n@book{HockSchittkowski1981,\n author = {Hock, W. and Schittkowski, K.},\n title = {Test Examples for Nonlinear Programming Codes},\n series = {Lecture Notes in Economics and Mathematical Systems},\n volume = {187},\n publisher = {Springer-Verlag},\n address = {Heidelberg},\n year = {1981}\n} \n CUTEst:HS23, HS:23
1812false2falsetruehs230falsetruefalsefalseothergeneral0.3750.375truemissingunknownhttps://doi.org/10.1007/978-3-642-61582-5Hock and Schittkowski problem number 230.\nProblem 230 in\n K. Schittkowski,\n More Test Examples for Nonlinear Programming Codes,\n Lectures Notes in Economics and Mathematical Systems 282,\n Springer Verlag, Heidelberg, 1987.\n@book{Schittkowski1987,\n author = {Schittkowski, Klaus},\n title = {More Test Examples for Nonlinear Programming Codes},\n series = {Lecture Notes in Economics and Mathematical Systems},\n volume = {282},\n publisher = {Springer-Verlag},\n address = {Heidelberg},\n year = {1987}\n}\n HS2:230
1822false2falsetruehs231falsetruefalsefalseotherlinear00truemissingunknownhttps://doi.org/10.1007/978-3-642-61582-5Hock and Schittkowski problem number 231.\nProblem 231 in\n K. Schittkowski,\n More Test Examples for Nonlinear Programming Codes,\n Lectures Notes in Economics and Mathematical Systems 282,\n Springer Verlag, Heidelberg, 1987.\n@book{Schittkowski1987,\n author = {Schittkowski, Klaus},\n title = {More Test Examples for Nonlinear Programming Codes},\n series = {Lecture Notes in Economics and Mathematical Systems},\n volume = {282},\n publisher = {Springer-Verlag},\n address = {Heidelberg},\n year = {1987}\n}\n HS2:231
1832false3falsetruehs232falsetruetruefalseotherlinear-1-1truemissingunknownhttps://doi.org/10.1007/978-3-642-61582-5Hock and Schittkowski problem number 232.\nProblem 232 in\n K. Schittkowski,\n More Test Examples for Nonlinear Programming Codes,\n Lectures Notes in Economics and Mathematical Systems 282,\n Springer Verlag, Heidelberg, 1987.\n@book{Schittkowski1987,\n author = {Schittkowski, Klaus},\n title = {More Test Examples for Nonlinear Programming Codes},\n series = {Lecture Notes in Economics and Mathematical Systems},\n volume = {282},\n publisher = {Springer-Verlag},\n address = {Heidelberg},\n year = {1987}\n}\n HS2:232
1842false1falsetruehs233falsetruefalsefalseothergeneral00truemissingunknownhttps://doi.org/10.1007/978-3-642-61582-5Hock and Schittkowski problem number 233.\nProblem 233 in\n K. Schittkowski,\n More Test Examples for Nonlinear Programming Codes,\n Lectures Notes in Economics and Mathematical Systems 282,\n Springer Verlag, Heidelberg, 1987.\n@book{Schittkowski1987,\n author = {Schittkowski, Klaus},\n title = {More Test Examples for Nonlinear Programming Codes},\n series = {Lecture Notes in Economics and Mathematical Systems},\n volume = {282},\n publisher = {Springer-Verlag},\n address = {Heidelberg},\n year = {1987}\n}\n HS2:233
1852false1falsetruehs234falsetruetruefalseothergeneral-0.8-0.8truemissingunknownhttps://doi.org/10.1007/978-3-642-61582-5Hock and Schittkowski problem number 234.\nProblem 234 in\n K. Schittkowski,\n More Test Examples for Nonlinear Programming Codes,\n Lectures Notes in Economics and Mathematical Systems 282,\n Springer Verlag, Heidelberg, 1987.\n@book{Schittkowski1987,\n author = {Schittkowski, Klaus},\n title = {More Test Examples for Nonlinear Programming Codes},\n series = {Lecture Notes in Economics and Mathematical Systems},\n volume = {282},\n publisher = {Springer-Verlag},\n address = {Heidelberg},\n year = {1987}\n}\n HS2:234
1863false1falsetruehs235truefalsefalsefalseothergeneral0.040.04truemissingunknownhttps://doi.org/10.1007/978-3-642-61582-5Hock and Schittkowski problem number 235.\nProblem 235 in\n K. Schittkowski,\n More Test Examples for Nonlinear Programming Codes,\n Lectures Notes in Economics and Mathematical Systems 282,\n Springer Verlag, Heidelberg, 1987.\n@book{Schittkowski1987,\n author = {Schittkowski, Klaus},\n title = {More Test Examples for Nonlinear Programming Codes},\n series = {Lecture Notes in Economics and Mathematical Systems},\n volume = {282},\n publisher = {Springer-Verlag},\n address = {Heidelberg},\n year = {1987}\n}\n HS2:235
1872false2falsetruehs236falsetruetruefalseothergeneral-58.9034-58.9034truemissingunknownhttps://doi.org/10.1007/978-3-642-61582-5Hock and Schittkowski problem number 236.\nProblem 236 in\n K. Schittkowski,\n More Test Examples for Nonlinear Programming Codes,\n Lectures Notes in Economics and Mathematical Systems 282,\n Springer Verlag, Heidelberg, 1987.\n@book{Schittkowski1987,\n author = {Schittkowski, Klaus},\n title = {More Test Examples for Nonlinear Programming Codes},\n series = {Lecture Notes in Economics and Mathematical Systems},\n volume = {282},\n publisher = {Springer-Verlag},\n address = {Heidelberg},\n year = {1987}\n}\n HS2:236
1882false3falsetruehs237falsetruetruefalseothergeneral-58.9034-58.9034truemissingunknownhttps://doi.org/10.1007/978-3-642-61582-5Hock and Schittkowski problem number 237.\nProblem 237 in\n K. Schittkowski,\n More Test Examples for Nonlinear Programming Codes,\n Lectures Notes in Economics and Mathematical Systems 282,\n Springer Verlag, Heidelberg, 1987.\n@book{Schittkowski1987,\n author = {Schittkowski, Klaus},\n title = {More Test Examples for Nonlinear Programming Codes},\n series = {Lecture Notes in Economics and Mathematical Systems},\n volume = {282},\n publisher = {Springer-Verlag},\n address = {Heidelberg},\n year = {1987}\n}\n HS2:237
1892false3falsetruehs238falsetruetruefalseothergeneral-58.9034-58.9034truemissingunknownhttps://doi.org/10.1007/978-3-642-61582-5Hock and Schittkowski problem number 238.\nProblem 238 in\n K. Schittkowski,\n More Test Examples for Nonlinear Programming Codes,\n Lectures Notes in Economics and Mathematical Systems 282,\n Springer Verlag, Heidelberg, 1987.\n@book{Schittkowski1987,\n author = {Schittkowski, Klaus},\n title = {More Test Examples for Nonlinear Programming Codes},\n series = {Lecture Notes in Economics and Mathematical Systems},\n volume = {282},\n publisher = {Springer-Verlag},\n address = {Heidelberg},\n year = {1987}\n}\n HS2:238
1902false1falsetruehs239falsetruetruefalseothergeneral-58.9034-58.9034truemissingunknownhttps://doi.org/10.1007/978-3-642-61582-5Hock and Schittkowski problem number 239.\nProblem 239 in\n K. Schittkowski,\n More Test Examples for Nonlinear Programming Codes,\n Lectures Notes in Economics and Mathematical Systems 282,\n Springer Verlag, Heidelberg, 1987.\n@book{Schittkowski1987,\n author = {Schittkowski, Klaus},\n title = {More Test Examples for Nonlinear Programming Codes},\n series = {Lecture Notes in Economics and Mathematical Systems},\n volume = {282},\n publisher = {Springer-Verlag},\n address = {Heidelberg},\n year = {1987}\n}\n HS2:239
1912false2falsetruehs24falsetruetruefalseotherlinear-Inf-0.0133646truemissingunknownhttps://bitbucket.org/optrove/sif/src/master/HS24.SIFHock and Schittkowski problem number 24.\n\nclassification OLR2-AN-2-3\n\nclassification PLR2-AN-2-3\n\nA. Montoison, Montreal, 04/2018.\nproblem 24 in\nW. Hock and K. Schittkowski,\n"Test examples for nonlinear programming codes",\nLectures Notes in Economics and Mathematical Systems 187, Springer\nVerlag, Heidelberg, 1981.\n\nSIF input: A.R. Conn, April 1990\n@book{HockSchittkowski1981,\n author = {Hock, W. and Schittkowski, K.},\n title = {Test Examples for Nonlinear Programming Codes},\n series = {Lecture Notes in Economics and Mathematical Systems},\n volume = {187},\n publisher = {Springer-Verlag},\n address = {Heidelberg},\n year = {1981}\n} \n CUTEst:HS24, HS:24
1923false0falsetruehs240falsefalsefalsefalseotherunconstrained00truemissingunknownhttps://doi.org/10.1007/978-3-642-61582-5Hock and Schittkowski problem number 240.\nProblem 240 in\n K. Schittkowski,\n More Test Examples for Nonlinear Programming Codes,\n Lectures Notes in Economics and Mathematical Systems 282,\n Springer Verlag, Heidelberg, 1987.\n@book{Schittkowski1987,\n author = {Schittkowski, Klaus},\n title = {More Test Examples for Nonlinear Programming Codes},\n series = {Lecture Notes in Economics and Mathematical Systems},\n volume = {282},\n publisher = {Springer-Verlag},\n address = {Heidelberg},\n year = {1987}\n}\n HS2:240
1933false0falsetruehs241falsefalsefalsefalseotherunconstrained00truemissingunknownhttps://doi.org/10.1007/978-3-642-61582-5Hock and Schittkowski problem number 241.\nProblem 241 in\n K. Schittkowski,\n More Test Examples for Nonlinear Programming Codes,\n Lectures Notes in Economics and Mathematical Systems 282,\n Springer Verlag, Heidelberg, 1987.\n@book{Schittkowski1987,\n author = {Schittkowski, Klaus},\n title = {More Test Examples for Nonlinear Programming Codes},\n series = {Lecture Notes in Economics and Mathematical Systems},\n volume = {282},\n publisher = {Springer-Verlag},\n address = {Heidelberg},\n year = {1987}\n}\n HS2:241
1943false0falsetruehs242falsefalsetruefalseotherunconstrained00truemissingunknownhttps://doi.org/10.1007/978-3-642-61582-5Hock and Schittkowski problem number 242.\nProblem 242 in\n K. Schittkowski,\n More Test Examples for Nonlinear Programming Codes,\n Lectures Notes in Economics and Mathematical Systems 282,\n Springer Verlag, Heidelberg, 1987.\n@book{Schittkowski1987,\n author = {Schittkowski, Klaus},\n title = {More Test Examples for Nonlinear Programming Codes},\n series = {Lecture Notes in Economics and Mathematical Systems},\n volume = {282},\n publisher = {Springer-Verlag},\n address = {Heidelberg},\n year = {1987}\n}\n HS2:242
1953false0falsetruehs243falsefalsefalsefalseotherunconstrained0.79660.7966truemissingunknownhttps://doi.org/10.1007/978-3-642-61582-5Hock and Schittkowski problem number 243.\nProblem 243 in\n K. Schittkowski,\n More Test Examples for Nonlinear Programming Codes,\n Lectures Notes in Economics and Mathematical Systems 282,\n Springer Verlag, Heidelberg, 1987.\n@book{Schittkowski1987,\n author = {Schittkowski, Klaus},\n title = {More Test Examples for Nonlinear Programming Codes},\n series = {Lecture Notes in Economics and Mathematical Systems},\n volume = {282},\n publisher = {Springer-Verlag},\n address = {Heidelberg},\n year = {1987}\n}\n HS2:243
1963false0falsetruehs244falsefalsefalsefalseotherunconstrained00truemissingunknownhttps://doi.org/10.1007/978-3-642-61582-5Hock and Schittkowski problem number 244.\nProblem 244 in\n K. Schittkowski,\n More Test Examples for Nonlinear Programming Codes,\n Lectures Notes in Economics and Mathematical Systems 282,\n Springer Verlag, Heidelberg, 1987.\n@book{Schittkowski1987,\n author = {Schittkowski, Klaus},\n title = {More Test Examples for Nonlinear Programming Codes},\n series = {Lecture Notes in Economics and Mathematical Systems},\n volume = {282},\n publisher = {Springer-Verlag},\n address = {Heidelberg},\n year = {1987}\n}\n HS2:244
1973false0falsetruehs245falsefalsefalsefalseotherunconstrained00truemissingunknownhttps://doi.org/10.1007/978-3-642-61582-5Hock and Schittkowski problem number 245.\nProblem 245 in\n K. Schittkowski,\n More Test Examples for Nonlinear Programming Codes,\n Lectures Notes in Economics and Mathematical Systems 282,\n Springer Verlag, Heidelberg, 1987.\n@book{Schittkowski1987,\n author = {Schittkowski, Klaus},\n title = {More Test Examples for Nonlinear Programming Codes},\n series = {Lecture Notes in Economics and Mathematical Systems},\n volume = {282},\n publisher = {Springer-Verlag},\n address = {Heidelberg},\n year = {1987}\n}\n HS2:245
1983false0falsetruehs246falsefalsefalsefalseotherunconstrained00truemissingunknownhttps://doi.org/10.1007/978-3-642-61582-5Hock and Schittkowski problem number 246.\nProblem 246 in\n K. Schittkowski,\n More Test Examples for Nonlinear Programming Codes,\n Lectures Notes in Economics and Mathematical Systems 282,\n Springer Verlag, Heidelberg, 1987.\n@book{Schittkowski1987,\n author = {Schittkowski, Klaus},\n title = {More Test Examples for Nonlinear Programming Codes},\n series = {Lecture Notes in Economics and Mathematical Systems},\n volume = {282},\n publisher = {Springer-Verlag},\n address = {Heidelberg},\n year = {1987}\n}\n HS2:246
1993false2falsetruehs248falsefalsefalsefalseothergeneral-0.8-0.8truemissingunknownhttps://doi.org/10.1007/978-3-642-61582-5Hock and Schittkowski problem number 248.\nProblem 248 in\n K. Schittkowski,\n More Test Examples for Nonlinear Programming Codes,\n Lectures Notes in Economics and Mathematical Systems 282,\n Springer Verlag, Heidelberg, 1987.\n@book{Schittkowski1987,\n author = {Schittkowski, Klaus},\n title = {More Test Examples for Nonlinear Programming Codes},\n series = {Lecture Notes in Economics and Mathematical Systems},\n volume = {282},\n publisher = {Springer-Verlag},\n address = {Heidelberg},\n year = {1987}\n}\n HS2:248
2003false1falsetruehs249falsetruetruefalseothergeneral11truemissingunknownhttps://doi.org/10.1007/978-3-642-61582-5Hock and Schittkowski problem number 249.\nProblem 249 in\n K. Schittkowski,\n More Test Examples for Nonlinear Programming Codes,\n Lectures Notes in Economics and Mathematical Systems 282,\n Springer Verlag, Heidelberg, 1987.\n@book{Schittkowski1987,\n author = {Schittkowski, Klaus},\n title = {More Test Examples for Nonlinear Programming Codes},\n series = {Lecture Notes in Economics and Mathematical Systems},\n volume = {282},\n publisher = {Springer-Verlag},\n address = {Heidelberg},\n year = {1987}\n}\n HS2:249
2013false0falsetruehs25falsefalsetruefalseotherunconstrained-Inf32.835truemissingunknownhttps://bitbucket.org/optrove/sif/src/master/HS25.SIFHock and Schittkowski problem number 25.\n\nA nonlinear least squares problem with bounds.\n\nclassification SBR2-AN-3-0\n\nA. Montoison, Montreal, 04/2018.\nproblem 25 in\nW. Hock and K. Schittkowski,\n"Test examples for nonlinear programming codes",\nLectures Notes in Economics and Mathematical Systems 187, Springer\nVerlag, Heidelberg, 1981.\n\nSIF input: J-M Collin, Mar 1990.\n@book{HockSchittkowski1981,\n author = {Hock, W. and Schittkowski, K.},\n title = {Test Examples for Nonlinear Programming Codes},\n series = {Lecture Notes in Economics and Mathematical Systems},\n volume = {187},\n publisher = {Springer-Verlag},\n address = {Heidelberg},\n year = {1981}\n} \n CUTEst:HS25, HS:25
2023false2falsetruehs250falsetruetruefalseotherlinear-3300-3300truemissingunknownhttps://doi.org/10.1007/978-3-642-61582-5Hock and Schittkowski problem number 250.\nProblem 250 in\n K. Schittkowski,\n More Test Examples for Nonlinear Programming Codes,\n Lectures Notes in Economics and Mathematical Systems 282,\n Springer Verlag, Heidelberg, 1987.\n@book{Schittkowski1987,\n author = {Schittkowski, Klaus},\n title = {More Test Examples for Nonlinear Programming Codes},\n series = {Lecture Notes in Economics and Mathematical Systems},\n volume = {282},\n publisher = {Springer-Verlag},\n address = {Heidelberg},\n year = {1987}\n}\n HS2:250
2033false1falsetruehs251falsetruetruefalseotherlinear-3456-3456truemissingunknownhttps://doi.org/10.1007/978-3-642-61582-5Hock and Schittkowski problem number 251.\nProblem 251 in\n K. Schittkowski,\n More Test Examples for Nonlinear Programming Codes,\n Lectures Notes in Economics and Mathematical Systems 282,\n Springer Verlag, Heidelberg, 1987.\n@book{Schittkowski1987,\n author = {Schittkowski, Klaus},\n title = {More Test Examples for Nonlinear Programming Codes},\n series = {Lecture Notes in Economics and Mathematical Systems},\n volume = {282},\n publisher = {Springer-Verlag},\n address = {Heidelberg},\n year = {1987}\n}\n HS2:251
2043false1falsetruehs252truefalsefalsefalseothergeneral0.040.04truemissingunknownhttps://doi.org/10.1007/978-3-642-61582-5Hock and Schittkowski problem number 252.\nProblem 252 in\n K. Schittkowski,\n More Test Examples for Nonlinear Programming Codes,\n Lectures Notes in Economics and Mathematical Systems 282,\n Springer Verlag, Heidelberg, 1987.\n@book{Schittkowski1987,\n author = {Schittkowski, Klaus},\n title = {More Test Examples for Nonlinear Programming Codes},\n series = {Lecture Notes in Economics and Mathematical Systems},\n volume = {282},\n publisher = {Springer-Verlag},\n address = {Heidelberg},\n year = {1987}\n}\n HS2:252
2053false1falsetruehs253falsetruetruefalseotherlinear87.379487.3794truemissingunknownhttps://doi.org/10.1007/978-3-642-61582-5Hock and Schittkowski problem number 253.\nProblem 253 in\n K. Schittkowski,\n More Test Examples for Nonlinear Programming Codes,\n Lectures Notes in Economics and Mathematical Systems 282,\n Springer Verlag, Heidelberg, 1987.\n@book{Schittkowski1987,\n author = {Schittkowski, Klaus},\n title = {More Test Examples for Nonlinear Programming Codes},\n series = {Lecture Notes in Economics and Mathematical Systems},\n volume = {282},\n publisher = {Springer-Verlag},\n address = {Heidelberg},\n year = {1987}\n}\n HS2:253
2063false2falsetruehs254truefalsetruefalseothergeneral-1.73205-1.73205truemissingunknownhttps://doi.org/10.1007/978-3-642-61582-5Hock and Schittkowski problem number 254.\nProblem 254 in\n K. Schittkowski,\n More Test Examples for Nonlinear Programming Codes,\n Lectures Notes in Economics and Mathematical Systems 282,\n Springer Verlag, Heidelberg, 1987.\n@book{Schittkowski1987,\n author = {Schittkowski, Klaus},\n title = {More Test Examples for Nonlinear Programming Codes},\n series = {Lecture Notes in Economics and Mathematical Systems},\n volume = {282},\n publisher = {Springer-Verlag},\n address = {Heidelberg},\n year = {1987}\n}\n HS2:254
2074false0falsetruehs255falsefalsefalsefalseotherunconstrained00truemissingunknownhttps://doi.org/10.1007/978-3-642-61582-5Hock and Schittkowski problem number 255.\nProblem 255 in\n K. Schittkowski,\n More Test Examples for Nonlinear Programming Codes,\n Lectures Notes in Economics and Mathematical Systems 282,\n Springer Verlag, Heidelberg, 1987.\n@book{Schittkowski1987,\n author = {Schittkowski, Klaus},\n title = {More Test Examples for Nonlinear Programming Codes},\n series = {Lecture Notes in Economics and Mathematical Systems},\n volume = {282},\n publisher = {Springer-Verlag},\n address = {Heidelberg},\n year = {1987}\n}\n HS2:255
2084false0falsetruehs256falsefalsefalsefalseotherunconstrained00truemissingunknownhttps://doi.org/10.1007/978-3-642-61582-5Hock and Schittkowski problem number 256.\nProblem 256 in\n K. Schittkowski,\n More Test Examples for Nonlinear Programming Codes,\n Lectures Notes in Economics and Mathematical Systems 282,\n Springer Verlag, Heidelberg, 1987.\n@book{Schittkowski1987,\n author = {Schittkowski, Klaus},\n title = {More Test Examples for Nonlinear Programming Codes},\n series = {Lecture Notes in Economics and Mathematical Systems},\n volume = {282},\n publisher = {Springer-Verlag},\n address = {Heidelberg},\n year = {1987}\n}\n HS2:256
2094false0falsetruehs257falsefalsetruefalseotherunconstrained00truemissingunknownhttps://doi.org/10.1007/978-3-642-61582-5Hock and Schittkowski problem number 257.\nProblem 257 in\n K. Schittkowski,\n More Test Examples for Nonlinear Programming Codes,\n Lectures Notes in Economics and Mathematical Systems 282,\n Springer Verlag, Heidelberg, 1987.\n@book{Schittkowski1987,\n author = {Schittkowski, Klaus},\n title = {More Test Examples for Nonlinear Programming Codes},\n series = {Lecture Notes in Economics and Mathematical Systems},\n volume = {282},\n publisher = {Springer-Verlag},\n address = {Heidelberg},\n year = {1987}\n}\n HS2:257
2104false0falsetruehs258falsefalsefalsefalseotherunconstrained00truemissingunknownhttps://doi.org/10.1007/978-3-642-61582-5Hock and Schittkowski problem number 258.\nProblem 258 in\n K. Schittkowski,\n More Test Examples for Nonlinear Programming Codes,\n Lectures Notes in Economics and Mathematical Systems 282,\n Springer Verlag, Heidelberg, 1987.\n@book{Schittkowski1987,\n author = {Schittkowski, Klaus},\n title = {More Test Examples for Nonlinear Programming Codes},\n series = {Lecture Notes in Economics and Mathematical Systems},\n volume = {282},\n publisher = {Springer-Verlag},\n address = {Heidelberg},\n year = {1987}\n}\n HS2:258
2114false0falsetruehs259falsefalsefalsefalseotherunconstrained00truemissingunknownhttps://doi.org/10.1007/978-3-642-61582-5Hock and Schittkowski problem number 259.\nProblem 259 in\n K. Schittkowski,\n More Test Examples for Nonlinear Programming Codes,\n Lectures Notes in Economics and Mathematical Systems 282,\n Springer Verlag, Heidelberg, 1987.\n@book{Schittkowski1987,\n author = {Schittkowski, Klaus},\n title = {More Test Examples for Nonlinear Programming Codes},\n series = {Lecture Notes in Economics and Mathematical Systems},\n volume = {282},\n publisher = {Springer-Verlag},\n address = {Heidelberg},\n year = {1987}\n}\n HS2:259
2123false1falsetruehs26truefalsefalsefalseothergeneral-Inf21.16truemissingunknownhttps://bitbucket.org/optrove/sif/src/master/HS26.SIFHock and Schittkowski problem number 26.\n\nclassification OOR2-AY-3-1\n\nA. Cebola, Curitiba 10/2016.\nproblem 26 in\nW. Hock and K. Schittkowski,\n"Test examples for nonlinear programming codes",\nLectures Notes in Economics and Mathematical Systems 187, Springer\nVerlag, Heidelberg, 1981.\n\nSIF input: A.R. Conn, April 1990\n@book{HockSchittkowski1981,\n author = {Hock, W. and Schittkowski, K.},\n title = {Test Examples for Nonlinear Programming Codes},\n series = {Lecture Notes in Economics and Mathematical Systems},\n volume = {187},\n publisher = {Springer-Verlag},\n address = {Heidelberg},\n year = {1981}\n} \n CUTEst:HS26, HS:26
2134false0falsetruehs260falsefalsefalsefalseotherunconstrained00truemissingunknownhttps://doi.org/10.1007/978-3-642-61582-5Hock and Schittkowski problem number 260.\nProblem 260 in\n K. Schittkowski,\n More Test Examples for Nonlinear Programming Codes,\n Lectures Notes in Economics and Mathematical Systems 282,\n Springer Verlag, Heidelberg, 1987.\n@book{Schittkowski1987,\n author = {Schittkowski, Klaus},\n title = {More Test Examples for Nonlinear Programming Codes},\n series = {Lecture Notes in Economics and Mathematical Systems},\n volume = {282},\n publisher = {Springer-Verlag},\n address = {Heidelberg},\n year = {1987}\n}\n HS2:260
2144false0falsetruehs261falsefalsefalsefalseotherunconstrained00truemissingunknownhttps://doi.org/10.1007/978-3-642-61582-5Hock and Schittkowski problem number 261.\nProblem 261 in\n K. Schittkowski,\n More Test Examples for Nonlinear Programming Codes,\n Lectures Notes in Economics and Mathematical Systems 282,\n Springer Verlag, Heidelberg, 1987.\n@book{Schittkowski1987,\n author = {Schittkowski, Klaus},\n title = {More Test Examples for Nonlinear Programming Codes},\n series = {Lecture Notes in Economics and Mathematical Systems},\n volume = {282},\n publisher = {Springer-Verlag},\n address = {Heidelberg},\n year = {1987}\n}\n HS2:261
2154false4falsetruehs262falsefalsetruefalseotherlinear-10-10truemissingunknownhttps://doi.org/10.1007/978-3-642-61582-5Hock and Schittkowski problem number 262.\nProblem 262 in\n K. Schittkowski,\n More Test Examples for Nonlinear Programming Codes,\n Lectures Notes in Economics and Mathematical Systems 282,\n Springer Verlag, Heidelberg, 1987.\n@book{Schittkowski1987,\n author = {Schittkowski, Klaus},\n title = {More Test Examples for Nonlinear Programming Codes},\n series = {Lecture Notes in Economics and Mathematical Systems},\n volume = {282},\n publisher = {Springer-Verlag},\n address = {Heidelberg},\n year = {1987}\n}\n HS2:262
2164false4falsetruehs263falsefalsefalsefalseothergeneral-1-1truemissingunknownhttps://doi.org/10.1007/978-3-642-61582-5Hock and Schittkowski problem number 263.\nProblem 263 in\n K. Schittkowski,\n More Test Examples for Nonlinear Programming Codes,\n Lectures Notes in Economics and Mathematical Systems 282,\n Springer Verlag, Heidelberg, 1987.\n@book{Schittkowski1987,\n author = {Schittkowski, Klaus},\n title = {More Test Examples for Nonlinear Programming Codes},\n series = {Lecture Notes in Economics and Mathematical Systems},\n volume = {282},\n publisher = {Springer-Verlag},\n address = {Heidelberg},\n year = {1987}\n}\n HS2:263
2174false3falsetruehs264falsetruefalsefalseothergeneral-44-44truemissingunknownhttps://doi.org/10.1007/978-3-642-61582-5Hock and Schittkowski problem number 264.\nProblem 264 in\n K. Schittkowski,\n More Test Examples for Nonlinear Programming Codes,\n Lectures Notes in Economics and Mathematical Systems 282,\n Springer Verlag, Heidelberg, 1987.\n@book{Schittkowski1987,\n author = {Schittkowski, Klaus},\n title = {More Test Examples for Nonlinear Programming Codes},\n series = {Lecture Notes in Economics and Mathematical Systems},\n volume = {282},\n publisher = {Springer-Verlag},\n address = {Heidelberg},\n year = {1987}\n}\n HS2:264
2184false2falsetruehs265truefalsetruefalseotherlinear0.9747470.974747truemissingunknownhttps://doi.org/10.1007/978-3-642-61582-5Hock and Schittkowski problem number 265.\nProblem 265 in\n K. Schittkowski,\n More Test Examples for Nonlinear Programming Codes,\n Lectures Notes in Economics and Mathematical Systems 282,\n Springer Verlag, Heidelberg, 1987.\n@book{Schittkowski1987,\n author = {Schittkowski, Klaus},\n title = {More Test Examples for Nonlinear Programming Codes},\n series = {Lecture Notes in Economics and Mathematical Systems},\n volume = {282},\n publisher = {Springer-Verlag},\n address = {Heidelberg},\n year = {1987}\n}\n HS2:265
2193false1falsetruehs27truefalsefalsefalseothergeneral-InfInfmissingmissingunknownhttps://bitbucket.org/optrove/sif/src/master/HS27.SIFHock and Schittkowski problem number 27.\n\nclassification SQR2-AN-3-1\n\nA. Cebola, Curitiba 10/2016.\nproblem 27 in\nW. Hock and K. Schittkowski,\n"Test examples for nonlinear programming codes",\nLectures Notes in Economics and Mathematical Systems 187, Springer\nVerlag, Heidelberg, 1981.\n\nSIF input: A.R. Conn, April 1990\n@book{HockSchittkowski1981,\n author = {Hock, W. and Schittkowski, K.},\n title = {Test Examples for Nonlinear Programming Codes},\n series = {Lecture Notes in Economics and Mathematical Systems},\n volume = {187},\n publisher = {Springer-Verlag},\n address = {Heidelberg},\n year = {1981}\n} \n CUTEst:HS27, HS:27
2203false1falsetruehs28truefalsefalsefalseleast_squareslinear-Inf13.0truemissingunknownhttps://bitbucket.org/optrove/sif/src/master/HS28.SIFHock and Schittkowski problem number 28.\n\nclassification SLR2-AY-3-1\n\nclassification QLR2-AN-3-1\n\nA. Montoison, Montreal, 04/2018.\nproblem 28 in\nW. Hock and K. Schittkowski,\n"Test examples for nonlinear programming codes",\nLectures Notes in Economics and Mathematical Systems 187, Springer\nVerlag, Heidelberg, 1981.\n\nSIF input: A.R. Conn, April 1990\n@book{HockSchittkowski1981,\n author = {Hock, W. and Schittkowski, K.},\n title = {Test Examples for Nonlinear Programming Codes},\n series = {Lecture Notes in Economics and Mathematical Systems},\n volume = {187},\n publisher = {Springer-Verlag},\n address = {Heidelberg},\n year = {1981}\n} \n CUTEst:HS28, HS:28
2213false1falsetruehs29falsetruefalsefalseothergeneral-Inf-1.0truemissingunknownhttps://bitbucket.org/optrove/sif/src/master/HS29.SIFHock and Schittkowski problem number 29.\n\nclassification OQR2-AN-3-1\n\nclassification PQR2-AN-3-1\n\nA. Montoison, Montreal, 04/2018.\nproblem 29 in\nW. Hock and K. Schittkowski,\n"Test examples for nonlinear programming codes",\nLectures Notes in Economics and Mathematical Systems 187, Springer\nVerlag, Heidelberg, 1981.\n\nSIF input: A.R. Conn, April 1990\n@book{HockSchittkowski1981,\n author = {Hock, W. and Schittkowski, K.},\n title = {Test Examples for Nonlinear Programming Codes},\n series = {Lecture Notes in Economics and Mathematical Systems},\n volume = {187},\n publisher = {Springer-Verlag},\n address = {Heidelberg},\n year = {1981}\n} \n CUTEst:HS29, HS:29
2222false0falsetruehs3falsefalsetruefalseotherunconstrained-Inf1.00081truemissingunknownhttps://bitbucket.org/optrove/sif/src/master/HS3.SIFHock and Schittkowski problem number 3.\n\nclassification QBR2-AN-2-0\n\nN. Antunes, Curitiba, 10/2016.\nproblem 3 in\nW. Hock and K. Schittkowski,\n"Test examples for nonlinear programming codes",\nLectures Notes in Economics and Mathematical Systems 187, Springer\nVerlag, Heidelberg, 1981.\n\nSIF input: A.R. Conn March 1990\n@book{HockSchittkowski1981,\n author = {Hock, W. and Schittkowski, K.},\n title = {Test Examples for Nonlinear Programming Codes},\n series = {Lecture Notes in Economics and Mathematical Systems},\n volume = {187},\n publisher = {Springer-Verlag},\n address = {Heidelberg},\n year = {1981}\n} \n CUTEst:HS3, HS:3
2233false1falsetruehs30falsetruetruefalseleast_squaresgeneral-Inf3.0truemissingunknownhttps://bitbucket.org/optrove/sif/src/master/HS30.SIFHock and Schittkowski problem number 30.\n\nclassification QQR2-AN-3-1\n\nA. Montoison, Montreal, 04/2018.\nproblem 30 in\nW. Hock and K. Schittkowski,\n"Test examples for nonlinear programming codes",\nLectures Notes in Economics and Mathematical Systems 187, Springer\nVerlag, Heidelberg, 1981.\n\nSIF input: A.R. Conn, April 1990\n@book{HockSchittkowski1981,\n author = {Hock, W. and Schittkowski, K.},\n title = {Test Examples for Nonlinear Programming Codes},\n series = {Lecture Notes in Economics and Mathematical Systems},\n volume = {187},\n publisher = {Springer-Verlag},\n address = {Heidelberg},\n year = {1981}\n} \n CUTEst:HS30, HS:30
2243false1falsetruehs31falsetruetruefalseothergeneral-Inf19.0truemissingunknownhttps://bitbucket.org/optrove/sif/src/master/HS31.SIFHock and Schittkowski problem number 31.\n\nclassification QQR2-AN-3-1\n\nA. Montoison, Montreal, 05/2018.\nproblem 31 in\nW. Hock and K. Schittkowski,\n"Test examples for nonlinear programming codes",\nLectures Notes in Economics and Mathematical Systems 187, Springer\nVerlag, Heidelberg, 1981.\n\nSIF input: N. Gould, Dec 1989.\n@book{HockSchittkowski1981,\n author = {Hock, W. and Schittkowski, K.},\n title = {Test Examples for Nonlinear Programming Codes},\n series = {Lecture Notes in Economics and Mathematical Systems},\n volume = {187},\n publisher = {Springer-Verlag},\n address = {Heidelberg},\n year = {1981}\n} \n CUTEst:HS31, HS:31
2252false1falsetruehs316truefalsefalsefalsequadraticquadratic-InfInftruemissingacademichttps://doi.org/10.1007/978-3-642-61582-5Schittkowski problem number 316.\n\n classification QQR2-AN-2-1\n\nM. Gollier, Montréal, 05/2023\nProblem 316 in\n Schittkowski, K. (1987). \n More Test Examples for Nonlinear Programming Codes. \n Lecture Notes in Economics and Mathematical Systems.\n@book{Schittkowski1987,\n author = {Schittkowski, Klaus},\n title = {More Test Examples for Nonlinear Programming Codes},\n series = {Lecture Notes in Economics and Mathematical Systems},\n volume = {282},\n publisher = {Springer-Verlag},\n address = {Heidelberg},\n year = {1987}\n}\n HS2:316
2262false1falsetruehs317truefalsefalsefalsequadraticquadratic-InfInftruemissingacademichttps://doi.org/10.1007/978-3-642-61582-5Schittkowski problem number 317.\n\n classification QQR2-AN-2-1\n\nM. Gollier, Montréal, 05/2023\nProblem 317 in\n Schittkowski, K. (1987). \n More Test Examples for Nonlinear Programming Codes. \n Lecture Notes in Economics and Mathematical Systems.\n doi:10.1007/978-3-642-61582-5\n@book{Schittkowski1987,\n author = {Schittkowski, Klaus},\n title = {More Test Examples for Nonlinear Programming Codes},\n series = {Lecture Notes in Economics and Mathematical Systems},\n volume = {282},\n publisher = {Springer-Verlag},\n address = {Heidelberg},\n year = {1987}\n}\n HS2:317
2272false1falsetruehs318truefalsefalsefalsequadraticquadratic-InfInftruemissingacademichttps://doi.org/10.1007/978-3-642-61582-5Schittkowski problem number 318.\n\n classification QQR2-AN-2-1\n\nM. Gollier, Montréal, 05/2023\nProblem 318 in\n Schittkowski, K. (1987). \n More Test Examples for Nonlinear Programming Codes. \n Lecture Notes in Economics and Mathematical Systems.\n doi:10.1007/978-3-642-61582-5\n@book{Schittkowski1987,\n author = {Schittkowski, Klaus},\n title = {More Test Examples for Nonlinear Programming Codes},\n series = {Lecture Notes in Economics and Mathematical Systems},\n volume = {282},\n publisher = {Springer-Verlag},\n address = {Heidelberg},\n year = {1987}\n}\n HS2:318
2282false1falsetruehs319truefalsefalsefalsequadraticquadratic-InfInftruemissingacademichttps://doi.org/10.1007/978-3-642-61582-5Schittkowski problem number 319.\n\n classification QQR2-AN-2-1\n\nM. Gollier, Montréal, 05/2023\nProblem 319 in\n Schittkowski, K. (1987). \n More Test Examples for Nonlinear Programming Codes. \n Lecture Notes in Economics and Mathematical Systems.\n doi:10.1007/978-3-642-61582-5\n@book{Schittkowski1987,\n author = {Schittkowski, Klaus},\n title = {More Test Examples for Nonlinear Programming Codes},\n series = {Lecture Notes in Economics and Mathematical Systems},\n volume = {282},\n publisher = {Springer-Verlag},\n address = {Heidelberg},\n year = {1987}\n}\n HS2:319
2293false2falsetruehs32falsefalsetruefalseothergeneral-Inf7.2truemissingunknownhttps://bitbucket.org/optrove/sif/src/master/HS32.SIFHock and Schittkowski problem number 32.\n\nclassification SOR2-AY-3-2\n\nclassification QPR2-AN-3-2\n\nA. Montoison, Montreal, 05/2018.\nproblem 32 in\nW. Hock and K. Schittkowski,\n"Test examples for nonlinear programming codes",\nLectures Notes in Economics and Mathematical Systems 187, Springer\nVerlag, Heidelberg, 1981.\n\nSIF input: J-M COLLIN, April 1990.\n@book{HockSchittkowski1981,\n author = {Hock, W. and Schittkowski, K.},\n title = {Test Examples for Nonlinear Programming Codes},\n series = {Lecture Notes in Economics and Mathematical Systems},\n volume = {187},\n publisher = {Springer-Verlag},\n address = {Heidelberg},\n year = {1981}\n} \n CUTEst:HS32, HS:32
2302false1falsetruehs320truefalsefalsefalsequadraticquadratic-InfInftruemissingacademichttps://doi.org/10.1007/978-3-642-61582-5Schittkowski problem number 320.\n\n classification QQR2-AN-2-1\n\nM. Gollier, Montréal, 05/2023\nProblem 320 in\n Schittkowski, K. (1987). \n More Test Examples for Nonlinear Programming Codes. \n Lecture Notes in Economics and Mathematical Systems.\n doi:10.1007/978-3-642-61582-5\n@book{Schittkowski1987,\n author = {Schittkowski, Klaus},\n title = {More Test Examples for Nonlinear Programming Codes},\n series = {Lecture Notes in Economics and Mathematical Systems},\n volume = {282},\n publisher = {Springer-Verlag},\n address = {Heidelberg},\n year = {1987}\n}\n HS2:320
2312false1falsetruehs321truefalsefalsefalsequadraticquadratic-InfInftruemissingacademichttps://doi.org/10.1007/978-3-642-61582-5Schittkowski problem number 321.\n\n classification QQR2-AN-2-1\n\nM. Gollier, Montréal, 05/2023\nProblem 321 in\n Schittkowski, K. (1987). \n More Test Examples for Nonlinear Programming Codes. \n Lecture Notes in Economics and Mathematical Systems.\n doi:10.1007/978-3-642-61582-5\n@book{Schittkowski1987,\n author = {Schittkowski, Klaus},\n title = {More Test Examples for Nonlinear Programming Codes},\n series = {Lecture Notes in Economics and Mathematical Systems},\n volume = {282},\n publisher = {Springer-Verlag},\n address = {Heidelberg},\n year = {1987}\n}\n HS2:321
2322false1falsetruehs322truefalsefalsefalsequadraticquadratic-InfInftruemissingacademichttps://doi.org/10.1007/978-3-642-61582-5Schittkowski problem number 322.\n\n classification QQR2-AN-2-1\n\nM. Gollier, Montréal, 05/2023\nProblem 322 in\n Schittkowski, K. (1987). \n More Test Examples for Nonlinear Programming Codes. \n Lecture Notes in Economics and Mathematical Systems.\n doi:10.1007/978-3-642-61582-5\n@book{Schittkowski1987,\n author = {Schittkowski, Klaus},\n title = {More Test Examples for Nonlinear Programming Codes},\n series = {Lecture Notes in Economics and Mathematical Systems},\n volume = {282},\n publisher = {Springer-Verlag},\n address = {Heidelberg},\n year = {1987}\n}\n HS2:322
2333false2falsetruehs33falsetruetruefalseothergeneral-Inf-3.0truemissingunknownhttps://bitbucket.org/optrove/sif/src/master/HS33.SIFHock and Schittkowski problem number 33.\n\nclassification OQR2-AN-3-2\n\nclassification PQR2-AN-3-2\n\nA. Montoison, Montreal, 05/2018.\nproblem 33 in\nW. Hock and K. Schittkowski,\n"Test examples for nonlinear programming codes",\nLectures Notes in Economics and Mathematical Systems 187, Springer\nVerlag, Heidelberg, 1981.\n\nSIF input: A.R. Conn, April 1990\n@book{HockSchittkowski1981,\n author = {Hock, W. and Schittkowski, K.},\n title = {Test Examples for Nonlinear Programming Codes},\n series = {Lecture Notes in Economics and Mathematical Systems},\n volume = {187},\n publisher = {Springer-Verlag},\n address = {Heidelberg},\n year = {1981}\n} \n CUTEst:HS33, HS:33
2343false2falsetruehs34falsetruetruefalseothergeneral-Inf0.0truemissingunknownhttps://bitbucket.org/optrove/sif/src/master/HS34.SIFHock and Schittkowski problem number 34.\n\nclassification LOR2-AN-3-2\n\nclassification LGR2-AN-3-2\n\nA. Montoison, Montreal, 05/2018.\nproblem 34 in\nW. Hock and K. Schittkowski,\n"Test examples for nonlinear programming codes",\nLectures Notes in Economics and Mathematical Systems 187, Springer\nVerlag, Heidelberg, 1981.\n\nSIF input: A.R. Conn, April 1990\n@book{HockSchittkowski1981,\n author = {Hock, W. and Schittkowski, K.},\n title = {Test Examples for Nonlinear Programming Codes},\n series = {Lecture Notes in Economics and Mathematical Systems},\n volume = {187},\n publisher = {Springer-Verlag},\n address = {Heidelberg},\n year = {1981}\n} \n CUTEst:HS34, HS:34
2353false1falsetruehs35falsetruetruefalseotherlinear-Inf2.25truemissingunknownhttps://bitbucket.org/optrove/sif/src/master/HS35.SIFHock and Schittkowski problem number 35.\n\nclassification QLR2-AN-3-1\n\nA. Montoison, Montreal, 05/2018.\nproblem 35 in\nW. Hock and K. Schittkowski,\n"Test examples for nonlinear programming codes",\nLectures Notes in Economics and Mathematical Systems 187, Springer\nVerlag, Heidelberg, 1981.\n\nSIF input: A.R. Conn, April 1990\n@book{HockSchittkowski1981,\n author = {Hock, W. and Schittkowski, K.},\n title = {Test Examples for Nonlinear Programming Codes},\n series = {Lecture Notes in Economics and Mathematical Systems},\n volume = {187},\n publisher = {Springer-Verlag},\n address = {Heidelberg},\n year = {1981}\n} \n CUTEst:HS35, HS:35
2363false1falsetruehs36falsetruetruefalseotherlinear-Inf-1000.0truemissingunknownhttps://bitbucket.org/optrove/sif/src/master/HS36.SIFHock and Schittkowski problem number 36.\n\nclassification OLR2-AN-3-1\n\nclassification PLR2-AN-3-1\n\nA. Montoison, Montreal, 05/2018.\nproblem 36 in\nW. Hock and K. Schittkowski,\n"Test examples for nonlinear programming codes",\nLectures Notes in Economics and Mathematical Systems 187, Springer\nVerlag, Heidelberg, 1981.\n\nSIF input: A.R. Conn, April 1990\n@book{HockSchittkowski1981,\n author = {Hock, W. and Schittkowski, K.},\n title = {Test Examples for Nonlinear Programming Codes},\n series = {Lecture Notes in Economics and Mathematical Systems},\n volume = {187},\n publisher = {Springer-Verlag},\n address = {Heidelberg},\n year = {1981}\n} \n CUTEst:HS36, HS:36
2373false1falsetruehs37falsetruetruefalseotherlinear-Inf-1000.0truemissingunknownhttps://bitbucket.org/optrove/sif/src/master/HS37.SIFHock and Schittkowski problem number 37.\n\nclassification OLR2-AN-3-2\n\nclassification PLR2-AN-3-2\n\nA. Montoison, Montreal, 05/2018.\nproblem 37 in\nW. Hock and K. Schittkowski,\n"Test examples for nonlinear programming codes",\nLectures Notes in Economics and Mathematical Systems 187, Springer\nVerlag, Heidelberg, 1981.\n\nSIF input: A.R. Conn, April 1990\n@book{HockSchittkowski1981,\n author = {Hock, W. and Schittkowski, K.},\n title = {Test Examples for Nonlinear Programming Codes},\n series = {Lecture Notes in Economics and Mathematical Systems},\n volume = {187},\n publisher = {Springer-Verlag},\n address = {Heidelberg},\n year = {1981}\n} \n CUTEst:HS37, HS:37
23810false3falsetruehs378truefalsefalsefalseothergeneral-InfInftruemissingacademichttps://doi.org/10.1007/978-3-642-61582-5Schittkowski problem number 378.\n\n classification OOR2-AN-10-3\n\nM. Gollier, Montréal, 05/2023\nProblem 378 in\n Schittkowski, K. (1987). \n More Test Examples for Nonlinear Programming Codes. \n Lecture Notes in Economics and Mathematical Systems.\n doi:10.1007/978-3-642-61582-5\n@book{Schittkowski1987,\n author = {Schittkowski, Klaus},\n title = {More Test Examples for Nonlinear Programming Codes},\n series = {Lecture Notes in Economics and Mathematical Systems},\n volume = {282},\n publisher = {Springer-Verlag},\n address = {Heidelberg},\n year = {1987}\n}\n HS2:378
2394false0falsetruehs38falsefalsetruefalseotherunconstrained-Inf19192.0truemissingunknownhttps://bitbucket.org/optrove/sif/src/master/HS38.SIFHock and Schittkowski problem number 38.\n\nColville #4 test problem\n\nclassification OBR2-AN-4-0\n\nclassification PLR2-AN-4-0\n\nA. Montoison, Montreal, 05/2018.\nproblem 38 in\nW. Hock and K. Schittkowski,\n"Test examples for nonlinear programming codes",\nLectures Notes in Economics and Mathematical Systems 187, Springer\nVerlag, Heidelberg, 1981.\n\nSIF input: A.R. Conn, April 1990\n@book{HockSchittkowski1981,\n author = {Hock, W. and Schittkowski, K.},\n title = {Test Examples for Nonlinear Programming Codes},\n series = {Lecture Notes in Economics and Mathematical Systems},\n volume = {187},\n publisher = {Springer-Verlag},\n address = {Heidelberg},\n year = {1981}\n} \n CUTEst:HS38, HS:38
2404false2falsetruehs39truefalsefalsefalseothergeneral-InfInfmissingmissingunknownhttps://bitbucket.org/optrove/sif/src/master/HS39.SIFHock and Schittkowski problem number 39.\n\nclassification LOR2-AN-4-2\n\nD. Cabral, Curitiba, 10/2016.\nproblem 39 in\nW. Hock and K. Schittkowski,\n"Test examples for nonlinear programming codes",\nLectures Notes in Economics and Mathematical Systems 187, Springer\nVerlag, Heidelberg, 1981.\n\nSIF input: A.R. Conn, April 1990\n@book{HockSchittkowski1981,\n author = {Hock, W. and Schittkowski, K.},\n title = {Test Examples for Nonlinear Programming Codes},\n series = {Lecture Notes in Economics and Mathematical Systems},\n volume = {187},\n publisher = {Springer-Verlag},\n address = {Heidelberg},\n year = {1981}\n} \n CUTEst:HS39, HS:39
2412false0falsetruehs4falsefalsetruefalseotherunconstrained-Inf3.32357truemissingunknownhttps://bitbucket.org/optrove/sif/src/master/HS4.SIFHock and Schittkowski problem number 4.\n\nclassification OBR2-AN-2-0\n\nN. Antunes, Curitiba, 10/2016.\nproblem 4 in\nW. Hock and K. Schittkowski,\n"Test examples for nonlinear programming codes",\nLectures Notes in Economics and Mathematical Systems 187, Springer\nVerlag, Heidelberg, 1981.\n\nSIF input: A.R. Conn March 1990\n@book{HockSchittkowski1981,\n author = {Hock, W. and Schittkowski, K.},\n title = {Test Examples for Nonlinear Programming Codes},\n series = {Lecture Notes in Economics and Mathematical Systems},\n volume = {187},\n publisher = {Springer-Verlag},\n address = {Heidelberg},\n year = {1981}\n} \n CUTEst:HS4, HS:4
2424false3falsetruehs40truefalsefalsefalseothergeneral-InfInfmissingmissingunknownhttps://bitbucket.org/optrove/sif/src/master/HS40.SIFHock and Schittkowski problem number 40.\n\nclassification OOR2-AN-4-3\n\nD. Cabral, Curitiba, 10/2016.\nproblem 40 in\nW. Hock and K. Schittkowski,\n"Test examples for nonlinear programming codes",\nLectures Notes in Economics and Mathematical Systems 187, Springer\nVerlag, Heidelberg, 1981.\n\nSIF input: A.R. Conn, April 1990\n@book{HockSchittkowski1981,\n author = {Hock, W. and Schittkowski, K.},\n title = {Test Examples for Nonlinear Programming Codes},\n series = {Lecture Notes in Economics and Mathematical Systems},\n volume = {187},\n publisher = {Springer-Verlag},\n address = {Heidelberg},\n year = {1981}\n} \n CUTEst:HS40, HS:40
2434false1falsetruehs41truefalsetruefalseotherlinear-InfInfmissingmissingunknownhttps://bitbucket.org/optrove/sif/src/master/HS41.SIFHock and Schittkowski problem number 41.\n\nclassification OLR2-AN-4-1\n\nclassification PLR2-AN-4-1\n\nA. Montoison, Montreal, 05/2018.\nproblem 41 in\nW. Hock and K. Schittkowski,\n"Test examples for nonlinear programming codes",\nLectures Notes in Economics and Mathematical Systems 187, Springer\nVerlag, Heidelberg, 1981.\n\nSIF input: A.R. Conn, April 1990\n@book{HockSchittkowski1981,\n author = {Hock, W. and Schittkowski, K.},\n title = {Test Examples for Nonlinear Programming Codes},\n series = {Lecture Notes in Economics and Mathematical Systems},\n volume = {187},\n publisher = {Springer-Verlag},\n address = {Heidelberg},\n year = {1981}\n} \n CUTEst:HS41, HS:41
2444false2falsetruehs42truefalsefalsefalseleast_squaresgeneral-InfInfmissingmissingunknownhttps://bitbucket.org/optrove/sif/src/master/HS42.SIFHock and Schittkowski problem number 42.\n\nclassification SQR2-AN-4-2\n\nclassification QQR2-AN-4-1\n\nA. Montoison, Montreal, 05/2018.\nproblem 42 in\nW. Hock and K. Schittkowski,\n"Test examples for nonlinear programming codes",\nLectures Notes in Economics and Mathematical Systems 187, Springer\nVerlag, Heidelberg, 1981.\n\nSIF input: A.R. Conn, April 1990\n@book{HockSchittkowski1981,\n author = {Hock, W. and Schittkowski, K.},\n title = {Test Examples for Nonlinear Programming Codes},\n series = {Lecture Notes in Economics and Mathematical Systems},\n volume = {187},\n publisher = {Springer-Verlag},\n address = {Heidelberg},\n year = {1981}\n} \n CUTEst:HS42, HS:42
2454false3falsetruehs43falsetruefalsefalseothergeneral-Inf0.0truemissingunknownhttps://bitbucket.org/optrove/sif/src/master/HS43.SIFHock and Schittkowski problem number 43.\n\nThe Rosen-Suzuki test problem.\n\nclassification QQR2-AN-4-3\n\nA. Montoison, Montreal, 05/2018.\nproblem 43 in\nW. Hock and K. Schittkowski,\n"Test examples for nonlinear programming codes",\nLectures Notes in Economics and Mathematical Systems 187, Springer\nVerlag, Heidelberg, 1981.\n\nSIF input: A.R. Conn, April 1990\n@book{HockSchittkowski1981,\n author = {Hock, W. and Schittkowski, K.},\n title = {Test Examples for Nonlinear Programming Codes},\n series = {Lecture Notes in Economics and Mathematical Systems},\n volume = {187},\n publisher = {Springer-Verlag},\n address = {Heidelberg},\n year = {1981}\n} \n CUTEst:HS43, HS:43
2464false6falsetruehs44falsetruetruefalseotherlinear-Inf0.0truemissingunknownhttps://bitbucket.org/optrove/sif/src/master/HS44.SIFHock and Schittkowski problem number 44.\n\nclassification QLR2-AN-4-6\n\nA. Montoison, Montreal, 05/2018.\nproblem 44 in\nW. Hock and K. Schittkowski,\n"Test examples for nonlinear programming codes",\nLectures Notes in Economics and Mathematical Systems 187, Springer\nVerlag, Heidelberg, 1981.\n\nSIF input: Ph.L. Toint, October 1990.\n@book{HockSchittkowski1981,\n author = {Hock, W. and Schittkowski, K.},\n title = {Test Examples for Nonlinear Programming Codes},\n series = {Lecture Notes in Economics and Mathematical Systems},\n volume = {187},\n publisher = {Springer-Verlag},\n address = {Heidelberg},\n year = {1981}\n} \n CUTEst:HS44, HS:44
2475false0falsetruehs45falsefalsetruefalseotherunconstrained-Inf1.73333truemissingunknownhttps://bitbucket.org/optrove/sif/src/master/HS45.SIFHock and Schittkowski problem number 45.\n\nclassification OBR2-AN-5-0\n\nclassification PBR2-AN-5-0\n\nA. Montoison, Montreal, 05/2018.\nproblem 45 in\nW. Hock and K. Schittkowski,\n"Test examples for nonlinear programming codes",\nLectures Notes in Economics and Mathematical Systems 187, Springer\nVerlag, Heidelberg, 1981.\n\nSIF input: Ph.L. Toint, October 1990.\n@book{HockSchittkowski1981,\n author = {Hock, W. and Schittkowski, K.},\n title = {Test Examples for Nonlinear Programming Codes},\n series = {Lecture Notes in Economics and Mathematical Systems},\n volume = {187},\n publisher = {Springer-Verlag},\n address = {Heidelberg},\n year = {1981}\n} \n CUTEst:HS45, HS:45
2485false2falsetruehs46truefalsefalsefalseothergeneral-InfInfmissingmissingunknownhttps://bitbucket.org/optrove/sif/src/master/HS46.SIFHock and Schittkowski problem number 46.\n\nclassification OOR2-AY-5-2\n\nclassification PGR2-AN-5-2\n\nA. Montoison, Montreal, 05/2018.\nproblem 46 in\nW. Hock and K. Schittkowski,\n"Test examples for nonlinear programming codes",\nLectures Notes in Economics and Mathematical Systems 187, Springer\nVerlag, Heidelberg, 1981.\n\nSIF input: Ph.L. Toint, October 1990.\n@book{HockSchittkowski1981,\n author = {Hock, W. and Schittkowski, K.},\n title = {Test Examples for Nonlinear Programming Codes},\n series = {Lecture Notes in Economics and Mathematical Systems},\n volume = {187},\n publisher = {Springer-Verlag},\n address = {Heidelberg},\n year = {1981}\n} \n CUTEst:HS46, HS:46
2495false3falsetruehs47truefalsefalsefalseothergeneral-Inf20.7381truemissingunknownhttps://bitbucket.org/optrove/sif/src/master/HS47.SIFHock and Schittkowski problem number 47.\n\nclassification OOR2-AY-5-3\n\nclassification PPR2-AN-5-3\n\nA. Montoison, Montreal, 05/2018.\nproblem 47 in\nW. Hock and K. Schittkowski,\n"Test examples for nonlinear programming codes",\nLectures Notes in Economics and Mathematical Systems 187, Springer\nVerlag, Heidelberg, 1981.\n\nSIF input: A.R. Conn, April 1990\n@book{HockSchittkowski1981,\n author = {Hock, W. and Schittkowski, K.},\n title = {Test Examples for Nonlinear Programming Codes},\n series = {Lecture Notes in Economics and Mathematical Systems},\n volume = {187},\n publisher = {Springer-Verlag},\n address = {Heidelberg},\n year = {1981}\n} \n CUTEst:HS47, HS:47
2505false2falsetruehs48truefalsefalsefalseleast_squareslinear-Inf84.0truemissingunknownhttps://bitbucket.org/optrove/sif/src/master/HS48.SIFHock and Schittkowski problem number 48.\n\nclassification SLR2-AY-5-2\n\nclassification QLR2-AN-5-2\n\nA. Montoison, Montreal, 05/2018.\nproblem 48 in\nW. Hock and K. Schittkowski,\n"Test examples for nonlinear programming codes",\nLectures Notes in Economics and Mathematical Systems 187, Springer\nVerlag, Heidelberg, 1981.\n\nSIF input: A.R. Conn, April 1990\n@book{HockSchittkowski1981,\n author = {Hock, W. and Schittkowski, K.},\n title = {Test Examples for Nonlinear Programming Codes},\n series = {Lecture Notes in Economics and Mathematical Systems},\n volume = {187},\n publisher = {Springer-Verlag},\n address = {Heidelberg},\n year = {1981}\n} \n CUTEst:HS48, HS:48
2515false2falsetruehs49truefalsefalsefalseotherlinear-Inf266.0truemissingunknownhttps://bitbucket.org/optrove/sif/src/master/HS49.SIFHock and Schittkowski problem number 49.\n\nclassification OLR2-AY-5-2\n\nclassification PLR2-AN-5-2\n\nA. Montoison, Montreal, 05/2018.\nproblem 49 in\nW. Hock and K. Schittkowski,\n"Test examples for nonlinear programming codes",\nLectures Notes in Economics and Mathematical Systems 187, Springer\nVerlag, Heidelberg, 1981.\n\nSIF input: A.R. Conn, April 1990\n@book{HockSchittkowski1981,\n author = {Hock, W. and Schittkowski, K.},\n title = {Test Examples for Nonlinear Programming Codes},\n series = {Lecture Notes in Economics and Mathematical Systems},\n volume = {187},\n publisher = {Springer-Verlag},\n address = {Heidelberg},\n year = {1981}\n} \n CUTEst:HS49, HS:49
2522false0falsetruehs5falsefalsetruefalseotherunconstrained-Inf1.0truemissingunknownhttps://bitbucket.org/optrove/sif/src/master/HS5.SIFHock and Schittkowski problem number 5.\n\nclassification OBR2-AN-2-0\n\nN. Antunes, Curitiba, 10/2016.\nproblem 5 in\nW. Hock and K. Schittkowski,\n"Test examples for nonlinear programming codes",\nLectures Notes in Economics and Mathematical Systems 187, Springer\nVerlag, Heidelberg, 1981.\n\nSIF input: A.R. Conn March 1990\n@book{HockSchittkowski1981,\n author = {Hock, W. and Schittkowski, K.},\n title = {Test Examples for Nonlinear Programming Codes},\n series = {Lecture Notes in Economics and Mathematical Systems},\n volume = {187},\n publisher = {Springer-Verlag},\n address = {Heidelberg},\n year = {1981}\n} \n CUTEst:HS5, HS:5
2535false3falsetruehs50truefalsefalsefalseotherlinear-Inf7516.0truemissingunknownhttps://bitbucket.org/optrove/sif/src/master/HS50.SIFHock and Schittkowski problem number 50.\n\nclassification OLR2-AY-5-3\n\nclassification PLR2-AN-5-3\n\nA. Montoison, Montreal, 05/2018.\nproblem 50 in\nW. Hock and K. Schittkowski,\n"Test examples for nonlinear programming codes",\nLectures Notes in Economics and Mathematical Systems 187, Springer\nVerlag, Heidelberg, 1981.\n\nSIF input: A.R. Conn, April 1990\n@book{HockSchittkowski1981,\n author = {Hock, W. and Schittkowski, K.},\n title = {Test Examples for Nonlinear Programming Codes},\n series = {Lecture Notes in Economics and Mathematical Systems},\n volume = {187},\n publisher = {Springer-Verlag},\n address = {Heidelberg},\n year = {1981}\n} \n CUTEst:HS50, HS:50
2545false3falsetruehs51truefalsefalsefalseleast_squareslinear-Inf8.5truemissingunknownhttps://bitbucket.org/optrove/sif/src/master/HS51.SIFHock and Schittkowski problem number 51.\n\nclassification QLR2-AY-5-3\n\nclassification QLR2-AN-5-3\n\nA. Montoison, Montreal, 05/2018.\nproblem 51 in\nW. Hock and K. Schittkowski,\n"Test examples for nonlinear programming codes",\nLectures Notes in Economics and Mathematical Systems 187, Springer\nVerlag, Heidelberg, 1981.\n\nSIF input: A.R. Conn, April 1990\n@book{HockSchittkowski1981,\n author = {Hock, W. and Schittkowski, K.},\n title = {Test Examples for Nonlinear Programming Codes},\n series = {Lecture Notes in Economics and Mathematical Systems},\n volume = {187},\n publisher = {Springer-Verlag},\n address = {Heidelberg},\n year = {1981}\n} \n CUTEst:HS51, HS:51
2555false3falsetruehs52truefalsefalsefalseleast_squareslinear-InfInfmissingmissingunknownhttps://bitbucket.org/optrove/sif/src/master/HS52.SIFHock and Schittkowski problem number 52.\n\nclassification QLR2-AY-5-3\n\nclassification QLR2-AN-5-3\n\nA. Montoison, Montreal, 05/2018.\nproblem 52 in\nW. Hock and K. Schittkowski,\n"Test examples for nonlinear programming codes",\nLectures Notes in Economics and Mathematical Systems 187, Springer\nVerlag, Heidelberg, 1981.\n\nSIF input: A.R. Conn, April 1990\n@book{HockSchittkowski1981,\n author = {Hock, W. and Schittkowski, K.},\n title = {Test Examples for Nonlinear Programming Codes},\n series = {Lecture Notes in Economics and Mathematical Systems},\n volume = {187},\n publisher = {Springer-Verlag},\n address = {Heidelberg},\n year = {1981}\n} \n CUTEst:HS52, HS:52
2565false3falsetruehs53truefalsetruefalseleast_squareslinear-InfInfmissingmissingunknownhttps://bitbucket.org/optrove/sif/src/master/HS53.SIFHock and Schittkowski problem number 53.\n\nclassification QLR2-AY-5-3\n\nclassification QLR2-AN-5-3\n\nA. Montoison, Montreal, 05/2018.\nproblem 53 in\nW. Hock and K. Schittkowski,\n"Test examples for nonlinear programming codes",\nLectures Notes in Economics and Mathematical Systems 187, Springer\nVerlag, Heidelberg, 1981.\n\nSIF input: A.R. Conn, April 1990\n@book{HockSchittkowski1981,\n author = {Hock, W. and Schittkowski, K.},\n title = {Test Examples for Nonlinear Programming Codes},\n series = {Lecture Notes in Economics and Mathematical Systems},\n volume = {187},\n publisher = {Springer-Verlag},\n address = {Heidelberg},\n year = {1981}\n} \n CUTEst:HS53, HS:53
2576false1falsetruehs54truefalsetruefalseotherlinear-InfInfmissingmissingunknownhttps://bitbucket.org/optrove/sif/src/master/HS54.SIFHock and Schittkowski problem number 54.\n\nclassification OLR2-AN-6-1\n\nclassification GLR2-AN-6-1\n\nA. Montoison, Montreal, 05/2018.\nproblem 54, incorrectly stated in\nW. Hock and K. Schittkowski,\n"Test examples for nonlinear programming codes",\nLectures Notes in Economics and Mathematical Systems 187, Springer\nVerlag, Heidelberg, 1981.\nBetts problem 11.7, JOTA 21, 1977, pp.137-174.\n\nSIF input: A.R. Conn, April 1990 and Nick Gould, October 1990\n@book{HockSchittkowski1981,\n author = {Hock, W. and Schittkowski, K.},\n title = {Test Examples for Nonlinear Programming Codes},\n series = {Lecture Notes in Economics and Mathematical Systems},\n volume = {187},\n publisher = {Springer-Verlag},\n address = {Heidelberg},\n year = {1981}\n} \n CUTEst:HS54, HS:54
2586false6falsetruehs55truefalsetruefalseotherlinear-InfInfmissingmissingunknownhttps://bitbucket.org/optrove/sif/src/master/HS55.SIFHock and Schittkowski problem number 54.\n\nclassification OLR2-AN-6-6\n\nclassification GLR2-AN-6-1\n\nA. Montoison, Montreal, 05/2018.\nproblem 55 in\nW. Hock and K. Schittkowski,\n"Test examples for nonlinear programming codes",\nLectures Notes in Economics and Mathematical Systems 187, Springer\nVerlag, Heidelberg, 1981.\n\nSIF input: A.R. Conn, April 1990\n@book{HockSchittkowski1981,\n author = {Hock, W. and Schittkowski, K.},\n title = {Test Examples for Nonlinear Programming Codes},\n series = {Lecture Notes in Economics and Mathematical Systems},\n volume = {187},\n publisher = {Springer-Verlag},\n address = {Heidelberg},\n year = {1981}\n} \n CUTEst:HS55, HS:55
2597false4falsetruehs56truefalsefalsefalseothergeneral-InfInfmissingmissingunknownhttps://bitbucket.org/optrove/sif/src/master/HS56.SIFclassification OOR2-AN-7-4\n\nclassification PGR2-AN-7-4\n\nA. Montoison, Montreal, 05/2018.\nproblem 56 in\nW. Hock and K. Schittkowski,\n"Test examples for nonlinear programming codes",\nLectures Notes in Economics and Mathematical Systems 187, Springer\nVerlag, Heidelberg, 1981.\n\nSIF input: A.R. Conn, April 1990\n@book{HockSchittkowski1981,\n author = {Hock, W. and Schittkowski, K.},\n title = {Test Examples for Nonlinear Programming Codes},\n series = {Lecture Notes in Economics and Mathematical Systems},\n volume = {187},\n publisher = {Springer-Verlag},\n address = {Heidelberg},\n year = {1981}\n} \n CUTEst:HS56, HS:56
2602false1falsetruehs57falsetruetruefalseleast_squaresgeneral-Inf0.0307986truemissingunknownhttps://bitbucket.org/optrove/sif/src/master/HS57.SIFclassification SQR2-AN-2-1\n\nclassification SQR-AN-2-1\n\nA. Montoison, Montreal, 05/2018.\nproblem 57 in\nW. Hock and K. Schittkowski,\n"Test examples for nonlinear programming codes",\nLectures Notes in Economics and Mathematical Systems 187, Springer\nVerlag, Heidelberg, 1981.\n\nSIF input: A.R. Conn, April 1990\n@book{HockSchittkowski1981,\n author = {Hock, W. and Schittkowski, K.},\n title = {Test Examples for Nonlinear Programming Codes},\n series = {Lecture Notes in Economics and Mathematical Systems},\n volume = {187},\n publisher = {Springer-Verlag},\n address = {Heidelberg},\n year = {1981}\n} \n CUTEst:HS57, HS:57
2612false3falsetruehs59falsetruetruefalseothergeneral-InfInfmissingmissingunknownhttps://bitbucket.org/optrove/sif/src/master/HS59.SIFHock and Schittkowski problem number 54.\n\nclassification OQR2-AN-2-3\n\nclassification GLR2-AN-6-1\n\nA. Montoison, Montreal, 05/2018.\nproblem 59 (corrected) in\nW. Hock and K. Schittkowski,\n"Test examples for nonlinear programming codes",\nLectures Notes in Economics and Mathematical Systems 187, Springer\nVerlag, Heidelberg, 1981.\n\nSIF input: A.R. Conn and Ph.L. Toint, November 1990.\n@book{HockSchittkowski1981,\n author = {Hock, W. and Schittkowski, K.},\n title = {Test Examples for Nonlinear Programming Codes},\n series = {Lecture Notes in Economics and Mathematical Systems},\n volume = {187},\n publisher = {Springer-Verlag},\n address = {Heidelberg},\n year = {1981}\n} \n CUTEst:HS59, HS:59
2622false1falsetruehs6truefalsefalsefalseleast_squaresgeneral-InfInfmissingmissingunknownhttps://bitbucket.org/optrove/sif/src/master/HS6.SIFclassification QQR2-AN-2-1\n \n D. Orban, Montreal, 04/2016.\nproblem 6 in\nW. Hock and K. Schittkowski,\n"Test examples for nonlinear programming codes",\nLectures Notes in Economics and Mathematical Systems 187, Springer\nVerlag, Heidelberg, 1981.\n\nSIF input: A.R. Conn March 1990\n@book{HockSchittkowski1981,\n author = {Hock, W. and Schittkowski, K.},\n title = {Test Examples for Nonlinear Programming Codes},\n series = {Lecture Notes in Economics and Mathematical Systems},\n volume = {187},\n publisher = {Springer-Verlag},\n address = {Heidelberg},\n year = {1981}\n} \n CUTEst:HS6, HS:6
2633false1falsetruehs60truefalsetruefalseothergeneral-InfInfmissingmissingunknownhttps://bitbucket.org/optrove/sif/src/master/HS60.SIFHock and Schittkowski problem number 60.\n\nclassification OOR2-AY-3-1\n\nclassification PPR2-AN-3-1\n\nA. Montoison, Montreal, 05/2018.\nproblem 60 in\nW. Hock and K. Schittkowski,\n"Test examples for nonlinear programming codes",\nLectures Notes in Economics and Mathematical Systems 187, Springer\nVerlag, Heidelberg, 1981.\n\nSIF input: J-M Collin, April 1990.\n@book{HockSchittkowski1981,\n author = {Hock, W. and Schittkowski, K.},\n title = {Test Examples for Nonlinear Programming Codes},\n series = {Lecture Notes in Economics and Mathematical Systems},\n volume = {187},\n publisher = {Springer-Verlag},\n address = {Heidelberg},\n year = {1981}\n} \n CUTEst:HS60, HS:60
2643false2falsetruehs61truefalsefalsefalseothergeneral-InfInfmissingmissingunknownhttps://bitbucket.org/optrove/sif/src/master/HS61.SIFHock and Schittkowski problem number 61.\n\nclassification QQR2-AN-3-2\nA. Montoison, Montreal, 05/2018.\nproblem 61 in\nW. Hock and K. Schittkowski,\n"Test examples for nonlinear programming codes",\nLectures Notes in Economics and Mathematical Systems 187, Springer\nVerlag, Heidelberg, 1981.\n\nSIF input: Ph.L. Toint, November 1990.\n@book{HockSchittkowski1981,\n author = {Hock, W. and Schittkowski, K.},\n title = {Test Examples for Nonlinear Programming Codes},\n series = {Lecture Notes in Economics and Mathematical Systems},\n volume = {187},\n publisher = {Springer-Verlag},\n address = {Heidelberg},\n year = {1981}\n} \n CUTEst:HS61, HS:61
2653false1falsetruehs62truefalsetruefalseotherlinear-InfInfmissingmissingunknownhttps://bitbucket.org/optrove/sif/src/master/HS62.SIFHock and Schittkowski problem number 62.\n\nclassification OLR2-AY-3-1\n\nclassification GLR2-AN-3-1\nA. Montoison, Montreal, 05/2018.\nproblem 62 in\nW. Hock and K. Schittkowski,\n"Test examples for nonlinear programming codes",\nLectures Notes in Economics and Mathematical Systems 187, Springer\nVerlag, Heidelberg, 1981.\n\nSIF input: J-M Collin and Ph. Toint, April 1990.\n@book{HockSchittkowski1981,\n author = {Hock, W. and Schittkowski, K.},\n title = {Test Examples for Nonlinear Programming Codes},\n series = {Lecture Notes in Economics and Mathematical Systems},\n volume = {187},\n publisher = {Springer-Verlag},\n address = {Heidelberg},\n year = {1981}\n} \n CUTEst:HS62, HS:62
2663false2falsetruehs63truefalsetruefalseothergeneral-InfInfmissingmissingunknownhttps://bitbucket.org/optrove/sif/src/master/HS63.SIFHock and Schittkowski problem number 63.\n\nclassification QQR2-AY-3-2\n\nclassification QQR2-AN-3-2\nA. Montoison, Montreal, 05/2018.\nproblem 63 in\nW. Hock and K. Schittkowski,\n"Test examples for nonlinear programming codes",\nLectures Notes in Economics and Mathematical Systems 187, Springer\nVerlag, Heidelberg, 1981.\n\nSIF input: J-M COLLIN, April 1990.\n@book{HockSchittkowski1981,\n author = {Hock, W. and Schittkowski, K.},\n title = {Test Examples for Nonlinear Programming Codes},\n series = {Lecture Notes in Economics and Mathematical Systems},\n volume = {187},\n publisher = {Springer-Verlag},\n address = {Heidelberg},\n year = {1981}\n} \n CUTEst:HS63, HS:63
2673false1falsetruehs64falsetruetruefalseothergeneral-InfInfmissingmissingunknownhttps://bitbucket.org/optrove/sif/src/master/HS64.SIFHock and Schittkowski problem number 64.\n\nclassification OOR2-AN-3-1\n\nclassification PPR2-AN-3-1\n\nA. Montoison, Montreal, 05/2018.\nproblem 64 in\nW. Hock and K. Schittkowski,\n"Test examples for nonlinear programming codes",\nLectures Notes in Economics and Mathematical Systems 187, Springer\nVerlag, Heidelberg, 1981.\n\nSIF input: N. Gould, Dec 1989.\n@book{HockSchittkowski1981,\n author = {Hock, W. and Schittkowski, K.},\n title = {Test Examples for Nonlinear Programming Codes},\n series = {Lecture Notes in Economics and Mathematical Systems},\n volume = {187},\n publisher = {Springer-Verlag},\n address = {Heidelberg},\n year = {1981}\n} \n CUTEst:HS64, HS:64
2683false1falsetruehs65falsetruetruefalseothergeneral-InfInfmissingmissingunknownhttps://bitbucket.org/optrove/sif/src/master/HS65.SIFHock and Schittkowski problem number 65.\n\nclassification QQR2-AN-3-1\n\nA. Montoison, Montreal, 05/2018.\nproblem 65 in\nW. Hock and K. Schittkowski,\n"Test examples for nonlinear programming codes",\nLectures Notes in Economics and Mathematical Systems 187, Springer\nVerlag, Heidelberg, 1981.\n\nSIF input: Ph. Toint and Nick Gould, June 1991.\n@book{HockSchittkowski1981,\n author = {Hock, W. and Schittkowski, K.},\n title = {Test Examples for Nonlinear Programming Codes},\n series = {Lecture Notes in Economics and Mathematical Systems},\n volume = {187},\n publisher = {Springer-Verlag},\n address = {Heidelberg},\n year = {1981}\n} \n CUTEst:HS65, HS:65
2693false2falsetruehs66falsetruetruefalseothergeneral-Inf0.58truemissingunknownhttps://bitbucket.org/optrove/sif/src/master/HS66.SIFHock and Schittkowski problem number 66.\n\nclassification LOR2-AN-3-2\n\nclassification LGR2-AN-3-2\n\nA. Montoison, Montreal, 05/2018.\nproblem 66 in\nW. Hock and K. Schittkowski,\n"Test examples for nonlinear programming codes",\nLectures Notes in Economics and Mathematical Systems 187, Springer\nVerlag, Heidelberg, 1981.\n\nSIF input: B Baudson, March 1990.\n@book{HockSchittkowski1981,\n author = {Hock, W. and Schittkowski, K.},\n title = {Test Examples for Nonlinear Programming Codes},\n series = {Lecture Notes in Economics and Mathematical Systems},\n volume = {187},\n publisher = {Springer-Verlag},\n address = {Heidelberg},\n year = {1981}\n} \n CUTEst:HS66, HS:66
2704false2falsetruehs68truefalsetruefalseothergeneral-InfInftruemissingunknownhttps://bitbucket.org/optrove/sif/src/master/HS68.SIFHock and Schittkowski problem number 68.\n\nThis is a cost optimal inspection plan.\n\nclassification OOR2-MN-4-2\n\nclassification GGR-P1-1\nOriginal source:\nE. von Collani, Kostenoptimale Prufplane bei laufender\nKontrolle eines normalverteilten Merkmals, Dissertation,\nInstitut fur Angewandte Mathematik und Statistik, Universitat Wurzburg, 1978.\n\nproblem 68 in\nW. Hock and K. Schittkowski,\n"Test examples for nonlinear programming codes",\nLectures Notes in Economics and Mathematical Systems 187, Springer\nVerlag, Heidelberg, 1981.\n\nSIF input: Nick Gould, August 1991.\n@book{HockSchittkowski1981,\n author = {Hock, W. and Schittkowski, K.},\n title = {Test Examples for Nonlinear Programming Codes},\n series = {Lecture Notes in Economics and Mathematical Systems},\n volume = {187},\n publisher = {Springer-Verlag},\n address = {Heidelberg},\n year = {1981}\n} \n CUTEst:HS68, HS:68
2714false2falsetruehs69truefalsetruefalseothergeneral-InfInftruemissingunknownhttps://bitbucket.org/optrove/sif/src/master/HS69.SIFHock and Schittkowski problem number 69.\n\nThis is a cost optimal inspection plan.\n\nclassification OOR2-MN-4-2\n\nclassification GGR-P1-2\nOriginal source:\nE. von Collani, Kostenoptimale Prufplane bei laufender\nKontrolle eines normalverteilten Merkmals, Dissertation,\nInstitut fur Angewandte Mathematik und Statistik, Universitat Wurzburg, 1978.\n\nproblem 69 in\nW. Hock and K. Schittkowski,\n"Test examples for nonlinear programming codes",\nLectures Notes in Economics and Mathematical Systems 187, Springer\nVerlag, Heidelberg, 1981.\n\nSIF input: Nick Gould, August 1991.\n@book{HockSchittkowski1981,\n author = {Hock, W. and Schittkowski, K.},\n title = {Test Examples for Nonlinear Programming Codes},\n series = {Lecture Notes in Economics and Mathematical Systems},\n volume = {187},\n publisher = {Springer-Verlag},\n address = {Heidelberg},\n year = {1981}\n} \n CUTEst:HS69, HS:69
2722false1falsetruehs7truefalsefalsefalseothergeneral-InfInfmissingmissingunknownhttps://bitbucket.org/optrove/sif/src/master/HS7.SIFHock and Schittkowski problem number 7.\n\nclassification OOR2-AN-2-1\n\nD. Orban, Montreal, 04/2016.\nproblem 7 in\nW. Hock and K. Schittkowski,\n"Test examples for nonlinear programming codes",\nLectures Notes in Economics and Mathematical Systems 187, Springer\nVerlag, Heidelberg, 1981.\n\nSIF input: A.R. Conn March 1990\n@book{HockSchittkowski1981,\n author = {Hock, W. and Schittkowski, K.},\n title = {Test Examples for Nonlinear Programming Codes},\n series = {Lecture Notes in Economics and Mathematical Systems},\n volume = {187},\n publisher = {Springer-Verlag},\n address = {Heidelberg},\n year = {1981}\n} \n CUTEst:HS7, HS:7
2734false1falsetruehs70falsetruetruefalseothergeneral-Inf0.987859truemissingunknownhttps://bitbucket.org/optrove/sif/src/master/HS70.SIFHock and Schittkowski problem number 70.\n\nThis problem arises in water flow routing.\n\nclassification SQR2-MN-4-1\n\nclassification SQR2-AN-4-1\n\nA. Montoison, Montreal, 05/2018.\nproblem 70 incorrectly stated in\nW. Hock and K. Schittkowski,\n"Test examples for nonlinear programming codes",\nLectures Notes in Economics and Mathematical Systems 187, Springer\nVerlag, Heidelberg, 1981.\n\nSIF input: Nick Gould, August 1991, modified May 2024\n@book{HockSchittkowski1981,\n author = {Hock, W. and Schittkowski, K.},\n title = {Test Examples for Nonlinear Programming Codes},\n series = {Lecture Notes in Economics and Mathematical Systems},\n volume = {187},\n publisher = {Springer-Verlag},\n address = {Heidelberg},\n year = {1981}\n} \n CUTEst:HS70, HS:70
2744false2falsetruehs71falsefalsetruefalseothergeneral-InfInfmissingmissingunknownhttps://bitbucket.org/optrove/sif/src/master/HS71.SIFHock and Schittkowski problem number 71.\n\nclassification OOR2-AY-4-2\n\nclassification PPR2-AN-4-2\n\nA. Montoison, Montreal, 05/2018.\nproblem 71 in\nW. Hock and K. Schittkowski,\n"Test examples for nonlinear programming codes",\nLectures Notes in Economics and Mathematical Systems 187, Springer\nVerlag, Heidelberg, 1981.\n\nSIF input: B Baudson, Apr 1989.\n@book{HockSchittkowski1981,\n author = {Hock, W. and Schittkowski, K.},\n title = {Test Examples for Nonlinear Programming Codes},\n series = {Lecture Notes in Economics and Mathematical Systems},\n volume = {187},\n publisher = {Springer-Verlag},\n address = {Heidelberg},\n year = {1981}\n} \n CUTEst:HS71, HS:71
2754false2falsetruehs72falsetruetruefalseothergeneral-InfInfmissingmissingunknownhttps://bitbucket.org/optrove/sif/src/master/HS72.SIFHock and Schittkowski problem number 72.\n\nAn optimal sample sizing problem.\n\nclassification LOR2-MN-4-2\n\nclassification LPR2-AN-4-2\n\nA. Montoison, Montreal, 05/2018.\nproblem 72 in\nW. Hock and K. Schittkowski,\n"Test examples for nonlinear programming codes",\nLectures Notes in Economics and Mathematical Systems 187, Springer\nVerlag, Heidelberg, 1981.\n\nSIF input: A.R. Conn, March 1990.\n@book{HockSchittkowski1981,\n author = {Hock, W. and Schittkowski, K.},\n title = {Test Examples for Nonlinear Programming Codes},\n series = {Lecture Notes in Economics and Mathematical Systems},\n volume = {187},\n publisher = {Springer-Verlag},\n address = {Heidelberg},\n year = {1981}\n} \n CUTEst:HS72, HS:72
2764false3falsetruehs73falsefalsetruefalseothergeneral-InfInfmissingmissingunknownhttps://bitbucket.org/optrove/sif/src/master/HS73.SIFHock and Schittkowski problem number 73.\n\nA cattle feed problem\n\nclassification LOR2-MN-4-3\n\nclassification LGI-AN-4-3\n\nA. Montoison, Montreal, 05/2018.\nproblem 73 in\nW. Hock and K. Schittkowski,\n"Test examples for nonlinear programming codes",\nLectures Notes in Economics and Mathematical Systems 187, Springer\nVerlag, Heidelberg, 1981.\n\nSIF input: B Debarsy, Apr 1990.\n@book{HockSchittkowski1981,\n author = {Hock, W. and Schittkowski, K.},\n title = {Test Examples for Nonlinear Programming Codes},\n series = {Lecture Notes in Economics and Mathematical Systems},\n volume = {187},\n publisher = {Springer-Verlag},\n address = {Heidelberg},\n year = {1981}\n} \n CUTEst:HS73, HS:73
2774false4falsetruehs74falsefalsetruefalseothergeneral-InfInfmissingmissingunknownhttps://bitbucket.org/optrove/sif/src/master/HS74.SIFHock and Schittkowski problem number 74.\n\nclassification OOR2-AY-4-5\n\nclassification PGR-AN-4-5\n\nA. Montoison, Montreal, 05/2018.\nproblem 74 in\nW. Hock and K. Schittkowski,\n"Test examples for nonlinear programming codes",\nLectures Notes in Economics and Mathematical Systems 187, Springer\nVerlag, Heidelberg, 1981.\n\nSIF input: B Debarsy, Apr 1990.\n@book{HockSchittkowski1981,\n author = {Hock, W. and Schittkowski, K.},\n title = {Test Examples for Nonlinear Programming Codes},\n series = {Lecture Notes in Economics and Mathematical Systems},\n volume = {187},\n publisher = {Springer-Verlag},\n address = {Heidelberg},\n year = {1981}\n} \n CUTEst:HS74, HS:74
2784false4falsetruehs75falsefalsetruefalseothergeneral-InfInfmissingmissingunknownhttps://bitbucket.org/optrove/sif/src/master/HS75.SIFHock and Schittkowski problem number 75.\n\nclassification OOR2-AY-4-5\n\nclassification PGR-AN-4-5\n\nA. Montoison, Montreal, 05/2018.\nproblem 75 in\nW. Hock and K. Schittkowski,\n"Test examples for nonlinear programming codes",\nLectures Notes in Economics and Mathematical Systems 187, Springer\nVerlag, Heidelberg, 1981.\n\nSIF input: B Debarsy, Apr 1990.\n@book{HockSchittkowski1981,\n author = {Hock, W. and Schittkowski, K.},\n title = {Test Examples for Nonlinear Programming Codes},\n series = {Lecture Notes in Economics and Mathematical Systems},\n volume = {187},\n publisher = {Springer-Verlag},\n address = {Heidelberg},\n year = {1981}\n} \n CUTEst:HS75, HS:75
2794false3falsetruehs76falsetruetruefalseotherlinear-Inf-1.25truemissingunknownhttps://bitbucket.org/optrove/sif/src/master/HS76.SIFHock and Schittkowski problem number 76.\n\nclassification QLR2-AN-4-3\n\nclassification QLR-AN-4-3\n\nA. Montoison, Montreal, 05/2018.\nproblem 76 in\nW. Hock and K. Schittkowski,\n"Test examples for nonlinear programming codes",\nLectures Notes in Economics and Mathematical Systems 187, Springer\nVerlag, Heidelberg, 1981.\n\nSIF input: A.R. Conn, March 1991.\n@book{HockSchittkowski1981,\n author = {Hock, W. and Schittkowski, K.},\n title = {Test Examples for Nonlinear Programming Codes},\n series = {Lecture Notes in Economics and Mathematical Systems},\n volume = {187},\n publisher = {Springer-Verlag},\n address = {Heidelberg},\n year = {1981}\n} \n CUTEst:HS76, HS:76
2805false2falsetruehs77truefalsefalsefalseothergeneral-InfInfmissingmissingunknownhttps://bitbucket.org/optrove/sif/src/master/HS77.SIFHock and Schittkowski problem number 77.\n\nclassification OOR2-AY-5-2\n\nclassification PGR-AN-5-2\n\nA. Montoison, Montreal, 05/2018.\nproblem 77 in\nW. Hock and K. Schittkowski,\n"Test examples for nonlinear programming codes",\nLectures Notes in Economics and Mathematical Systems 187, Springer\nVerlag, Heidelberg, 1981.\n\nSIF input: A. Conn and Ph. Toint, March 1991\n@book{HockSchittkowski1981,\n author = {Hock, W. and Schittkowski, K.},\n title = {Test Examples for Nonlinear Programming Codes},\n series = {Lecture Notes in Economics and Mathematical Systems},\n volume = {187},\n publisher = {Springer-Verlag},\n address = {Heidelberg},\n year = {1981}\n} \n CUTEst:HS77, HS:77
2815false3falsetruehs78truefalsefalsefalseothergeneral-InfInfmissingmissingunknownhttps://bitbucket.org/optrove/sif/src/master/HS78.SIFHock and Schittkowski problem number 78.\n\nclassification OOR2-AN-5-3\n\nclassification PPR-AN-5-3\n\nA. Montoison, Montreal, 05/2018.\nproblem 78 in\nW. Hock and K. Schittkowski,\n"Test examples for nonlinear programming codes",\nLectures Notes in Economics and Mathematical Systems 187, Springer\nVerlag, Heidelberg, 1981.\n\nSIF input: B.Debarsy, Jan 1990.\n@book{HockSchittkowski1981,\n author = {Hock, W. and Schittkowski, K.},\n title = {Test Examples for Nonlinear Programming Codes},\n series = {Lecture Notes in Economics and Mathematical Systems},\n volume = {187},\n publisher = {Springer-Verlag},\n address = {Heidelberg},\n year = {1981}\n} \n CUTEst:HS78, HS:78
2825false3falsetruehs79truefalsefalsefalseothergeneral-InfInfmissingmissingunknownhttps://bitbucket.org/optrove/sif/src/master/HS79.SIFHock and Schittkowski problem number 79.\n\nclassification OOR2-AY-5-3\n\nclassification PPR-AN-5-3\n\nA. Montoison, Montreal, 05/2018.\nproblem 79 in\nW. Hock and K. Schittkowski,\n"Test examples for nonlinear programming codes",\nLectures Notes in Economics and Mathematical Systems 187, Springer\nVerlag, Heidelberg, 1981.\n\nSIF input: B Debarsy, Apr 1990.\n@book{HockSchittkowski1981,\n author = {Hock, W. and Schittkowski, K.},\n title = {Test Examples for Nonlinear Programming Codes},\n series = {Lecture Notes in Economics and Mathematical Systems},\n volume = {187},\n publisher = {Springer-Verlag},\n address = {Heidelberg},\n year = {1981}\n} \n CUTEst:HS79, HS:79
2832false2falsetruehs8truefalsefalsefalseothergeneral-InfInfmissingmissingunknownhttps://bitbucket.org/optrove/sif/src/master/HS8.SIFHock and Schittkowski problem number 8.\n\nclassification CQR2-AN-2-2\n\nclassification OOR2-AN-2-1\n\nD. Orban, Montreal, 04/2016.\nproblem 8 in\nW. Hock and K. Schittkowski,\n"Test examples for nonlinear programming codes",\nLectures Notes in Economics and Mathematical Systems 187, Springer\nVerlag, Heidelberg, 1981.\n\nSIF input: A.R. Conn March 1990\n@book{HockSchittkowski1981,\n author = {Hock, W. and Schittkowski, K.},\n title = {Test Examples for Nonlinear Programming Codes},\n series = {Lecture Notes in Economics and Mathematical Systems},\n volume = {187},\n publisher = {Springer-Verlag},\n address = {Heidelberg},\n year = {1981}\n} \n CUTEst:HS8, HS:8
2845false3falsetruehs80truefalsetruefalseothergeneral-InfInfmissingmissingunknownhttps://bitbucket.org/optrove/sif/src/master/HS80.SIFHock and Schittkowski problem number 80.\n\nclassification OOR2-AN-5-3\n\nclassification GPR-AN-5-3\n\nA. Montoison, Montreal, 05/2018.\nproblem 80 in\nW. Hock and K. Schittkowski,\n"Test examples for nonlinear programming codes",\nLectures Notes in Economics and Mathematical Systems 187, Springer\nVerlag, Heidelberg, 1981.\n\nSIF input: B.Debarsy, Jan 1990.\n@book{HockSchittkowski1981,\n author = {Hock, W. and Schittkowski, K.},\n title = {Test Examples for Nonlinear Programming Codes},\n series = {Lecture Notes in Economics and Mathematical Systems},\n volume = {187},\n publisher = {Springer-Verlag},\n address = {Heidelberg},\n year = {1981}\n} \n CUTEst:HS80, HS:80
2855false3falsetruehs81truefalsetruefalseothergeneral-InfInfmissingmissingunknownhttps://bitbucket.org/optrove/sif/src/master/HS81.SIFHock and Schittkowski problem number 81.\n\nclassification OOR2-AN-5-3\n\nclassification GPR-AN-5-3\n\nA. Montoison, Montreal, 05/2018.\nProblem 81 in\n W. Hock and K. Schittkowski,\n Test examples for nonlinear programming codes,\n Lectures Notes in Economics and Mathematical Systems 187,\n Springer Verlag, Heidelberg, 1981.\n\nproblem 80 in\nW. Hock and K. Schittkowski,\n"Test examples for nonlinear programming codes",\nLectures Notes in Economics and Mathematical Systems 187, Springer\nVerlag, Heidelberg, 1981.\n\nSIF input: B.Debarsy, Jan 1990.\n@book{HockSchittkowski1981,\n author = {Hock, W. and Schittkowski, K.},\n title = {Test Examples for Nonlinear Programming Codes},\n series = {Lecture Notes in Economics and Mathematical Systems},\n volume = {187},\n publisher = {Springer-Verlag},\n address = {Heidelberg},\n year = {1981}\n} \n CUTEst:HS81, HS:81
2865false3falsetruehs83falsetruetruefalseothergeneral-InfInfmissingmissingunknownhttps://bitbucket.org/optrove/sif/src/master/HS83.SIFHock and Schittkowski problem number 83.\n\nclassification QQR2-AN-5-3\n\nclassification QQR-AN-5-3\n\nA. Montoison, Montreal, 05/2018.\nproblem 83 in\nW. Hock and K. Schittkowski,\n"Test examples for nonlinear programming codes",\nLectures Notes in Economics and Mathematical Systems 187, Springer\nVerlag, Heidelberg, 1981.\n\nSIF input: B Baudson, Apr 1989.\n@book{HockSchittkowski1981,\n author = {Hock, W. and Schittkowski, K.},\n title = {Test Examples for Nonlinear Programming Codes},\n series = {Lecture Notes in Economics and Mathematical Systems},\n volume = {187},\n publisher = {Springer-Verlag},\n address = {Heidelberg},\n year = {1981}\n} \n CUTEst:HS83, HS:83
2875false3falsetruehs84falsetruetruefalseothergeneral-Inf-2.35124e6truemissingunknownhttps://bitbucket.org/optrove/sif/src/master/HS84.SIFHock and Schittkowski problem number 84.\n\nclassification QQR2-AN-5-3\n\nclassification QQR-AN-5-3\n\nA. Montoison, Montreal, 05/2018.\nproblem 84 in\nW. Hock and K. Schittkowski,\n"Test examples for nonlinear programming codes",\nLectures Notes in Economics and Mathematical Systems 187, Springer\nVerlag, Heidelberg, 1981.\n\nSIF input: A.R. Conn, March 1991.\n@book{HockSchittkowski1981,\n author = {Hock, W. and Schittkowski, K.},\n title = {Test Examples for Nonlinear Programming Codes},\n series = {Lecture Notes in Economics and Mathematical Systems},\n volume = {187},\n publisher = {Springer-Verlag},\n address = {Heidelberg},\n year = {1981}\n} \n CUTEst:HS84, HS:84
2885false10falsetruehs86falsetruetruefalseotherlinear-Inf20.0truemissingunknownhttps://bitbucket.org/optrove/sif/src/master/HS86.SIFHock and Schittkowski problem number 86.\n\nclassification OLR2-AN-5-10\n\nclassification PLR-AN-5-10\n\nA. Montoison, Montreal, 05/2018.\nproblem 86 in\nW. Hock and K. Schittkowski,\n"Test examples for nonlinear programming codes",\nLectures Notes in Economics and Mathematical Systems 187, Springer\nVerlag, Heidelberg, 1981.\n\nSIF input: Nick Gould, August 1991.\n@book{HockSchittkowski1981,\n author = {Hock, W. and Schittkowski, K.},\n title = {Test Examples for Nonlinear Programming Codes},\n series = {Lecture Notes in Economics and Mathematical Systems},\n volume = {187},\n publisher = {Springer-Verlag},\n address = {Heidelberg},\n year = {1981}\n} \n CUTEst:HS86, HS:86
2896false4falsetruehs87truefalsetruefalseothergeneral-InfInftruemissingunknownhttps://bitbucket.org/optrove/sif/src/master/HS87.SIFHock and Schittkowski problem number 87.\n\nOptimization of an electrical network (EDF) by P. Huard.\n\nclassification OOI2-MN-6-4\n\nclassification PLR-AN-5-10\nproblem 87 in\nW. Hock and K. Schittkowski,\n"Test examples for nonlinear programming codes",\nLectures Notes in Economics and Mathematical Systems 187, Springer\nVerlag, Heidelberg, 1981.\nNote: There are two variants described in the papers\nD.H. Himmelblau "Applied nonlinear programming",\nMcGraw-Hill, New-York, 1972, problem 15,\nand\nA.R. Colville, "A comparative study on nonlinear programming",\nIBM Scientific Center Report 320-2949, New York, 1968, problem 6.\n\nSIF input: Nick Gould, August 1991.\n@book{HockSchittkowski1981,\n author = {Hock, W. and Schittkowski, K.},\n title = {Test Examples for Nonlinear Programming Codes},\n series = {Lecture Notes in Economics and Mathematical Systems},\n volume = {187},\n publisher = {Springer-Verlag},\n address = {Heidelberg},\n year = {1981}\n} \n CUTEst:HS87, HS:87
2902false1falsetruehs9truefalsefalsefalseotherlinear-Inf0.0truemissingunknownhttps://bitbucket.org/optrove/sif/src/master/HS9.SIFHock and Schittkowski problem number 9.\n\nclassification OLR2-AN-2-1\n\nA. Cebola, Curitiba , 10/2016.\nproblem 9 in\nW. Hock and K. Schittkowski,\n"Test examples for nonlinear programming codes",\nLectures Notes in Economics and Mathematical Systems 187, Springer\nVerlag, Heidelberg, 1981.\n\nSIF input: A.R. Conn March 1990\n@book{HockSchittkowski1981,\n author = {Hock, W. and Schittkowski, K.},\n title = {Test Examples for Nonlinear Programming Codes},\n series = {Lecture Notes in Economics and Mathematical Systems},\n volume = {187},\n publisher = {Springer-Verlag},\n address = {Heidelberg},\n year = {1981}\n} \n CUTEst:HS9, HS:9
2916false2falsetruehs93falsetruetruefalseothergeneral-Inf137.066truemissingunknownhttps://bitbucket.org/optrove/sif/src/master/HS93.SIFHock and Schittkowski problem number 93.\n\nA transformer design problem.\n\nclassification OOR2-MY-6-2\n\nclassification PPR-AN-6-2\n\nA. Montoison, Montreal, 05/2018.\nproblem 93 in\nW. Hock and K. Schittkowski,\n"Test examples for nonlinear programming codes",\nLectures Notes in Economics and Mathematical Systems 187, Springer\nVerlag, Heidelberg, 1981.\n\nSIF input: Nick Gould, August 1991.\n@book{HockSchittkowski1981,\n author = {Hock, W. and Schittkowski, K.},\n title = {Test Examples for Nonlinear Programming Codes},\n series = {Lecture Notes in Economics and Mathematical Systems},\n volume = {187},\n publisher = {Springer-Verlag},\n address = {Heidelberg},\n year = {1981}\n} \n CUTEst:HS93, HS:93
2926false4falsetruehs95falsetruetruefalseothergeneral-InfInfmissingmissingunknownhttps://bitbucket.org/optrove/sif/src/master/HS95.SIFHock and Schittkowski problem number 95.\n\nclassification LQR2-AN-6-4\n\nclassification PPR-AN-6-4\n\nA. Montoison, Montreal, 05/2018.\nproblem 95 in\nW. Hock and K. Schittkowski,\n"Test examples for nonlinear programming codes",\nLectures Notes in Economics and Mathematical Systems 187, Springer\nVerlag, Heidelberg, 1981.\n\nSIF input: Ph. Toint, April 1991.\n@book{HockSchittkowski1981,\n author = {Hock, W. and Schittkowski, K.},\n title = {Test Examples for Nonlinear Programming Codes},\n series = {Lecture Notes in Economics and Mathematical Systems},\n volume = {187},\n publisher = {Springer-Verlag},\n address = {Heidelberg},\n year = {1981}\n} \n CUTEst:HS95, HS:95
2936false4falsetruehs96falsetruetruefalseothergeneral-InfInfmissingmissingunknownhttps://bitbucket.org/optrove/sif/src/master/HS96.SIFHock and Schittkowski problem number 96.\n\nclassification LQR2-AN-6-4\n\nclassification PPR-AN-6-4\n\nA. Montoison, Montreal, 05/2018.\nproblem 96 in\nW. Hock and K. Schittkowski,\n"Test examples for nonlinear programming codes",\nLectures Notes in Economics and Mathematical Systems 187, Springer\nVerlag, Heidelberg, 1981.\n\nSIF input: Ph. Toint, April 1991.\n@book{HockSchittkowski1981,\n author = {Hock, W. and Schittkowski, K.},\n title = {Test Examples for Nonlinear Programming Codes},\n series = {Lecture Notes in Economics and Mathematical Systems},\n volume = {187},\n publisher = {Springer-Verlag},\n address = {Heidelberg},\n year = {1981}\n} \n CUTEst:HS96, HS:96
2946false4falsetruehs97falsetruetruefalseothergeneral-InfInfmissingmissingunknownhttps://bitbucket.org/optrove/sif/src/master/HS97.SIFHock and Schittkowski problem number 97.\n\nclassification LQR2-AN-6-4\n\nclassification PPR-AN-6-4\n\nA. Montoison, Montreal, 05/2018.\nproblem 97 in\nW. Hock and K. Schittkowski,\n"Test examples for nonlinear programming codes",\nLectures Notes in Economics and Mathematical Systems 187, Springer\nVerlag, Heidelberg, 1981.\n\nSIF input: Ph. Toint, April 1991.\n@book{HockSchittkowski1981,\n author = {Hock, W. and Schittkowski, K.},\n title = {Test Examples for Nonlinear Programming Codes},\n series = {Lecture Notes in Economics and Mathematical Systems},\n volume = {187},\n publisher = {Springer-Verlag},\n address = {Heidelberg},\n year = {1981}\n} \n CUTEst:HS97, HS:97
2956false4falsetruehs98falsetruetruefalseothergeneral-InfInfmissingmissingunknownhttps://bitbucket.org/optrove/sif/src/master/HS98.SIFHock and Schittkowski problem number 98.\n\nclassification LQR2-AN-6-4\n\nclassification PPR-AN-6-4\n\nA. Montoison, Montreal, 05/2018.\nproblem 98 in\nW. Hock and K. Schittkowski,\n"Test examples for nonlinear programming codes",\nLectures Notes in Economics and Mathematical Systems 187, Springer\nVerlag, Heidelberg, 1981.\n\nSIF input: Ph. Toint, April 1991.\n@book{HockSchittkowski1981,\n author = {Hock, W. and Schittkowski, K.},\n title = {Test Examples for Nonlinear Programming Codes},\n series = {Lecture Notes in Economics and Mathematical Systems},\n volume = {187},\n publisher = {Springer-Verlag},\n address = {Heidelberg},\n year = {1981}\n} \n CUTEst:HS98, HS:98
2967false2falsetruehs99truefalsetruefalseothergeneral-InfInfmissingmissingunknownhttps://bitbucket.org/optrove/sif/src/master/HS99.SIFHock and Schittkowski problem number 99.\n\nclassification OOR2-AN-7-2\n\nclassification PPR-AN-6-4\nproblem 99 in\nW. Hock and K. Schittkowski,\n"Test examples for nonlinear programming codes",\nLectures Notes in Economics and Mathematical Systems 187, Springer\nVerlag, Heidelberg, 1981.\n\nSIF input: Ph. Toint, April 1991.\n@book{HockSchittkowski1981,\n author = {Hock, W. and Schittkowski, K.},\n title = {Test Examples for Nonlinear Programming Codes},\n series = {Lecture Notes in Economics and Mathematical Systems},\n volume = {187},\n publisher = {Springer-Verlag},\n address = {Heidelberg},\n year = {1981}\n} \n CUTEst:HS99, HS:99
297100true0falsetrueindef_modfalsefalsefalsefalseotherunconstrained-Inf91.6655truemissingunknownhttp://www.cs.cas.cz/matonoha/download/V1081.pdfProblem 37 in\nL. Luksan, C. Matonoha and J. Vlcek\nModified CUTE problems for sparse unconstrained optimization,\nTechnical Report 1081,\nInstitute of Computer Science,\nAcademy of Science of the Czech Republic\nhttp://www.cs.cas.cz/matonoha/download/V1081.pdf\n\nbased on the original problem by N. Gould\n\nclassification OUR2-AN-V-0\n\nJ.-P. Dussault, Clermont-Ferrand 05/2016.\n\n@techreport{LuksanMatonohaVlcek2003,\n author = {Luksan, Ladislav and Matonoha, Cestmir and Vlcek, Jan},\n title = {Modified {CUTE} Problems for Sparse Unconstrained Optimization},\n institution = {Institute of Computer Science, Academy of Sciences of the Czech Republic},\n number = {1081},\n year = {2003},\n address = {Prague, Czech Republic},\n url = {http://www.cs.cas.cz/matonoha/download/V1081.pdf},\n} \n Luksan:37
298100true0falsetrueintegreqfalsefalsefalsefalseleast_squaresunconstrained-Inf0.0truemissingunknownhttps://bitbucket.org/optrove/sif/src/master/INTEGREQ.SIFThe discrete integral problem.\n\nclassification NOR2-AN-V-V\nproblem 165 (p. 74) in\n A.R. Buckley,\n "Test functions for unconstrained minimization",\n TR 1989CS-3, Mathematics, statistics and computing centre,\n Dalhousie University, Halifax (CDN), 1989.\n\nProblem 29 in\nJ.J. More', B.S. Garbow and K.E. Hillstrom,\n"Testing Unconstrained Optimization Software",\nACM Transactions on Mathematical Software, vol. 7(1), pp. 17-41, 1981.\n\nSIF input: Ph. Toint, Feb 1990.\n@article{MoreGarbowHillstrom1981,\n author = {Mor{\\'e}, Jorge J. and Garbow, Burton S. and Hillstrom, Kenneth E.},\n title = {Testing Unconstrained Optimization Software},\n journal = {ACM Transactions on Mathematical Software},\n year = {1981},\n volume = {7},\n number = {1},\n pages = {17--41},\n doi = {10.1145/355934.355936}\n} \n CUTEst:INTEGREQ
2992false0falsetruejennrichsampsonfalsefalsefalsefalseleast_squaresunconstrained-Inf4171.31truemissingunknownhttps://doi.org/10.1145/355934.355936\nproblem 6 in\nJ.J. More', B.S. Garbow and K.E. Hillstrom,\n"Testing Unconstrained Optimization Software",\nACM Transactions on Mathematical Software, vol. 7(1), pp. 17-41, 1981.\n@article{MoreGarbowHillstrom1981,\n author = {Mor{\\'e}, Jorge J. and Garbow, Burton S. and Hillstrom, Kenneth E.},\n title = {Testing Unconstrained Optimization Software},\n journal = {ACM Transactions on Mathematical Software},\n year = {1981},\n volume = {7},\n number = {1},\n pages = {17--41},\n doi = {10.1145/355934.355936}\n} \n MGH:6
3005false0falsetruekirby2falsefalsefalsefalseleast_squaresunconstrained-Inf500.0truemissingunknownhttps://bitbucket.org/optrove/sif/src/master/KIRBY2.SIFhttps://www.itl.nist.gov/div898/strd/nls/data/LINKS/DATA/kirby2.dat\n\nNIST/ITL StRD\nDataset Name: Kirby2 (Kirby2.dat)\n\nFile Format: ASCII\n Starting Values (lines 41 to 45)\n Certified Values (lines 41 to 50)\n Data (lines 61 to 211)\n\nProcedure: Nonlinear Least Squares Regression\n\nDescription: These data are the result of a NIST study involving\n scanning electron microscope line with standards.\n\nReference: Kirby, R., NIST (197?). \n Scanning electron microscope line width standards.\n\nData: 1 Response (y)\n 1 Predictor (x)\n 151 Observations\n Average Level of Difficulty\n Observed Data\n\nModel: Rational Class (quadratic/quadratic)\n 5 Parameters (b1 to b5)\n\n y = (b1 + b2*x + b3*x**2) /\n (1 + b4*x + b5*x**2) + e\n\nT. Migot, Montreal, 2023.\n\nNIST Data fitting problem KIRBY2 given as an inconsistent set of\nnonlinear equations.\nFit: y = (b1 + b2*x + b3*x**2) /(1 + b4*x + b5*x**2) + e\n\nclassification NOR2-MN-5-151\nProblem from the NIST nonlinear regression test set\nhttp://www.itl.nist.gov/div898/strd/nls/nls_main.shtml\nReference: Kirby, R., NIST (197?). \nScanning electron microscope line width standards.\n\nSIF input: Nick Gould and Tyrone Rees, Oct 2015\n@misc{NISTStRD,\n author = {{National Institute of Standards and Technology}},\n title = {{NIST/ITL StRD}: Nonlinear Regression Reference Datasets},\n howpublished = {\\url{https://www.itl.nist.gov/div898/strd/nls/nls_main.shtml}},\n year = {1997}\n}\nCUTEst:KIRBY2, NIST:Kirby2
3014false0falsetruekowosbfalsefalsefalsefalseleast_squaresunconstrained-Inf0.0264978truemissingunknownhttps://bitbucket.org/optrove/sif/src/master/KOWOSB.SIFA problem arising in the analysis of kinetic data for an enzyme\nreaction, known under the name of Kowalik and Osborne problem\nin 4 variables.\n\nclassification SUR2-MN-4-0\nProblem 15 in\nJ.J. More', B.S. Garbow and K.E. Hillstrom,\n"Testing Unconstrained Optimization Software",\nACM Transactions on Mathematical Software, vol. 7(1), pp. 17-41, 1981.\n\nSIF input: Ph. Toint, Dec 1989.\n@article{MoreGarbowHillstrom1981,\n author = {Mor{\\'e}, Jorge J. and Garbow, Burton S. and Hillstrom, Kenneth E.},\n title = {Testing Unconstrained Optimization Software},\n journal = {ACM Transactions on Mathematical Software},\n year = {1981},\n volume = {7},\n number = {1},\n pages = {17--41},\n doi = {10.1145/355934.355936}\n} \n CUTEst:KOWOSB
3026false0falsetruelanczos1falsefalsefalsefalseleast_squaresunconstrained-Inf500.0truemissingunknownhttps://bitbucket.org/optrove/sif/src/master/LANCZOS1.SIFhttps://www.itl.nist.gov/div898/strd/nls/data/LINKS/DATA/lanczos1.dat\n\nNIST/ITL StRD\nDataset Name: lanczos1 (lanczos1.dat)\n\nFile Format: ASCII\n Starting Values (lines 41 to 42)\n Certified Values (lines 41 to 47)\n Data (lines 61 to 74)\n\nProcedure: Nonlinear Least Squares Regression\n\nDescription: These data are the result of a NIST study regarding\n dental research in monomolecular adsorption. The\n response variable is volume, and the predictor\n variable is pressure.\n\nReference: Misra, D., NIST (1978). \n Dental Research Monomolecular Adsorption Study.\n\nData: 1 Response Variable (y = volume)\n 1 Predictor Variable (x = pressure)\n 14 Observations\n Lower Level of Difficulty\n Observed Data\n\nModel: Exponential Class\n 2 Parameters (b1 and b2)\n\n y = b1*(1-exp[-b2*x]) + e\nT. Migot, Montreal, 2023.\n\nNIST Data fitting problem LANCZOS1 given as an inconsistent set of\nnonlinear equations.\nFit: y = b1*exp(-b2*x) + b3*exp(-b4*x) + b5*exp(-b6*x) + e\n\nclassification NOR2-MN-6-24\nProblem from the NIST nonlinear regression test set\nhttp://www.itl.nist.gov/div898/strd/nls/nls_main.shtml\nReference: Lanczos, C. (1956).\nApplied Analysis. Englewood Cliffs, NJ: Prentice Hall, pp. 272-280.\n\nSIF input: Nick Gould and Tyrone Rees, Oct 2015\n@book{Lanczos1956,\n author = {Lanczos, Cornelius},\n title = {Applied Analysis},\n publisher = {Prentice Hall},\n address = {Englewood Cliffs, NJ},\n year = {1956}\n}\nCUTEst:LANCZOS1, NIST:lanczos1
3036false0falsetruelanczos2falsefalsefalsefalseleast_squaresunconstrained-Inf500.0truemissingunknownhttps://bitbucket.org/optrove/sif/src/master/LANCZOS2.SIFhttps://www.itl.nist.gov/div898/strd/nls/data/LINKS/DATA/lanczos2.dat\n\nDataset Name: Lanczos2 (Lanczos2.dat)\n\nFile Format: ASCII\n Starting Values (lines 41 to 46)\n Certified Values (lines 41 to 51)\n Data (lines 61 to 84)\n\nProcedure: Nonlinear Least Squares Regression\n\nDescription: These data are taken from an example discussed in\n Lanczos (1956). The data were generated to 6-digits\n of accuracy using\n f(x) = 0.0951*exp(-x) + 0.8607*exp(-3*x) \n + 1.5576*exp(-5*x).\n\nReference: Lanczos, C. (1956).\n Applied Analysis.\n Englewood Cliffs, NJ: Prentice Hall, pp. 272-280.\n\nData: 1 Response (y)\n 1 Predictor (x)\n 24 Observations\n Average Level of Difficulty\n Generated Data\n\nModel: Exponential Class\n 6 Parameters (b1 to b6)\n\n y = b1*exp(-b2*x) + b3*exp(-b4*x) + b5*exp(-b6*x) + e\nT. Migot, Montreal, 2023.\n\nNIST Data fitting problem LANCZOS2 given as an inconsistent set of\nnonlinear equations.\nFit: y = b1*exp(-b2*x) + b3*exp(-b4*x) + b5*exp(-b6*x) + e\n\nclassification NOR2-MN-6-24\nProblem from the NIST nonlinear regression test set\nhttp://www.itl.nist.gov/div898/strd/nls/nls_main.shtml\nReference: Lanczos, C. (1956).\nApplied Analysis. Englewood Cliffs, NJ: Prentice Hall, pp. 272-280.\n\nSIF input: Nick Gould and Tyrone Rees, Oct 2015\n@book{Lanczos1956,\n author = {Lanczos, Cornelius},\n title = {Applied Analysis},\n publisher = {Prentice Hall},\n address = {Englewood Cliffs, NJ},\n year = {1956}\n}\nCUTEst:LANCZOS2, NIST:Lanczos2
3046false0falsetruelanczos3falsefalsefalsefalseleast_squaresunconstrained-Inf500.0truemissingunknownhttps://bitbucket.org/optrove/sif/src/master/LANCZOS3.SIFhttps://www.itl.nist.gov/div898/strd/nls/data/LINKS/DATA/lanczos3.dat\n\nNIST/ITL StRD\nDataset Name: Lanczos3 (Lanczos3.dat)\n\nFile Format: ASCII\n Starting Values (lines 41 to 46)\n Certified Values (lines 41 to 51)\n Data (lines 61 to 84)\n\nProcedure: Nonlinear Least Squares Regression\n\nDescription: These data are taken from an example discussed in\n Lanczos (1956). The data were generated to 5-digits\n of accuracy using\n f(x) = 0.0951*exp(-x) + 0.8607*exp(-3*x) \n + 1.5576*exp(-5*x).\n\nReference: Lanczos, C. (1956).\n Applied Analysis.\n Englewood Cliffs, NJ: Prentice Hall, pp. 272-280.\n\nData: 1 Response (y)\n 1 Predictor (x)\n 24 Observations\n Lower Level of Difficulty\n Generated Data\n\nModel: Exponential Class\n 6 Parameters (b1 to b6)\n\n y = b1*exp(-b2*x) + b3*exp(-b4*x) + b5*exp(-b6*x) + e\nT. Migot, Montreal, 2023.\n\nNIST Data fitting problem LANCZOS3 given as an inconsistent set of\nnonlinear equations.\nFit: y = b1*exp(-b2*x) + b3*exp(-b4*x) + b5*exp(-b6*x) + e\n\nclassification NOR2-MN-6-24\nProblem from the NIST nonlinear regression test set\nhttp://www.itl.nist.gov/div898/strd/nls/nls_main.shtml\nReference: Lanczos, C. (1956).\nApplied Analysis. Englewood Cliffs, NJ: Prentice Hall, pp. 272-280.\n\nSIF input: Nick Gould and Tyrone Rees, Oct 2015\n@book{Lanczos1956,\n author = {Lanczos, Cornelius},\n title = {Applied Analysis},\n publisher = {Prentice Hall},\n address = {Englewood Cliffs, NJ},\n year = {1956}\n}\nCUTEst:LANCZOS3, NIST:Lanczos3
305100true0falsetrueliarwhdfalsefalsefalsefalseotherunconstrained-Inf58500.0truemissingunknownhttps://bitbucket.org/optrove/sif/src/master/LIARWHD.SIFG. Li,\n"The secant/finite difference algorithm for solving sparse\nnonlinear systems of equations",\nSIAM Journal on Optimization, (to appear), 1990.\n\nclassification SUR2-AN-V-0\n\nThis is a simplified version of problem NONDIA.\n\nProblem 38 in\nL. Luksan, C. Matonoha and J. Vlcek\nModified CUTE problems for sparse unconstrained optimization,\nTechnical Report 1081,\nInstitute of Computer Science,\nAcademy of Science of the Czech Republic\nhttp://www.cs.cas.cz/matonoha/download/V1081.pdf\n\nbased on the original problem by N. Gould\n\nclassification OUR2-AN-V-0\n\nJ.-P. Dussault, Clermont-Ferrand 05/2016.\nG. Li,\n"The secant/finite difference algorithm for solving sparse\nnonlinear systems of equations",\nSIAM Journal on Optimization, (to appear), 1990.\n\nSIF input: Ph. Toint, Aug 1990.\n@article{Li1988SIAMJNA,\n author = {Li, Guangye},\n title = {The Secant/Finite Difference Algorithm for Solving Sparse Nonlinear Systems of Equations},\n journal = {SIAM Journal on Numerical Analysis},\n year = {1988},\n volume = {25},\n number = {5},\n pages = {1181--1196},\n doi = {10.1137/0725067}\n} \n CUTEst:LIARWHD, Luksan:38
30615false11falsetruelinconfalsefalsefalsefalseotherlinear-InfInfmissingmissingunknownhttps://github.com/JuliaSmoothOptimizers/NLPModelsTest.jl\nTest problem used in NLPModelsTest.jl.\n@misc{NLPModelsTestjl,\n author = {{JuliaSmoothOptimizers}},\n title = {{NLPModelsTest.jl}: Tests for Nonlinear Programming Models},\n howpublished = {\\url{https://github.com/JuliaSmoothOptimizers/NLPModelsTest.jl}},\n year = {2020}\n}\n
3072false2falsetruelinsvfalsetruefalsefalseotherlinear-InfInfmissingmissingunknownhttps://github.com/JuliaSmoothOptimizers/NLPModelsTest.jl\nTest problem used in NLPModelsTest.jl.\n@misc{NLPModelsTestjl,\n author = {{JuliaSmoothOptimizers}},\n title = {{NLPModelsTest.jl}: Tests for Nonlinear Programming Models},\n howpublished = {\\url{https://github.com/JuliaSmoothOptimizers/NLPModelsTest.jl}},\n year = {2020}\n}\n
308111true40truetruemarinetruefalsetruefalseothergeneral-InfInfmissingmissingunknownhttps://bitbucket.org/optrove/sif/src/master/MARINE.SIFMarine Population Dynamics Problem\n Collocation formulation\n\n Given observations of ns stages of a marine species over n timesteps, \n minimize the loss between the observation and the computed law of paraneters : growth, mortality and number of specimens (g,m,x)\n\nclassification OOR2-AN-V-V\nThis is problem 6 in the COPS (Version 3) collection of \nE. Dolan and J. More'\nsee "Benchmarking Optimization Software with COPS"\nArgonne National Labs Technical Report ANL/MCS-246 (2004)\n\nAlexander S. Bondarenko - Summer 1998\nCOPS 2.0 - September 2000\nCOPS 3.0 - November 2002\nCOPS 3.1 - March 2004\n\nSIF input: Nick Gould, November 2000\n@techreport{DolanMore2004COPS,\n author = {Dolan, Elizabeth D. and Mor{'e}, Jorge J.},\n title = {Benchmarking Optimization Software with {COPS} 3.0},\n institution = {Argonne National Laboratory},\n number = {ANL/MCS-TM-273},\n year = {2004},\n doi = {10.2172/834714}\n }\n CUTEst:MARINE, COPS:6
3093005true3000truetruemethanoltruefalsetruefalseothergeneral-InfInfmissingmissingunknownhttps://bitbucket.org/optrove/sif/src/master/METHANOL.SIFMethanol-to-Hydrocarbons Problem\nCollocation formulation\n\nDetermine the reaction coefficients for the conversion of methanol into\nvarious hydrocarbons. The nonlinear model that describes the process is\ny_1' = - (2 theta_2 + theta_3 + theta_4 - theta_1 y_2 / d ) y_1\ny_2' = theta_3 y_1 + theta_1 y_1 ( theta_1 y_1 - y_2 ) / d\ny_3' = theta_4 y_1 + theta_1 y_1 ( theta_5 y_1 + y_2 ) / d\nwhere d = (theta_2 + theta_5) y_1 + y_2 and the theta_i are positive,\nwith given initial conditions. The problem is to minimize\nsum{i=1,16} || y(tau_i,theta) - z_i||^2\nwhere the z_i are concentration measurements for y at times tau_i (i=1,16)\n\nclassification OOR2-AN-V-V\nThis is problem 13 in the COPS (Version 2) collection of \nE. Dolan and J. More'\nsee "Benchmarking Optimization Software with COPS"\nArgonne National Labs Technical Report ANL/MCS-246 (2000)\n\nMichael Merritt - Summer 2000\nCOPS 2.0 - September 2000\nCOPS 3.0 - November 2002\nCOPS 3.1 - March 2004\n\nSIF input: Nick Gould, November 2000\n@techreport{DolanMore2004COPS,\n author = {Dolan, Elizabeth D. and Mor{'e}, Jorge J.},\n title = {Benchmarking Optimization Software with {COPS} 3.0},\n institution = {Argonne National Laboratory},\n number = {ANL/MCS-TM-273},\n year = {2004},\n doi = {10.2172/834714}\n }\n CUTEst:METHANOL, COPS:13
3103false0falsetruemeyer3falsefalsefalsefalseleast_squaresunconstrained-Inf1.69361e9truemissingunknownhttps://bitbucket.org/optrove/sif/src/master/MEYER3.SIFMeyer function\n\nclassification SUR2-RN-3-0\nProblem 10 in\nJ.J. More', B.S. Garbow and K.E. Hillstrom,\n"Testing Unconstrained Optimization Software",\nACM Transactions on Mathematical Software, vol. 7(1), pp. 17-41, 1981.\nSee also Buckley #29 (p. 73).\n\nSIF input: Ph. Toint, Dec 1989.\n@article{MoreGarbowHillstrom1981,\n author = {Mor{\\'e}, Jorge J. and Garbow, Burton S. and Hillstrom, Kenneth E.},\n title = {Testing Unconstrained Optimization Software},\n journal = {ACM Transactions on Mathematical Software},\n year = {1981},\n volume = {7},\n number = {1},\n pages = {17--41},\n doi = {10.1145/355934.355936}\n} \n CUTEst:MEYER3
3112false2falsetruemgh01feastruefalsefalsefalseothergeneral-InfInfmissingmissingunknownhttps://github.com/JuliaSmoothOptimizers/NLPModelsTest.jl\n\n@misc{NLPModelsTestjl,\n author = {{JuliaSmoothOptimizers}},\n title = {{NLPModelsTest.jl}: Tests for Nonlinear Programming Models},\n howpublished = {\\url{https://github.com/JuliaSmoothOptimizers/NLPModelsTest.jl}},\n year = {2020}\n}\n
3124false0falsetruemgh09falsefalsefalsefalseleast_squaresunconstrained-Inf500.0truemissingunknownhttps://bitbucket.org/optrove/sif/src/master/MGH09.SIFhttps://www.itl.nist.gov/div898/strd/nls/data/LINKS/DATA/mgh09.dat\n\nNIST/ITL StRD\nDataset Name: MGH09 (MGH09.dat)\n\nFile Format: ASCII\n Starting Values (lines 41 to 44)\n Certified Values (lines 41 to 49)\n Data (lines 61 to 71)\n\nProcedure: Nonlinear Least Squares Regression\n\nDescription: This problem was found to be difficult for some very \n good algorithms. There is a local minimum at (+inf,\n -14.07..., -inf, -inf) with final sum of squares \n 0.00102734....\n\n See More, J. J., Garbow, B. S., and Hillstrom, K. E. \n (1981). Testing unconstrained optimization software.\n ACM Transactions on Mathematical Software. 7(1): \n pp. 17-41.\n\nReference: Kowalik, J.S., and M. R. Osborne, (1978). \n Methods for Unconstrained Optimization Problems. \n New York, NY: Elsevier North-Holland.\n\nData: 1 Response (y)\n 1 Predictor (x)\n 11 Observations\n Higher Level of Difficulty\n Generated Data\n\nModel: Rational Class (linear/quadratic)\n 4 Parameters (b1 to b4)\n\n y = b1*(x**2+x*b2) / (x**2+x*b3+b4) + e\nT. Migot, Montreal, 2023.\n\nNIST Data fitting problem MGH09 given as an inconsistent set of\nnonlinear equations.\nFit: y = b1*(x**2+x*b2) / (x**2+x*b3+b4) + e\n\nclassification NOR2-MN-4-11\nProblem from the NIST nonlinear regression test set\nhttp://www.itl.nist.gov/div898/strd/nls/nls_main.shtml\nReference: Kowalik, J.S., and M. R. Osborne, (1978). \nMethods for Unconstrained Optimization Problems. \nNew York, NY: Elsevier North-Holland.\n\nSIF input: Nick Gould and Tyrone Rees, Oct 2015\n@article{MoreGarbowHillstrom1981,\n author = {Mor{\\'e}, Jorge J. and Garbow, Burton S. and Hillstrom, Kenneth E.},\n title = {Testing Unconstrained Optimization Software},\n journal = {ACM Transactions on Mathematical Software},\n year = {1981},\n volume = {7},\n number = {1},\n pages = {17--41},\n doi = {10.1145/355934.355936}\n} \n CUTEst:MGH09, MGH:9, NIST:MGH09
3133false0falsetruemgh10falsefalsefalsefalseleast_squaresunconstrained-Inf500.0truefalseacademichttps://bitbucket.org/optrove/sif/src/master/MGH10.SIFhttps://www.itl.nist.gov/div898/strd/nls/data/LINKS/DATA/mgh10.dat\n\nNIST/ITL StRD\nDataset Name: MGH10 (MGH10.dat)\n\nFile Format: ASCII\n Starting Values (lines 41 to 43)\n Certified Values (lines 41 to 48)\n Data (lines 61 to 76)\n\nProcedure: Nonlinear Least Squares Regression\n\nDescription: This problem was found to be difficult for some very\n good algorithms.\n\n See More, J. J., Garbow, B. S., and Hillstrom, K. E. \n (1981). Testing unconstrained optimization software.\n ACM Transactions on Mathematical Software. 7(1): \n pp. 17-41.\n\nReference: Meyer, R. R. (1970). \n Theoretical and computational aspects of nonlinear \n regression. In Nonlinear Programming, Rosen, \n Mangasarian and Ritter (Eds). \n New York, NY: Academic Press, pp. 465-486.\n\nData: 1 Response (y)\n 1 Predictor (x)\n 16 Observations\n Higher Level of Difficulty\n Generated Data\n\nModel: Exponential Class\n 3 Parameters (b1 to b3)\n\n y = b1 * exp[b2/(x+b3)] + e\nT. Migot, Montreal, 2023.\n\nNIST Data fitting problem MGH10 given as an inconsistent set of\nnonlinear equations.\nFit: y = b1 * exp[b2/(x+b3)] + e\n\nclassification NOR2-MN-3-16\nProblem from the NIST nonlinear regression test set\nhttp://www.itl.nist.gov/div898/strd/nls/nls_main.shtml\nReference: Meyer, R. R. (1970). \nTheoretical and computational aspects of nonlinear \nregression. In Nonlinear Programming, Rosen, \nMangasarian and Ritter (Eds). \nNew York, NY: Academic Press, pp. 465-486.\n\nSIF input: Nick Gould and Tyrone Rees, Oct 2015\n@article{MoreGarbowHillstrom1981,\n author = {Mor{\\'e}, Jorge J. and Garbow, Burton S. and Hillstrom, Kenneth E.},\n title = {Testing Unconstrained Optimization Software},\n journal = {ACM Transactions on Mathematical Software},\n year = {1981},\n volume = {7},\n number = {1},\n pages = {17--41},\n doi = {10.1145/355934.355936}\n} \n CUTEst:MGH10, MGH:10, NIST:MGH10
3145false0falsetruemgh17falsefalsefalsefalseleast_squaresunconstrained-Inf500.0truemissingunknownhttps://bitbucket.org/optrove/sif/src/master/MGH17.SIFhttps://www.itl.nist.gov/div898/strd/nls/data/LINKS/DATA/mgh17.dat\n\nNIST/ITL StRD\nDataset Name: MGH17 (MGH17.dat)\n\nFile Format: ASCII\n Starting Values (lines 41 to 45)\n Certified Values (lines 41 to 50)\n Data (lines 61 to 93)\n\nProcedure: Nonlinear Least Squares Regression\n\nDescription: This problem was found to be difficult for some very\n good algorithms.\n\n See More, J. J., Garbow, B. S., and Hillstrom, K. E.\n (1981). Testing unconstrained optimization software.\n ACM Transactions on Mathematical Software. 7(1):\n pp. 17-41.\n\nReference: Osborne, M. R. (1972). \n Some aspects of nonlinear least squares \n calculations. In Numerical Methods for Nonlinear \n Optimization, Lootsma (Ed). \n New York, NY: Academic Press, pp. 171-189.\n\nData: 1 Response (y)\n 1 Predictor (x)\n 33 Observations\n Average Level of Difficulty\n Generated Data\n\nModel: Exponential Class\n 5 Parameters (b1 to b5)\n\n y = b1 + b2*exp[-x*b4] + b3*exp[-x*b5] + e\nT. Migot, Montreal, 2023.\n\nNIST Data fitting problem MGH17 given as an inconsistent set of\nnonlinear equations.\nFit: y = b1 + b2*exp[-x*b4] + b3*exp[-x*b5] + e\n\nclassification NOR2-MN-5-33\nProblem from the NIST nonlinear regression test set\nhttp://www.itl.nist.gov/div898/strd/nls/nls_main.shtml\nReference: Osborne, M. R. (1972). \nSome aspects of nonlinear least squares calculations. \nIn Numerical Methods for Nonlinear Optimization, Lootsma (Ed). \nNew York, NY: Academic Press, pp. 171-189.\n\nSIF input: Nick Gould and Tyrone Rees, Oct 2015\n@article{MoreGarbowHillstrom1981,\n author = {Mor{\\'e}, Jorge J. and Garbow, Burton S. and Hillstrom, Kenneth E.},\n title = {Testing Unconstrained Optimization Software},\n journal = {ACM Transactions on Mathematical Software},\n year = {1981},\n volume = {7},\n number = {1},\n pages = {17--41},\n doi = {10.1145/355934.355936}\n} \n CUTEst:MGH17, MGH:17, NIST:MGH17
315144true256truetrueminsurffalsefalsefalsefalseotherlinear-InfInfmissingmissingunknownhttps://bitbucket.org/optrove/sif/src/master/MINSURF.SIFMinimal surface with obstacle problem\n\nFind the surface with minimal area, given boundary conditions,\nand above an obstacle.\n\nVariable dimension full rank linear problem\nA version of the minimum surface problem\non the unit square with simple boundary conditions.\n\nclassification OBR2-AN-V-V\n\nclassification OXR2-MY-64-0\nThis is problem 17=the COPS (Version 3) collection of\nE. Dolan and J. More'\nsee "Benchmarking Optimization Software with COPS"\nArgonne National Labs Technical Report ANL/MCS-246 (2004)\n\nSIF input: Ph. Toint, Jan 1991.\n@techreport{DolanMore2004COPS,\n author = {Dolan, Elizabeth D. and Mor{'e}, Jorge J.},\n title = {Benchmarking Optimization Software with {COPS} 3.0},\n institution = {Argonne National Laboratory},\n number = {ANL/MCS-TM-273},\n year = {2004},\n doi = {10.2172/834714}\n }\n CUTEst:MINSURF, COPS:17
3162false0falsetruemisra1afalsefalsefalsefalseleast_squaresunconstrained-Inf500.0truemissingunknownhttps://bitbucket.org/optrove/sif/src/master/MISRA1A.SIFhttps://www.itl.nist.gov/div898/strd/nls/data/LINKS/DATA/misra1a.dat\n\nNIST/ITL StRD\nDataset Name: misra1a (misra1a.dat)\n\nFile Format: ASCII\n Starting Values (lines 41 to 42)\n Certified Values (lines 41 to 47)\n Data (lines 61 to 74)\n\nProcedure: Nonlinear Least Squares Regression\n\nDescription: These data are the result of a NIST study regarding\n dental research in monomolecular adsorption. The\n response variable is volume, and the predictor\n variable is pressure.\n\nReference: Misra, D., NIST (1978). \n Dental Research Monomolecular Adsorption Study.\n\nData: 1 Response Variable (y = volume)\n 1 Predictor Variable (x = pressure)\n 14 Observations\n Lower Level of Difficulty\n Observed Data\n\nModel: Exponential Class\n 2 Parameters (b1 and b2)\n\n y = b1*(1-exp[-b2*x]) + e\n\nT. Migot, Montreal, 2023.\n\nNIST Data fitting problem MISRA1A given as an inconsistent set of \nnonlinear equations\nFit: y = b1*(1-exp[-b2*x]) + e\n\nclassification NOR2-MN-2-14\nProblem from the NIST nonlinear regression test set\nhttp://www.itl.nist.gov/div898/strd/nls/nls_main.shtml\nReference: Misra, D., NIST (1978). \nDental Research Monomolecular Adsorption Study.\n\nSIF input: Nick Gould and Tyrone Rees, Oct 2015\n@misc{NISTStRD,\n author = {{National Institute of Standards and Technology}},\n title = {{NIST/ITL StRD}: Nonlinear Regression Reference Datasets},\n howpublished = {\\url{https://www.itl.nist.gov/div898/strd/nls/nls_main.shtml}},\n year = {1997}\n}\nCUTEst:MISRA1A, NIST:misra1a
3172false0falsetruemisra1bfalsefalsefalsefalseleast_squaresunconstrained-Inf500.0truemissingunknownhttps://bitbucket.org/optrove/sif/src/master/MISRA1B.SIFhttps://www.itl.nist.gov/div898/strd/nls/data/LINKS/DATA/misra1b.dat\n\nNIST/ITL StRD\nDataset Name: Misra1b (Misra1b.dat)\n\nFile Format: ASCII\n Starting Values (lines 41 to 42)\n Certified Values (lines 41 to 47)\n Data (lines 61 to 74)\n\nProcedure: Nonlinear Least Squares Regression\n\nDescription: These data are the result of a NIST study regarding\n dental research in monomolecular adsorption. The\n response variable is volume, and the predictor\n variable is pressure.\n\nReference: Misra, D., NIST (1978). \n Dental Research Monomolecular Adsorption Study.\n\nData: 1 Response (y = volume)\n 1 Predictor (x = pressure)\n 14 Observations\n Lower Level of Difficulty\n Observed Data\n\nModel: Miscellaneous Class\n 2 Parameters (b1 and b2)\n\n y = b1 * (1-(1+b2*x/2)**(-2)) + e\n\nT. Migot, Montreal, 2023.\n\nNIST Data fitting problem MISRA1B given as an inconsistent set of\nnonlinear equations.\nFit: y = b1 * (1-(1+b2*x/2)**(-2)) + e\n\nclassification NOR2-MN-2-14\nProblem from the NIST nonlinear regression test set\nhttp://www.itl.nist.gov/div898/strd/nls/nls_main.shtml\nReference: Misra, D., NIST (1978). \nDental Research Monomolecular Adsorption Study.\n\nSIF input: Nick Gould and Tyrone Rees, Oct 2015\n@misc{NISTStRD,\n author = {{National Institute of Standards and Technology}},\n title = {{NIST/ITL StRD}: Nonlinear Regression Reference Datasets},\n howpublished = {\\url{https://www.itl.nist.gov/div898/strd/nls/nls_main.shtml}},\n year = {1997}\n}\nCUTEst:MISRA1B, NIST:Misra1b
3182false0falsetruemisra1cfalsefalsefalsefalseleast_squaresunconstrained-Inf500.0truemissingunknownhttps://bitbucket.org/optrove/sif/src/master/MISRA1C.SIFhttps://www.itl.nist.gov/div898/strd/nls/data/LINKS/DATA/misra1c.dat\n\nNIST/ITL StRD\nDataset Name: Misra1c (Misra1c.dat)\n\nFile Format: ASCII\n Starting Values (lines 41 to 42)\n Certified Values (lines 41 to 47)\n Data (lines 61 to 74)\n\nProcedure: Nonlinear Least Squares Regression\n\nDescription: These data are the result of a NIST study regarding\n dental research in monomolecular adsorption. The\n response variable is volume, and the predictor\n variable is pressure.\n\nReference: Misra, D., NIST (1978). \n Dental Research Monomolecular Adsorption.\n\nData: 1 Response (y = volume)\n 1 Predictor (x = pressure)\n 14 Observations\n Average Level of Difficulty\n Observed Data\n\nModel: Miscellaneous Class\n 2 Parameters (b1 and b2)\n\n y = b1 * (1-(1+2*b2*x)**(-.5)) + e\nT. Migot, Montreal, 2023.\n\nNIST Data fitting problem MISRA1C given as an inconsistent set of\nnonlinear equations.\nFit: y = b1 * (1-(1+2*b2*x)**(-.5)) + e\n\nclassification NOR2-MN-2-14\nProblem from the NIST nonlinear regression test set\nhttp://www.itl.nist.gov/div898/strd/nls/nls_main.shtml\nReference: Misra, D., NIST (1978). \nDental Research Monomolecular Adsorption Study.\n\nSIF input: Nick Gould and Tyrone Rees, Oct 2015\n@misc{NISTStRD,\n author = {{National Institute of Standards and Technology}},\n title = {{NIST/ITL StRD}: Nonlinear Regression Reference Datasets},\n howpublished = {\\url{https://www.itl.nist.gov/div898/strd/nls/nls_main.shtml}},\n year = {1997}\n}\nCUTEst:MISRA1C, NIST:Misra1c
3192false0falsetruemisra1dfalsefalsefalsefalseleast_squaresunconstrained-Inf500.0truemissingunknownhttps://bitbucket.org/optrove/sif/src/master/MISRA1D.SIFhttps://www.itl.nist.gov/div898/strd/nls/data/LINKS/DATA/misra1d.dat\n\nFile Format: ASCII\n Starting Values (lines 41 to 42)\n Certified Values (lines 41 to 47)\n Data (lines 61 to 74)\n\nProcedure: Nonlinear Least Squares Regression\n\nDescription: These data are the result of a NIST study regarding\n dental research in monomolecular adsorption. The\n response variable is volume, and the predictor\n variable is pressure.\n\nReference: Misra, D., NIST (1978). \n Dental Research Monomolecular Adsorption Study.\n\nData: 1 Response (y = volume)\n 1 Predictor (x = pressure)\n 14 Observations\n Average Level of Difficulty\n Observed Data\n\nModel: Miscellaneous Class\n 2 Parameters (b1 and b2)\n\n y = b1*b2*x*((1+b2*x)**(-1)) + e\nT. Migot, Montreal, 2023.\n\nNIST Data fitting problem MISRA1D given as an inconsistent set of\nnonlinear equations.\nFit: y = y = b1*b2*x*((1+b2*x)**(-1)) + e\n\nclassification NOR2-MN-2-14\nProblem from the NIST nonlinear regression test set\nhttp://www.itl.nist.gov/div898/strd/nls/nls_main.shtml\nReference: Misra, D., NIST (1978). \nDental Research Monomolecular Adsorption Study.\n\nSIF input: Nick Gould and Tyrone Rees, Oct 2015\n@misc{NISTStRD,\n author = {{National Institute of Standards and Technology}},\n title = {{NIST/ITL StRD}: Nonlinear Regression Reference Datasets},\n howpublished = {\\url{https://www.itl.nist.gov/div898/strd/nls/nls_main.shtml}},\n year = {1997}\n}\nCUTEst:MISRA1D
320100true0falsetruemorebvfalsefalsefalsefalseleast_squaresunconstrained-Inf0.500942truemissingunknownhttps://bitbucket.org/optrove/sif/src/master/MOREBV.SIFThe Boundary Value problem.\nThis is the nonlinear least-squares version without fixed variables.\n\nclassification SUR2-MN-V-0\n\nProblem 39 in\nL. Luksan, C. Matonoha and J. Vlcek\nModified CUTE problems for sparse unconstrained optimization,\nTechnical Report 1081,\nInstitute of Computer Science,\nAcademy of Science of the Czech Republic\nhttp://www.cs.cas.cz/matonoha/download/V1081.pdf\n\nJ.-P. Dussault, Clermont-Ferrand 05/2016.\nproblem 28 in\nJ.J. More', B.S. Garbow and K.E. Hillstrom,\n"Testing Unconstrained Optimization Software",\nACM Transactions on Mathematical Software, vol. 7(1), pp. 17-41, 1981.\nSee also Buckley#17 (p. 75).\n\nSIF input: Ph. Toint, Dec 1989 and Nick Gould, Oct 1992.\n@article{MoreGarbowHillstrom1981,\n author = {Mor{\\'e}, Jorge J. and Garbow, Burton S. and Hillstrom, Kenneth E.},\n title = {Testing Unconstrained Optimization Software},\n journal = {ACM Transactions on Mathematical Software},\n year = {1981},\n volume = {7},\n number = {1},\n pages = {17--41},\n doi = {10.1145/355934.355936}\n} \n CUTEst:MOREBV, Luksan:39
3212false0falsetruenastyfalsefalsefalsefalseotherunconstrained-Inf0.5truemissingunknownNasty problem.\n\nclassification QUR2-AN-2-0\na very simple box-constrained quadratic\nCUTEst:NASTY
322100true0falsetruenazarethfalsefalsefalsefalseleast_squaresunconstrained-InfInfmissingmissingliteraturehttps://www.researchgate.net/publication/325314400_Sparse_Test_Problems_for_Unconstrained_OptimizationSparse modification of the Nazareth trigonometric function\nProblem 8 in\nL. Luksan, C. Matonoha and J. Vlcek\nSparse Test Problems for Unconstrained Optimization,\nTechnical Report 1064,\nInstitute of Computer Science,\nAcademy of Science of the Czech Republic\nhttps://www.researchgate.net/publication/325314400_Sparse_Test_Problems_for_Unconstrained_Optimization\n\n@techreport{LuksanMatonohaVlcek2010Sparse,\n author = {Luksan, Ladislav and Matonoha, Ctirad and Vlcek, Jan},\n title = {Sparse Test Problems for Unconstrained Optimization},\n institution = {Institute of Computer Science, Academy of Sciences of the Czech Republic},\n number = {V-1064},\n year = {2010},\n address = {Prague, Czech Republic},\n url = {https://www.researchgate.net/publication/325314400_Sparse_Test_Problems_for_Unconstrained_Optimization}\n }\n LuksanSparse:8
323100true0falsetruencb20falsefalsefalsefalseotherunconstrained-Inf182.002truemissingunknownhttps://bitbucket.org/optrove/sif/src/master/NCB20.SIFA banded problem with semi-bandwidth 20. This problem exhibits frequent\nnegative curvature in the exact Hessian.\n\nclassification OUR2-AN-V-0\nProblem 40 in\nL. Luksan, C. Matonoha and J. Vlcek\nModified CUTE problems for sparse unconstrained optimization,\nTechnical Report 1081,\nInstitute of Computer Science,\nAcademy of Science of the Czech Republic\nhttp://www.cs.cas.cz/matonoha/download/V1081.pdf\nJ.-P. Dussault, Clermont-Ferrand 05/2016.\nPh. Toint, private communication, 1992.\n\nSIF input: Ph. Toint, October 1992.\n@techreport{LuksanMatonohaVlcek2003,\n author = {Luksan, Ladislav and Matonoha, Cestmir and Vlcek, Jan},\n title = {Modified {CUTE} Problems for Sparse Unconstrained Optimization},\n institution = {Institute of Computer Science, Academy of Sciences of the Czech Republic},\n number = {1081},\n year = {2003},\n address = {Prague, Czech Republic},\n url = {http://www.cs.cas.cz/matonoha/download/V1081.pdf},\n } \n CUTEst:NCB20, Luksan:40
324100true0falsetruencb20bfalsefalsefalsefalseotherunconstrained-Inf200.0truemissingunknownhttps://bitbucket.org/optrove/sif/src/master/NCB20B.SIFA banded problem with semi-bandwidth 20. This problem exhibits frequent\nnegative curvature in the exact Hessian. It is a simplified version of\nproblem NCB20.\n\nclassification OUR2-AN-V-0\nProblem 41 in\nL. Luksan, C. Matonoha and J. Vlcek\nModified CUTE problems for sparse unconstrained optimization,\nTechnical Report 1081,\nInstitute of Computer Science,\nAcademy of Science of the Czech Republic\nhttp://www.cs.cas.cz/matonoha/download/V1081.pdf\nJ.-P. Dussault, Clermont-Ferrand 05/2016.\nPh. Toint, private communication, 1993.\n\nSIF input: Ph. Toint, April 1993.\n@techreport{LuksanMatonohaVlcek2003,\n author = {Luksan, Ladislav and Matonoha, Cestmir and Vlcek, Jan},\n title = {Modified {CUTE} Problems for Sparse Unconstrained Optimization},\n institution = {Institute of Computer Science, Academy of Sciences of the Czech Republic},\n number = {1081},\n year = {2003},\n address = {Prague, Czech Republic},\n url = {http://www.cs.cas.cz/matonoha/download/V1081.pdf},\n } \n CUTEst:NCB20B, Luksan:41
3253false0falsetruenelsonfalsefalsefalsefalseleast_squaresunconstrained-Inf500.0truefalserealhttps://bitbucket.org/optrove/sif/src/master/NELSON.SIFhttps://www.itl.nist.gov/div898/strd/nls/data/LINKS/DATA/nelson.dat\n\nNIST/ITL StRD\nDataset Name: Nelson (Nelson.dat)\n\nFile Format: ASCII\n Starting Values (lines 41 to 43)\n Certified Values (lines 41 to 48)\n Data (lines 61 to 188)\n\nProcedure: Nonlinear Least Squares Regression\n\nDescription: These data are the result of a study involving\n the analysis of performance degradation data from\n accelerated tests, published in IEEE Transactions\n on Reliability. The response variable is dialectric\n breakdown strength in kilo-volts, and the predictor\n variables are time in weeks and temperature in degrees\n Celcius.\n\nReference: Nelson, W. (1981). \n Analysis of Performance-Degradation Data. \n IEEE Transactions on Reliability.\n Vol. 2, R-30, No. 2, pp. 149-155.\n\nData: 1 Response ( y = dialectric breakdown strength) \n 2 Predictors (x1 = time; x2 = temperature)\n 128 Observations\n Average Level of Difficulty\n Observed Data\n\nModel: Exponential Class\n 3 Parameters (b1 to b3)\n\n log[y] = b1 - b2*x1 * exp[-b3*x2] + e\n\nT. Migot, Montreal, 2023.\n\nNIST Data fitting problem NELSON given as an inconsistent set of\nnonlinear equations.\nFit: log[y] = b1 - b2*x1 * exp[-b3*x2] + e\n\nclassification NOR2-MN-3-128\nProblem from the NIST nonlinear regression test set\nhttp://www.itl.nist.gov/div898/strd/nls/nls_main.shtml\nReference: Nelson, W. (1981). \nAnalysis of Performance-Degradation Data. \nIEEE Transactions on Reliability. Vol. 2, R-30, No. 2, pp. 149-155.\n\nSIF input: Nick Gould and Tyrone Rees, Oct 2015\n@article{Nelson1981,\n author = {Nelson, Wayne},\n title = {Analysis of Performance-Degradation Data from Accelerated Tests},\n journal = {IEEE Transactions on Reliability},\n year = {1981},\n volume = {R-30},\n number = {2},\n pages = {149--155},\n doi = {10.1109/TR.1981.5221010}\n}\nCUTEst:NELSON, NIST:Nelson
326100true0falsetruenoncvxu2falsefalsefalsefalseotherunconstrained-Inf2.63975e6truemissingunknownhttps://bitbucket.org/optrove/sif/src/master/NONCVXU2.SIFA nonconvex unconstrained function with a unique minimum value\n\nclassification OUR2-AN-V-0\n\nProblem 43 in\nL. Luksan, C. Matonoha and J. Vlcek\nModified CUTE problems for sparse unconstrained optimization,\nTechnical Report 1081,\nInstitute of Computer Science,\nAcademy of Science of the Czech Republic\nhttp://www.cs.cas.cz/matonoha/download/V1081.pdf\nJ.-P. Dussault, Clermont-Ferrand 05/2016.\nSIF input: Nick Gould, April 1996\n@techreport{LuksanMatonohaVlcek2003,\n author = {Luksan, Ladislav and Matonoha, Cestmir and Vlcek, Jan},\n title = {Modified {CUTE} Problems for Sparse Unconstrained Optimization},\n institution = {Institute of Computer Science, Academy of Sciences of the Czech Republic},\n number = {1081},\n year = {2003},\n address = {Prague, Czech Republic},\n url = {http://www.cs.cas.cz/matonoha/download/V1081.pdf},\n } \n CUTEst:NONCVXU2, Luksan:43
327100true0falsetruenoncvxunfalsefalsefalsefalseotherunconstrained-Inf2.72701e6truemissingunknownhttps://bitbucket.org/optrove/sif/src/master/NONCVXUN.SIFA nonconvex unconstrained function with a unique minimum value\nSee discussion here https://github.com/JuliaSmoothOptimizers/CUTEst.jl/issues/321\n\nA nonconvex unconstrained function with a unique minimum value\n\nclassification OUR2-AN-V-0\n\nProblem 42 in\nL. Luksan, C. Matonoha and J. Vlcek\nModified CUTE problems for sparse unconstrained optimization,\nTechnical Report 1081,\nInstitute of Computer Science,\nAcademy of Science of the Czech Republic\nhttp://www.cs.cas.cz/matonoha/download/V1081.pdf\nJ.-P. Dussault, Clermont-Ferrand 05/2016.\nSIF input: Nick Gould, April 1996\n@techreport{LuksanMatonohaVlcek2003,\n author = {Luksan, Ladislav and Matonoha, Cestmir and Vlcek, Jan},\n title = {Modified {CUTE} Problems for Sparse Unconstrained Optimization},\n institution = {Institute of Computer Science, Academy of Sciences of the Czech Republic},\n number = {1081},\n year = {2003},\n address = {Prague, Czech Republic},\n url = {http://www.cs.cas.cz/matonoha/download/V1081.pdf},\n } \n CUTEst:NONCVXUN, Luksan:42
328100true0falsetruenondiafalsefalsefalsefalseotherunconstrained-Inf39604.0truemissingunknownhttps://bitbucket.org/optrove/sif/src/master/NONDIA.SIFThe Shanno nondiagonal extension of Rosenbrock function.\n\nclassification SUR2-AN-V-0\n\nProblem 44 in\nL. Luksan, C. Matonoha and J. Vlcek\nModified CUTE problems for sparse unconstrained optimization,\nTechnical Report 1081,\nInstitute of Computer Science,\nAcademy of Science of the Czech Republic\nhttp://www.cs.cas.cz/matonoha/download/V1081.pdf\nJ.-P. Dussault, Clermont-Ferrand 05/2016.\n\nNote: discrepancy with CUTEst appears to be a bug in CUTEst, this (now) matches the original paper\n(See issue #36)\nD. Shanno,\n" On Variable Metric Methods for Sparse Hessians II: the New\nMethod",\nMIS Tech report 27, University of Arizona (Tucson, UK), 1978.\nSee also Buckley #37 (p. 76) and Toint #15.\n\nSIF input: Ph. Toint, Dec 1989.\n@techreport{Shanno1978,\n author = {Shanno, D. F.},\n title = {On Variable Metric Methods for Sparse {Hessians} {II}: the New Method},\n institution = {University of Arizona},\n type = {MIS Technical Report},\n number = {27},\n address = {Tucson, AZ},\n year = {1978}\n} \n CUTEst:NONDIA, Luksan:44
329100true0falsetruenondquarfalsefalsefalsefalseotherunconstrained-Inf106.0truemissingunknownhttps://bitbucket.org/optrove/sif/src/master/NONDQUAR.SIFA nondiagonal quartic test problem.\n\nThis problem has an arrow-head type Hessian with a tridiagonal\ncentral part and a border of width 1.\nThe Hessian is singular at the solution.\n\nclassification OUR2-AN-V-0\n\nProblem 45 in\nL. Luksan, C. Matonoha and J. Vlcek\nModified CUTE problems for sparse unconstrained optimization,\nTechnical Report 1081,\nInstitute of Computer Science,\nAcademy of Science of the Czech Republic\nhttp://www.cs.cas.cz/matonoha/download/V1081.pdf\nJ.-P. Dussault, Clermont-Ferrand 05/2016.\nproblem 57 in\nA.R. Conn, N.I.M. Gould, M. Lescrenier and Ph.L. Toint,\n"Performance of a multi-frontal scheme for partially separable\noptimization"\nReport 88/4, Dept of Mathematics, FUNDP (Namur, B), 1988.\n\nSIF input: Ph. Toint, Dec 1989.\n@techreport{ConnGouldLescrenierToint1988,\n author = {Conn, A. R. and Gould, N. I. M. and Lescrenier, M. and Toint, Ph. L.},\n title = {Performance of a multifrontal scheme for partially separable optimization},\n institution = {Department of Mathematics, FUNDP},\n address = {Namur, Belgium},\n number = {Report 88/4},\n year = {1988}\n} \n CUTEst:NONDQUAR, Luksan:45
3305false0falsetrueosborne1falsefalsefalsefalseleast_squaresunconstrained-Inf7.06876truemissingunknownhttps://bitbucket.org/optrove/sif/src/master/OSBORNE1.SIFOsborne first problem in 5 variables. This is a nonlinear equation version\nof problem OSBORNEA.\nThis function is a nonlinear least squares with 33 groups. Each\ngroup has 2 nonlinear elements and one linear element.\n\nclassification NOR2-MN-5-33\nProblem 17 in\nJ.J. More', B.S. Garbow and K.E. Hillstrom,\n"Testing Unconstrained Optimization Software",\nACM Transactions on Mathematical Software, vol. 7(1), pp. 17-41, 1981.\nSee alos Buckley#32 (p. 77).\n\nSIF input: Ph. Toint, Dec 1989.\n@article{MoreGarbowHillstrom1981,\n author = {Mor{\\'e}, Jorge J. and Garbow, Burton S. and Hillstrom, Kenneth E.},\n title = {Testing Unconstrained Optimization Software},\n journal = {ACM Transactions on Mathematical Software},\n year = {1981},\n volume = {7},\n number = {1},\n pages = {17--41},\n doi = {10.1145/355934.355936}\n} \n CUTEst:OSBORNE1
33111false0falsetrueosborne2falsefalsefalsefalseleast_squaresunconstrained-Inf2.09342truemissingunknownhttps://bitbucket.org/optrove/sif/src/master/OSBORNE2.SIFOsborne second problem in 11 variables. This is a nonlinear equation version\nof problem OSBORNEB.\nThis function is a nonlinear least squares with 65 groups. Each\ngroup has 4 nonlinear elements.\n\nclassification NOR2-MN-11-65\nProblem 19 in\nJ.J. More', B.S. Garbow and K.E. Hillstrom,\n"Testing Unconstrained Optimization Software",\nACM Transactions on Mathematical Software, vol. 7(1), pp. 17-41, 1981.\nSee also Buckley#32 (p.78).\n\nSIF input: Ph. Toint, Dec 1989.\n@article{MoreGarbowHillstrom1981,\n author = {Mor{\\'e}, Jorge J. and Garbow, Burton S. and Hillstrom, Kenneth E.},\n title = {Testing Unconstrained Optimization Software},\n journal = {ACM Transactions on Mathematical Software},\n year = {1981},\n volume = {7},\n number = {1},\n pages = {17--41},\n doi = {10.1145/355934.355936}\n} \n CUTEst:OSBORNE2
3328false0falsetruepalmer1cfalsefalsefalsefalseleast_squaresunconstrained-Inf3.45295e8truemissingunknownhttps://bitbucket.org/optrove/sif/src/master/PALMER1C.SIFA linear least squares problem arising from chemical kinetics.\n\nmodel: H-N=N=N TZVP+MP2\nfitting Y to A0 + A2 X**2 + A4 X**4 + A6 X**6 + A8 X**8 +\n A10 X**10 + A12 X**12 + A14 X**14\n\nclassification QUR2-RN-8-0\nM. Palmer, Edinburgh, private communication.\n\nSIF input: Nick Gould, 1990.\n@article{Gould2015CUTEst,\n author = {Gould, N. I. M. and Orban, D. and Toint, Ph. L.},\n title = {{CUTEst}: a Constrained and Unconstrained Testing Environment with safe threads for mathematical optimization},\n journal = {Computational Optimization and Applications},\n year = {2015},\n volume = {60},\n number = {3},\n pages = {545--557},\n doi = {10.1007/s10589-014-9687-3}\n}\nCUTEst:PALMER1C
3337false0falsetruepalmer1dfalsefalsefalsefalseleast_squaresunconstrained-Inf2.87266e7truemissingunknownhttps://bitbucket.org/optrove/sif/src/master/PALMER1D.SIFA linear least squares problem arising from chemical kinetics.\n\nmodel: H-N=N=N TZVP+MP2\nfitting Y to A0 + A2 X**2 + A4 X**4 + A6 X**6 + A8 X**8 +\n A10 X**10 + A12 X**12\n\nclassification QUR2-RN-7-0\nM. Palmer, Edinburgh, private communication.\n\nSIF input: Nick Gould, 1990.\n@article{Gould2015CUTEst,\n author = {Gould, N. I. M. and Orban, D. and Toint, Ph. L.},\n title = {{CUTEst}: a Constrained and Unconstrained Testing Environment with safe threads for mathematical optimization},\n journal = {Computational Optimization and Applications},\n year = {2015},\n volume = {60},\n number = {3},\n pages = {545--557},\n doi = {10.1007/s10589-014-9687-3}\n}\nCUTEst:PALMER1D
3348false0falsetruepalmer2cfalsefalsefalsefalseleast_squaresunconstrained-Inf2.6894e7truemissingunknownhttps://bitbucket.org/optrove/sif/src/master/PALMER2C.SIFA linear least squares problem arising from chemical kinetics.\n\nmodel: H-N=C=O TZVP+MP2\nfitting Y to A0 + A2 X**2 + A4 X**4 + A6 X**6 + A8 X**8 +\n A10 X**10 + A12 X**12 + A14 X**14\n\nclassification QUR2-RN-8-0\nM. Palmer, Edinburgh, private communication.\n\nSIF input: Nick Gould, 1990.\n@article{Gould2015CUTEst,\n author = {Gould, N. I. M. and Orban, D. and Toint, Ph. L.},\n title = {{CUTEst}: a Constrained and Unconstrained Testing Environment with safe threads for mathematical optimization},\n journal = {Computational Optimization and Applications},\n year = {2015},\n volume = {60},\n number = {3},\n pages = {545--557},\n doi = {10.1007/s10589-014-9687-3}\n}\nCUTEst:PALMER2C
3358false0falsetruepalmer3cfalsefalsefalsefalseleast_squaresunconstrained-Inf8.12197e6truemissingunknownhttps://bitbucket.org/optrove/sif/src/master/PALMER3C.SIFA linear least squares problem arising from chemical kinetics.\n\nmodel: H-N=C=S TZVP+MP2\nfitting Y to A0 + A2 X**2 + A4 X**4 + A6 X**6 + A8 X**8 +\n A10 X**10 + A12 X**12 + A14 X**14\n\nclassification QUR2-RN-8-0\nM. Palmer, Edinburgh, private comminication.\n\nSIF input: Nick Gould, 1990.\n@article{Gould2015CUTEst,\n author = {Gould, N. I. M. and Orban, D. and Toint, Ph. L.},\n title = {{CUTEst}: a Constrained and Unconstrained Testing Environment with safe threads for mathematical optimization},\n journal = {Computational Optimization and Applications},\n year = {2015},\n volume = {60},\n number = {3},\n pages = {545--557},\n doi = {10.1007/s10589-014-9687-3}\n}\nCUTEst:PALMER3C
3368false0falsetruepalmer4cfalsefalsefalsefalseleast_squaresunconstrained-Inf8.09445e6truemissingunknownhttps://bitbucket.org/optrove/sif/src/master/PALMER4C.SIFA linear least squares problem arising from chemical kinetics.\n\nmodel: H-N=C=Se TZVP+MP2\nfitting Y to A0 + A2 X**2 + A4 X**4 + A6 X**6 + A8 X**8 +\n A10 X**10 + A12 X**12 + A14 X**14\n\nclassification QUR2-RN-8-0\nM. Palmer, Edinburgh, private communication.\n\nSIF input: Nick Gould, 1990.\n@article{Gould2015CUTEst,\n author = {Gould, N. I. M. and Orban, D. and Toint, Ph. L.},\n title = {{CUTEst}: a Constrained and Unconstrained Testing Environment with safe threads for mathematical optimization},\n journal = {Computational Optimization and Applications},\n year = {2015},\n volume = {60},\n number = {3},\n pages = {545--557},\n doi = {10.1007/s10589-014-9687-3}\n}\nCUTEst:PALMER4C
3376false0falsetruepalmer5cfalsefalsefalsefalseleast_squaresunconstrained-Inf25495.0truemissingunknownhttps://bitbucket.org/optrove/sif/src/master/PALMER5C.SIFA linear least squares problem arising from chemical kinetics.\n\nmodel: H-N=C=Se TZVP+MP2\nfitting Y to A0 T_0 + A2 T_2 + A4 T_4 + A6 T_6 + A8 T_8 +\n A10 T_10 + A12 T_12 + A14 T_14\nwhere T_i is the i-th (shifted) Chebyshev polynomial\n\nclassification QUR2-RN-6-0\nM. Palmer, Edinburgh, private communication.\n\nSIF input: Nick Gould, 1992.\n@article{Gould2015CUTEst,\n author = {Gould, N. I. M. and Orban, D. and Toint, Ph. L.},\n title = {{CUTEst}: a Constrained and Unconstrained Testing Environment with safe threads for mathematical optimization},\n journal = {Computational Optimization and Applications},\n year = {2015},\n volume = {60},\n number = {3},\n pages = {545--557},\n doi = {10.1007/s10589-014-9687-3}\n}\nCUTEst:PALMER5C
3384false0falsetruepalmer5dfalsefalsefalsefalseleast_squaresunconstrained-Inf22262.6truemissingunknownhttps://bitbucket.org/optrove/sif/src/master/PALMER5D.SIFA linear least squares problem arising from chemical kinetics.\n\nmodel: H-N=C=Se TZVP+MP2\nfitting Y to to A0 + A2 X**2 + A4 X**4 + A6 X**6\n\nclassification QUR2-RN-4-0\nM. Palmer, Edinburgh, private communication.\n\nSIF input: Nick Gould, 1992.\n@article{Gould2015CUTEst,\n author = {Gould, N. I. M. and Orban, D. and Toint, Ph. L.},\n title = {{CUTEst}: a Constrained and Unconstrained Testing Environment with safe threads for mathematical optimization},\n journal = {Computational Optimization and Applications},\n year = {2015},\n volume = {60},\n number = {3},\n pages = {545--557},\n doi = {10.1007/s10589-014-9687-3}\n}\nCUTEst:PALMER5D
3398false0falsetruepalmer6cfalsefalsefalsefalseleast_squaresunconstrained-Inf7.72166e5truemissingunknownhttps://bitbucket.org/optrove/sif/src/master/PALMER6C.SIFA linear least squares problem arising from chemical kinetics.\n\nmodel: H-N=C=Se TZVP+MP2\nfitting Y to A0 + A2 X**2 + A4 X**4 + A6 X**6 + A8 X**8 +\n A10 X**10 + A12 X**12 + A14 X**14\n\nclassification SUR2-RN-8-0\n\nclassification QUR2-RN-8-0\nM. Palmer, Edinburgh, private communication.\n\nSIF input: Nick Gould, 1992.\n@article{Gould2015CUTEst,\n author = {Gould, N. I. M. and Orban, D. and Toint, Ph. L.},\n title = {{CUTEst}: a Constrained and Unconstrained Testing Environment with safe threads for mathematical optimization},\n journal = {Computational Optimization and Applications},\n year = {2015},\n volume = {60},\n number = {3},\n pages = {545--557},\n doi = {10.1007/s10589-014-9687-3}\n}\nCUTEst:PALMER6C
3408false0falsetruepalmer7cfalsefalsefalsefalseleast_squaresunconstrained-Inf3.20513e6truemissingunknownhttps://bitbucket.org/optrove/sif/src/master/PALMER7C.SIFA linear least squares problem arising from chemical kinetics.\n\nmodel: H-N=C=Se TZVP+MP2\nfitting Y to A0 + A2 X**2 + A4 X**4 + A6 X**6 + A8 X**8 +\n A10 X**10 + A12 X**12 + A14 X**14\n\nclassification QUR2-RN-8-0\nM. Palmer, Edinburgh, private communication.\n\nSIF input: Nick Gould, 1992.\n@article{Gould2015CUTEst,\n author = {Gould, N. I. M. and Orban, D. and Toint, Ph. L.},\n title = {{CUTEst}: a Constrained and Unconstrained Testing Environment with safe threads for mathematical optimization},\n journal = {Computational Optimization and Applications},\n year = {2015},\n volume = {60},\n number = {3},\n pages = {545--557},\n doi = {10.1007/s10589-014-9687-3}\n}\nCUTEst:PALMER7C
3418false0falsetruepalmer8cfalsefalsefalsefalseleast_squaresunconstrained-Inf850271.0truemissingunknownhttps://bitbucket.org/optrove/sif/src/master/PALMER8C.SIFA linear least squares problem arising from chemical kinetics.\n\nmodel: H-N=C=Se TZVP+MP2\nfitting Y to A0 + A2 X**2 + A4 X**4 + A6 X**6 + A8 X**8 +\n A10 X**10 + A12 X**12 + A14 X**14\n\nclassification QUR2-RN-8-0\nM. Palmer, Edinburgh, private communication.\n\nSIF input: Nick Gould, 1992.\n@article{Gould2015CUTEst,\n author = {Gould, N. I. M. and Orban, D. and Toint, Ph. L.},\n title = {{CUTEst}: a Constrained and Unconstrained Testing Environment with safe threads for mathematical optimization},\n journal = {Computational Optimization and Applications},\n year = {2015},\n volume = {60},\n number = {3},\n pages = {545--557},\n doi = {10.1007/s10589-014-9687-3}\n}\nCUTEst:PALMER8C
342100true0falsetruepenalty1falsefalsefalsefalseleast_squaresunconstrained-Inf1.0truemissingunknownhttps://bitbucket.org/optrove/sif/src/master/PENALTY1.SIFA penalty function arising from\nmin{ sum_1^n(x_i-1)^2 subject to sum_1^n x_i^2 = 1/4}.\nAt the solution, the hessian has n-1 eigenvalues of order 1e-5 and\none of order 1.\n\nThis problem is a sum of n+1 least-squares groups, the first n of\nwhich have only a linear element.\nIt Hessian matrix is dense.\n\nclassification SUR2-AN-V-0\nProblem 23 in\nJ.J. More', B.S. Garbow and K.E. Hillstrom,\n"Testing Unconstrained Optimization Software",\nACM Transactions on Mathematical Software, vol. 7(1), pp. 17-41, 1981.\nSee also Buckley #181 (p. 79).\n\nSIF input: Ph. Toint, Dec 1989.\n@article{MoreGarbowHillstrom1981,\n author = {Mor{\\'e}, Jorge J. and Garbow, Burton S. and Hillstrom, Kenneth E.},\n title = {Testing Unconstrained Optimization Software},\n journal = {ACM Transactions on Mathematical Software},\n year = {1981},\n volume = {7},\n number = {1},\n pages = {17--41},\n doi = {10.1145/355934.355936}\n} \n CUTEst:PENALTY1
343100true0falsetruepenalty2falsefalsefalsefalseotherunconstrained-Inf1.68848e6truemissingunknownhttps://bitbucket.org/optrove/sif/src/master/PENALTY2.SIFThe second penalty function\nThis is a nonlinear least-squares problem with M=2*N groups.\nGroup 1 is linear.\nGroups 2 to N use 2 nonlinear elements.\nGroups N+1 to M-1 use 1 nonlinear element.\nGroup M uses N nonlinear elements.\nThe Hessian matrix is dense.\n\nclassification SUR2-AN-V-0\nJ.-P. Dussault, Clermont-Ferrand 06/2016.\nProblem 24 in\nJ.J. More', B.S. Garbow and K.E. Hillstrom,\n"Testing Unconstrained Optimization Software",\nACM Transactions on Mathematical Software, vol. 7(1), pp. 17-41, 1981.\nSee also Buckley#112 (p. 80)\n\nSIF input: Ph. Toint, Dec 1989.\n@article{MoreGarbowHillstrom1981,\n author = {Mor{\\'e}, Jorge J. and Garbow, Burton S. and Hillstrom, Kenneth E.},\n title = {Testing Unconstrained Optimization Software},\n journal = {ACM Transactions on Mathematical Software},\n year = {1981},\n volume = {7},\n number = {1},\n pages = {17--41},\n doi = {10.1145/355934.355936}\n} \n CUTEst:PENALTY2
344100true0falsetruepenalty3falsefalsefalsefalseotherunconstrained-Inf1.00639e8truemissingunknownhttps://bitbucket.org/optrove/sif/src/master/PENALTY3.SIFA penalty problem by Gill, Murray and Pitfield.\nIt has a dense Hessian matrix.\n\nclassification OUR2-AY-V-0\n\nProblem 46 in\nL. Luksan, C. Matonoha and J. Vlcek\nModified CUTE problems for sparse unconstrained optimization,\nTechnical Report 1081,\nInstitute of Computer Science,\nAcademy of Science of the Czech Republic\nhttp://www.cs.cas.cz/matonoha/download/V1081.pdf\nJ.-P. Dussault, Clermont-Ferrand 05/2016.\nproblem 114 (p. 81) in\nA.R. Buckley,\n"Test functions for unconstrained minimization",\nTR 1989CS-3, Mathematics, statistics and computing centre,\nDalhousie University, Halifax (CDN), 1989.\n\nSIF input: Nick Gould, Dec 1990.\n@techreport{Buckley1989,\n author = {Buckley, A. G.},\n title = {Test functions for unconstrained minimization},\n institution = {Computing Science Division, Dalhousie University},\n address = {Dalhousie, Canada},\n number = {CS-3},\n year = {1989}\n} \n CUTEst:PENALTY3, Luksan:46
3455005true5000truetruepinenetruefalsetruefalseothergeneral-InfInfmissingmissingunknownhttps://bitbucket.org/optrove/sif/src/master/PINENE.SIFIsomerization of Alpha-Pinene Problem\nCollocation formulation\n\nDetermine the reaction coefficients in the thermal isometrization \nof alpha-Pinene. The linear kinetic model is\ny_1' = - (theta_1 + theta_2) y_1\ny_2' = theta_1 y_1\ny_3' = theta_2 y_1 - ( theta_3 + theta_4 ) y_3 + theta_5 y_5\ny_4' = theta_3 y_3\ny_5' = theta_4 y_3 - theta_5 y_5\nwhere the reaction coefficients theta_i are positive,\nwith given initial conditions. The problem is to minimize\nsum{i=1,8} || y(tau_i,theta) - z_i||^2\nwhere the z_i are concentration measurements for y at times tau_i (i=1,8)\n\nclassification OOR2-AN-V-V\nThis is problem 5 in the COPS (Version 3) collection of\nE. Dolan and J. More\nsee "Benchmarking Optimization Software with COPS"\nArgonne National Labs Technical Report ANL/MCS-246 (2004)\n\nAlexander S. Bondarenko - Summer 1998\nCOPS 2.0 - September 2000\nCOPS 3.0 - November 2002\nCOPS 3.1 - March 2004\n\nSIF input: Nick Gould, November 2000\n@techreport{DolanMore2004COPS,\n author = {Dolan, Elizabeth D. and Mor{'e}, Jorge J.},\n title = {Benchmarking Optimization Software with {COPS} 3.0},\n institution = {Argonne National Laboratory},\n number = {ANL/MCS-TM-273},\n year = {2004},\n doi = {10.2172/834714}\n }\n CUTEst:PINENE, COPS:5
346100true50truetruepolygonfalsefalsetruefalseotherlinear-InfInffalsemissingunknownhttps://bitbucket.org/optrove/sif/src/master/POLYGON.SIFFind the polygon of maximal area, among polygons with nv sides and diameter d <= 1\n\nThe initial guess is inspired from https://vanderbei.princeton.edu/ampl/nlmodels/polygon/polygon2.mod\n\nSee `polygon1`, `polygon2` and `polygon3` for similar variants.\n\nclassification OOR2-AN-V-V\nThis is problem 1 in the COPS (Version 3) collection of \nE. Dolan and J. More'\nsee "Benchmarking Optimization Software with COPS"\nArgonne National Labs Technical Report ANL/MCS-246 (2004)\n\nSIF input: Nick Gould, December 2000\n@techreport{DolanMore2004COPS,\n author = {Dolan, Elizabeth D. and Mor{'e}, Jorge J.},\n title = {Benchmarking Optimization Software with {COPS} 3.0},\n institution = {Argonne National Laboratory},\n number = {ANL/MCS-TM-273},\n year = {2004},\n doi = {10.2172/834714}\n }\n CUTEst:POLYGON, COPS:1
347100true50truetruepolygon1falsefalsetruefalseotherlinear-InfInffalsemissingunknownhttps://doi.org/10.2172/834714Find the polygon of maximal area, among polygons with nv sides and diameter d <= 1\n\nJuMP model follows Laurent Lessard CS/ECE/ISyE 524, University of Wisconsin–Madison, \nIntroduction to Optimization class.\nhttps://laurentlessard.com/teaching/524-intro-to-optimization/\n\nThis implementation is similar to\nThis is problem 1 in the COPS (Version 2) collection of \nE. Dolan and J. More'\nsee "Benchmarking Optimization Software with COPS"\nArgonne National Labs Technical Report ANL/MCS-246 (2000)\n\n@techreport{DolanMore2004COPS,\n author = {Dolan, Elizabeth D. and Mor{'e}, Jorge J.},\n title = {Benchmarking Optimization Software with {COPS} 3.0},\n institution = {Argonne National Laboratory},\n number = {ANL/MCS-TM-273},\n year = {2004},\n doi = {10.2172/834714}\n }\n
348100true1falsetruepolygon2truefalsetruefalseotherlinear-InfInffalsemissingunknownhttps://laurentlessard.com/teaching/524-intro-to-optimization/Find the polygon of maximal area, among polygons with nv sides and diameter d <= 1\nModel 2: relative polar coordinates\nJuMP model follows Laurent Lessard CS/ECE/ISyE 524, University of Wisconsin–Madison, \nIntroduction to Optimization class.\n@misc{Lessard524,\n author = {Lessard, Laurent},\n title = {Introduction to Optimization, {CS/ECE/ISyE} 524},\n howpublished = {Lecture notes, University of Wisconsin--Madison},\n url = {https://laurentlessard.com/teaching/524-intro-to-optimization/},\n}\n
349100true100truetruepolygon3falsetruefalsefalseothergeneral-Inf-0.0truemissingunknownhttps://laurentlessard.com/teaching/524-intro-to-optimization/Find the polygon of maximal area, among polygons with nv sides and diameter d <= 1\nModel 3: rectangular coordinates\nJuMP model follows Laurent Lessard CS/ECE/ISyE 524, University of Wisconsin–Madison, \nIntroduction to Optimization class.\n@misc{Lessard524,\n author = {Lessard, Laurent},\n title = {Introduction to Optimization, {CS/ECE/ISyE} 524},\n howpublished = {Lecture notes, University of Wisconsin--Madison},\n url = {https://laurentlessard.com/teaching/524-intro-to-optimization/},\n}\n
3502false0falsetruepowellbsfalsefalsefalsefalseotherunconstrained-Inf0.567631truemissingunknownhttps://bitbucket.org/optrove/sif/src/master/POWELLBS.SIFPowell badly scaled problem.\nThis problem is a sum of n-1 sets of 2 groups, both involving\nnonlinear elements and being of the least square type.\nIt Hessian matrix is tridiagonal.\n\nclassification NOR2-AN-2-2\nProblem 3 in\nJ.J. More', B.S. Garbow and K.E. Hillstrom,\n"Testing Unconstrained Optimization Software",\nACM Transactions on Mathematical Software, vol. 7(1), pp. 17-41, 1981.\nSee also Toint#34, Buckley#22 (p. 82).\n\nSIF input: Ph. Toint, Dec 1989.\n@article{MoreGarbowHillstrom1981,\n author = {Mor{\\'e}, Jorge J. and Garbow, Burton S. and Hillstrom, Kenneth E.},\n title = {Testing Unconstrained Optimization Software},\n journal = {ACM Transactions on Mathematical Software},\n year = {1981},\n volume = {7},\n number = {1},\n pages = {17--41},\n doi = {10.1145/355934.355936}\n} \n CUTEst:POWELLBS
351100true0falsetruepowellsgfalsefalsefalsefalseleast_squaresunconstrained-Inf5375.0truemissingunknownhttps://bitbucket.org/optrove/sif/src/master/POWELLSG.SIFThe extended Powell singular problem.\nThis problem is a sum of n/4 sets of four terms, each of which is assigned its own group.\n\nclassification OUR2-AN-V-0\n\nJ.-P. Dussault, Clermont-Ferrand 05/2016.\n\nDifference with the following is the initial guess.\nProblem 13 in\nJ.J. More', B.S. Garbow and K.E. Hillstrom,\n"Testing Unconstrained Optimization Software",\nACM Transactions on Mathematical Software, vol. 7(1), pp. 17-41, 1981.\nSee also Toint#19, Buckley#34 (p.85)\n\nSIF input: Ph. Toint, Dec 1989.\n@article{MoreGarbowHillstrom1981,\n author = {Mor{\\'e}, Jorge J. and Garbow, Burton S. and Hillstrom, Kenneth E.},\n title = {Testing Unconstrained Optimization Software},\n journal = {ACM Transactions on Mathematical Software},\n year = {1981},\n volume = {7},\n number = {1},\n pages = {17--41},\n doi = {10.1145/355934.355936}\n} \n CUTEst:POWELLSG, Luksan:47, LuksanSparse:3
352100true0falsetruepowerfalsefalsefalsefalseleast_squaresunconstrained-Inf2.55025e7truemissingunknownhttps://bitbucket.org/optrove/sif/src/master/POWER.SIFThe Power problem by Oren.\n\nclassification OUR2-AN-V-0\nS.S. Oren,\nSelf-scaling variable metric algorithms,\nPart II: implementation and experiments"\nManagement Science 20(5):863-874, 1974.\nSee also Buckley#179 (p. 83)\nSIF input: Ph. Toint, Dec 1989.\n@article{Oren1974,\n title = {Self-Scaling Variable Metric (SSVM) Algorithms: Part II: Implementation and Experiments},\n volume = {20},\n ISSN = {1526-5501},\n url = {https://doi.org/10.1287/mnsc.20.5.863},\n DOI = {10.1287/mnsc.20.5.863},\n number = {5},\n journal = {Management Science},\n publisher = {Institute for Operations Research and the Management Sciences (INFORMS)},\n author = {Oren, Shmuel S.},\n year = {1974},\n month = jan,\n pages = {863--874}\n}\nCUTEst:POWER
353100true0falsetruequartcfalsefalsefalsefalseotherunconstrained-Inf1.85427e9truemissingunknownhttps://bitbucket.org/optrove/sif/src/master/QUARTC.SIFA simple quartic function.\n\nclassification OUR2-AN-V-0\nproblem 157 (p. 87) in\nA.R. Buckley,\n"Test functions for unconstrained minimization",\nTR 1989CS-3, Mathematics, statistics and computing centre,\nDalhousie University, Halifax (CDN), 1989.\n\nSIF input: Ph. Toint, March 1991.\n@techreport{Buckley1989,\n author = {Buckley, A. R.},\n title = {Test Functions for Unconstrained Minimization},\n institution = {Mathematics, Statistics and Computing Centre, Dalhousie University},\n number = {TR 1989CS-3},\n year = {1989},\n address = {Halifax, Canada}\n}\n CUTEst:QUARTC
3543false0falsetruerat42falsefalsefalsefalseleast_squaresunconstrained-Inf500.0truemissingunknownhttps://bitbucket.org/optrove/sif/src/master/RAT42.SIFhttps://www.itl.nist.gov/div898/strd/nls/data/LINKS/DATA/rat42.dat\n\nNIST/ITL StRD\nDataset Name: Rat42 (Rat42.dat)\n\nFile Format: ASCII\n Starting Values (lines 41 to 43)\n Certified Values (lines 41 to 48)\n Data (lines 61 to 69)\n\nProcedure: Nonlinear Least Squares Regression\n\nDescription: This model and data are an example of fitting\n sigmoidal growth curves taken from Ratkowsky (1983).\n The response variable is pasture yield, and the\n predictor variable is growing time.\n\nReference: Ratkowsky, D.A. (1983). \n Nonlinear Regression Modeling.\n New York, NY: Marcel Dekker, pp. 61 and 88.\n\nData: 1 Response (y = pasture yield)\n 1 Predictor (x = growing time)\n 9 Observations\n Higher Level of Difficulty\n Observed Data\n\nModel: Exponential Class\n 3 Parameters (b1 to b3)\n\n y = b1 / (1+exp[b2-b3*x]) + e\n\nT. Migot, Montreal, 2023.\n\nNIST Data fitting problem RAT42 given as an inconsistent set of\nnonlinear equations.\nFit: y = b1 / (1+exp[b2-b3*x]) + e\n\nclassification NOR2-MN-3-9\nProblem from the NIST nonlinear regression test set\nhttp://www.itl.nist.gov/div898/strd/nls/nls_main.shtml\nReference: Ratkowsky, D.A. (1983). \nNonlinear Regression Modeling.\nNew York, NY: Marcel Dekker, pp. 61 and 88.\n\nSIF input: Nick Gould and Tyrone Rees, Oct 2015\n@book{Ratkowsky1983,\n author = {Ratkowsky, David A.},\n title = {Nonlinear Regression Modeling: A Unified Practical Approach},\n publisher = {Marcel Dekker},\n address = {New York},\n year = {1983}\n}\nCUTEst:RAT42, NIST:Rat42
3554false0falsetruerat43falsefalsefalsefalseleast_squaresunconstrained-Inf500.0truemissingunknownhttps://bitbucket.org/optrove/sif/src/master/RAT43.SIFhttps://www.itl.nist.gov/div898/strd/nls/data/LINKS/DATA/rat43.dat\n\nNIST/ITL StRD\nDataset Name: Rat43 (Rat43.dat)\n\nFile Format: ASCII\n Starting Values (lines 41 to 44)\n Certified Values (lines 41 to 49)\n Data (lines 61 to 75)\n\nProcedure: Nonlinear Least Squares Regression\n\nDescription: This model and data are an example of fitting \n sigmoidal growth curves taken from Ratkowsky (1983). \n The response variable is the dry weight of onion bulbs \n and tops, and the predictor variable is growing time. \n\nReference: Ratkowsky, D.A. (1983). \n Nonlinear Regression Modeling.\n New York, NY: Marcel Dekker, pp. 62 and 88.\n\nData: 1 Response (y = onion bulb dry weight)\n 1 Predictor (x = growing time)\n 15 Observations\n Higher Level of Difficulty\n Observed Data\n\nModel: Exponential Class\n 4 Parameters (b1 to b4)\n\n y = b1 / ((1+exp[b2-b3*x])**(1/b4)) + e\n\nT. Migot, Montreal, 2023.\n\nNIST Data fitting problem RAT43 given as an inconsistent set of\nnonlinear equations.\nFit: y = b1 / ((1+exp[b2-b3*x])**(1/b4)) + e\n\nclassification NOR2-MN-4-15\nProblem from the NIST nonlinear regression test set\nhttp://www.itl.nist.gov/div898/strd/nls/nls_main.shtml\nReference: Ratkowsky, D.A. (1983). \nNonlinear Regression Modeling.\nNew York, NY: Marcel Dekker, pp. 62 and 88.\n\nSIF input: Nick Gould and Tyrone Rees, Oct 2015\n@book{Ratkowsky1983,\n author = {Ratkowsky, David A.},\n title = {Nonlinear Regression Modeling: A Unified Practical Approach},\n publisher = {Marcel Dekker},\n address = {New York},\n year = {1983}\n}\nCUTEst:RAT43, NIST:Rat43
356109true102truetruerobotarmfalsefalsetruetrueothergeneral-InfInfmissingmissingunknownhttps://bitbucket.org/optrove/sif/src/master/ROBOTARM.SIFMinimize the time taken for a robot arm to travel between two points.\n\nclassification OOR2-AN-V-V\nThis is problem 8 in the COPS (Version 3) collection of \nE. Dolan and J. More\nsee "Benchmarking Optimization Software with COPS"\nArgonne National Labs Technical Report ANL/MCS-246 (2004)\n@techreport{DolanMore2004COPS,\n author = {Dolan, Elizabeth D. and Mor{'e}, Jorge J.},\n title = {Benchmarking Optimization Software with {COPS} 3.0},\n institution = {Argonne National Laboratory},\n number = {ANL/MCS-TM-273},\n year = {2004},\n doi = {10.2172/834714}\n }\n CUTEst:ROBOTARM, COPS:8
357405true304truefalserockettruefalsetruefalseothergeneral-InfInfmissingmissingunknownhttps://bitbucket.org/optrove/sif/src/master/ROCKET.SIFGoddard Rocket Problem\nTrapezoidal formulation\n\nMaximize the final altitude of a vertically-lauched rocket, using\nthe thrust as a control and given the initial mass, the fuel mass\nand the drag characteristics of the rocket.\n\nclassification OOR2-AN-V-V\nThis is problem 10 in the COPS (Version 2) collection of \nE. Dolan and J. More'\nsee "Benchmarking Optimization Software with COPS"\nArgonne National Labs Technical Report ANL/MCS-246 (2000)\n\nCOPS 2.0 - September 2000\nCOPS 3.0 - November 2002\nCOPS 3.1 - March 2004\n\nSIF input: Nick Gould, November 2000\n@techreport{DolanMore2004COPS,\n author = {Dolan, Elizabeth D. and Mor{'e}, Jorge J.},\n title = {Benchmarking Optimization Software with {COPS} 3.0},\n institution = {Argonne National Laboratory},\n number = {ANL/MCS-TM-273},\n year = {2004},\n doi = {10.2172/834714}\n }\n CUTEst:ROCKET, COPS:10
3582false0falsetruerosenbrockfalsefalsefalsefalseleast_squaresunconstrained-Inf32.3086truemissingunknownhttps://doi.org/10.1093/comjnl/3.3.175\n\n@article{Rosenbrock1960,\n author = {Rosenbrock, H. H.},\n title = {An Automatic Method for Finding the Greatest or Least Value of a Function},\n journal = {The Computer Journal},\n year = {1960},\n volume = {3},\n number = {3},\n pages = {175--184},\n doi = {10.1093/comjnl/3.3.175}\n}\n
3594false0falsetruerozman1falsefalsefalsefalseleast_squaresunconstrained-Inf500.0truemissingunknownhttps://www.itl.nist.gov/div898/strd/nls/data/LINKS/DATA/rozman1.dathttps://www.itl.nist.gov/div898/strd/nls/data/LINKS/DATA/rozman1.dat\n\nNIST/ITL StRD\nDataset Name: Roszman1 (Roszman1.dat)\n\nFile Format: ASCII\n Starting Values (lines 41 to 44)\n Certified Values (lines 41 to 49)\n Data (lines 61 to 85)\n\nProcedure: Nonlinear Least Squares Regression\n\nDescription: These data are the result of a NIST study involving\n quantum defects in iodine atoms. The response\n variable is the number of quantum defects, and the\n predictor variable is the excited energy state.\n The argument to the ARCTAN function is in radians.\n\nReference: Roszman, L., NIST (19??). \n Quantum Defects for Sulfur I Atom.\n\nData: 1 Response (y = quantum defect)\n 1 Predictor (x = excited state energy)\n 25 Observations\n Average Level of Difficulty\n Observed Data\n\nModel: Miscellaneous Class\n 4 Parameters (b1 to b4)\n\n pi = 3.141592653589793238462643383279E0\n y = b1 - b2*x - arctan[b3/(x-b4)]/pi + e\n\n@misc{NISTStRD,\n author = {{National Institute of Standards and Technology}},\n title = {{NIST/ITL StRD}: Nonlinear Regression Reference Datasets},\n howpublished = {\\url{https://www.itl.nist.gov/div898/strd/nls/nls_main.shtml}},\n year = {1997}\n}\nNIST:Roszman1
360100true0falsetruesbrybndfalsefalsefalsefalseleast_squaresunconstrained-Inf1568.0truemissingunknownhttps://bitbucket.org/optrove/sif/src/master/SBRYBND.SIFBroyden banded system of nonlinear equations, considered in the\nleast square sense.\nNB: scaled version of BRYBND\n\nclassification SUR2-AN-V-0\n\nThe terms in the sum should be squared --- corrected (it is not squared in Luksan, but\ncomparing it against their brybnd that appears to be a typo)\n\nJ.-P. Dussault, Clermont-Ferrand 05/2016.\nproblem 31 in\nJ.J. More', B.S. Garbow and K.E. Hillstrom,\n"Testing Unconstrained Optimization Software",\nACM Transactions on Mathematical Software, vol. 7(1), pp. 17-41, 1981.\nSee also Buckley#73 (p. 41) and Toint#18\n\nSIF input: Ph. Toint and Nick Gould, Nov 1997.\n@article{MoreGarbowHillstrom1981,\n author = {Mor{\\'e}, Jorge J. and Garbow, Burton S. and Hillstrom, Kenneth E.},\n title = {Testing Unconstrained Optimization Software},\n journal = {ACM Transactions on Mathematical Software},\n year = {1981},\n volume = {7},\n number = {1},\n pages = {17--41},\n doi = {10.1145/355934.355936}\n} \n CUTEst:SBRYBND, Luksan:48
361100true0falsetrueschmvettfalsefalsefalsefalseotherunconstrained-Inf-189.068truemissingunknownhttps://bitbucket.org/optrove/sif/src/master/SCHMVETT.SIFThe Schmidt and Vetters problem.\n\nThis problem has N-2 trivial groups, all of which have 3 nonlinear\nelements\n\nclassification OUR2-AY-V-0\n\nProblem 49 in\nL. Luksan, C. Matonoha and J. Vlcek\nModified CUTE problems for sparse unconstrained optimization,\nTechnical Report 1081,\nInstitute of Computer Science,\nAcademy of Science of the Czech Republic\nhttp://www.cs.cas.cz/matonoha/download/V1081.pdf\n\nJ.-P. Dussault, Clermont-Ferrand 05/2016.\nJ.W. Schmidt and K. Vetters,\n"Albeitungsfreie Verfahren fur Nichtlineare Optimierungsproblem",\nNumerische Mathematik 15:263-282, 1970.\nSee also Toint#35 and Buckley#14 (p90)\n\nSIF input: Ph. Toint, Dec 1989.\n@article{SchmidtVetters1970NM,\n author = {Schmidt, Jochen W. and Vetters, Klaus},\n title = {Ableitungsfreie {Verfahren} f{"u}r nichtlineare {Optimierungsprobleme}},\n journal = {Numerische Mathematik},\n year = {1970},\n volume = {15},\n number = {4},\n pages = {263--282},\n doi = {10.1007/BF02165118}\n} \n CUTEst:SCHMVETT, Luksan:49
362100true0falsetruescosinefalsefalsefalsefalseotherunconstrained-Inf86.8807truemissingunknownhttps://bitbucket.org/optrove/sif/src/master/SCOSINE.SIFAnother function with nontrivial groups and\nrepetitious elements.\nNB: scaled version of COSINE\n\nclassification OUR2-AN-V-0\n\nProblem 50 in\nL. Luksan, C. Matonoha and J. Vlcek\nModified CUTE problems for sparse unconstrained optimization,\nTechnical Report 1081,\nInstitute of Computer Science,\nAcademy of Science of the Czech Republic\nhttp://www.cs.cas.cz/matonoha/download/V1081.pdf\n\nJ.-P. Dussault, Clermont-Ferrand 05/2016.\n\nNote: discrepancy with CUTEst appears to be a bug in CUTEst, this matches the original paper\n(See issue #36)\nN. Gould, private communication.\n\nSIF input: N. Gould, Nov 1997\n@techreport{LuksanMatonohaVlcek2003,\n author = {Luksan, Ladislav and Matonoha, Cestmir and Vlcek, Jan},\n title = {Modified {CUTE} Problems for Sparse Unconstrained Optimization},\n institution = {Institute of Computer Science, Academy of Sciences of the Czech Republic},\n number = {1081},\n year = {2003},\n address = {Prague, Czech Republic},\n url = {http://www.cs.cas.cz/matonoha/download/V1081.pdf},\n } \n CUTEst:SCOSINE, Luksan:50
363100true0falsetruesinquadfalsefalsefalsefalseotherunconstrained-Inf0.6561truemissingunknownhttps://bitbucket.org/optrove/sif/src/master/SINQUAD.SIFAnother function with nontrivial groups and\n repetitious elements.\n\nclassification OUR2-AY-V-0\n\n Problem 51 in\n L. Luksan, C. Matonoha and J. Vlcek\n Modified CUTE problems for sparse unconstrained optimization,\n Technical Report 1081,\n Institute of Computer Science,\n Academy of Science of the Czech Republic\n http://www.cs.cas.cz/matonoha/download/V1081.pdf\n\n J.-P. Dussault, Clermont-Ferrand 05/2016.\nN. Gould, private communication.\n\nSIF input: N. Gould, Dec 1989.\n@techreport{LuksanMatonohaVlcek2003,\n author = {Luksan, Ladislav and Matonoha, Cestmir and Vlcek, Jan},\n title = {Modified {CUTE} Problems for Sparse Unconstrained Optimization},\n institution = {Institute of Computer Science, Academy of Sciences of the Czech Republic},\n number = {1081},\n year = {2003},\n address = {Prague, Czech Republic},\n url = {http://www.cs.cas.cz/matonoha/download/V1081.pdf},\n } \n CUTEst:SINQUAD, Luksan:51
364100true0falsetruesparsinefalsefalsefalsefalseotherunconstrained-Inf20893.3truemissingunknownhttps://bitbucket.org/optrove/sif/src/master/SPARSINE.SIFA sparse problem involving sine functions\n\nclassification OUR2-AN-V-0\n\n Problem 52 in\n L. Luksan, C. Matonoha and J. Vlcek\n Modified CUTE problems for sparse unconstrained optimization,\n Technical Report 1081,\n Institute of Computer Science,\n Academy of Science of the Czech Republic\n http://www.cs.cas.cz/matonoha/download/V1081.pdf\n\n J.-P. Dussault, Clermont-Ferrand 05/2016.\nSIF input: Nick Gould, November 1995\n@techreport{LuksanMatonohaVlcek2003,\n author = {Luksan, Ladislav and Matonoha, Cestmir and Vlcek, Jan},\n title = {Modified {CUTE} Problems for Sparse Unconstrained Optimization},\n institution = {Institute of Computer Science, Academy of Sciences of the Czech Republic},\n number = {1081},\n year = {2003},\n address = {Prague, Czech Republic},\n url = {http://www.cs.cas.cz/matonoha/download/V1081.pdf},\n } \n CUTEst:SPARSINE, Luksan:52
365100true0falsetruesparsqurfalsefalsefalsefalseotherunconstrained-Inf1420.31truemissingunknownhttps://bitbucket.org/optrove/sif/src/master/SPARSQUR.SIFA sparse quartic problem\n\nclassification OUR2-AN-V-0\n\n Problem 53 in\n L. Luksan, C. Matonoha and J. Vlcek\n Modified CUTE problems for sparse unconstrained optimization,\n Technical Report 1081,\n Institute of Computer Science,\n Academy of Science of the Czech Republic\n http://www.cs.cas.cz/matonoha/download/V1081.pdf\n\n J.-P. Dussault, Clermont-Ferrand 05/2016.\nSIF input: Nick Gould, November 1995\n@techreport{LuksanMatonohaVlcek2003,\n author = {Luksan, Ladislav and Matonoha, Cestmir and Vlcek, Jan},\n title = {Modified {CUTE} Problems for Sparse Unconstrained Optimization},\n institution = {Institute of Computer Science, Academy of Sciences of the Czech Republic},\n number = {1081},\n year = {2003},\n address = {Prague, Czech Republic},\n url = {http://www.cs.cas.cz/matonoha/download/V1081.pdf},\n } \n CUTEst:SPARSQUR, Luksan:53
366100true0falsetruespmsrtlsfalsefalsefalsefalseleast_squaresunconstrained-Inf49.3239truemissingunknownhttps://bitbucket.org/optrove/sif/src/master/SPMSRTLS.SIFLiu and Nocedal tridiagonal matrix square root problem.\n\nclassification SUR2-AN-V-V\nproblem 151 (p. 93) in\nA.R. Buckley,\n"Test functions for unconstrained minimization",\nTR 1989CS-3, Mathematics, statistics and computing centre,\nDalhousie University, Halifax (CDN), 1989.\nThis is a least-squares variant of problem SPMSQRT.\n\nSIF input: Ph. Toint, Dec 1989.\n@techreport{Buckley1989,\n author = {Buckley, A. G.},\n title = {Test functions for unconstrained minimization},\n institution = {Computing Science Division, Dalhousie University},\n address = {Dalhousie, Canada},\n number = {CS-3},\n year = {1989}\n} \n CUTEst:SPMSRTLS, Luksan:54
367100true0falsetruesrosenbrfalsefalsefalsefalseotherunconstrained-Inf1210.0truemissingunknownhttps://bitbucket.org/optrove/sif/src/master/SROSENBR.SIFThe separable extension of Rosenbrock's function.\n\nclassification SUR2-AN-V-0\n\n Problem 55 in\n L. Luksan, C. Matonoha and J. Vlcek\n Modified CUTE problems for sparse unconstrained optimization,\n Technical Report 1081,\n Institute of Computer Science,\n Academy of Science of the Czech Republic\n http://www.cs.cas.cz/matonoha/download/V1081.pdf\n\n J.-P. Dussault, Clermont-Ferrand 05/2016.\n@article{MoreGarbowHillstrom1981,\n author = {Mor{\\'e}, Jorge J. and Garbow, Burton S. and Hillstrom, Kenneth E.},\n title = {Testing Unconstrained Optimization Software},\n journal = {ACM Transactions on Mathematical Software},\n year = {1981},\n volume = {7},\n number = {1},\n pages = {17--41},\n doi = {10.1145/355934.355936}\n}\n\nproblem 21 in\nJ.J. More', B.S. Garbow and K.E. Hillstrom,\n"Testing Unconstrained Optimization Software",\nACM Transactions on Mathematical Software, vol. 7(1), pp. 17-41, 1981.\n\nSIF input: Ph. Toint, Dec 1989.\n@article{MoreGarbowHillstrom1981,\n author = {Mor{\\'e}, Jorge J. and Garbow, Burton S. and Hillstrom, Kenneth E.},\n title = {Testing Unconstrained Optimization Software},\n journal = {ACM Transactions on Mathematical Software},\n year = {1981},\n volume = {7},\n number = {1},\n pages = {17--41},\n doi = {10.1145/355934.355936}\n} \n CUTEst:SROSENBR, Luksan:55
368506true408truetruesteeringfalsefalsetruefalseothergeneral-InfInfmissingmissingunknownhttps://bitbucket.org/optrove/sif/src/master/STEERING.SIFRocket Steering Problem\n\n Minimize the time taken for a particle, acted upon by a thrust of \nconstant magnitude, to achieve a given altitude and terminal velocity\n\n Trapezoidal formulation\n\nclassification LOR2-AN-V-V\nThis is problem 9 in the COPS (Version 2) collection of \nE. Dolan and J. More'\nsee "Benchmarking Optimization Software with COPS"\nArgonne National Labs Technical Report ANL/MCS-246 (2000)\n\nCOPS 2.0 - September 2000\nCOPS 3.0 - November 2002\nCOPS 3.1 - March 2004\n\nSIF input: Nick Gould, December 2000\n@techreport{DolanMore2004COPS,\n author = {Dolan, Elizabeth D. and Mor{'e}, Jorge J.},\n title = {Benchmarking Optimization Software with {COPS} 3.0},\n institution = {Argonne National Laboratory},\n number = {ANL/MCS-TM-273},\n year = {2004},\n doi = {10.2172/834714}\n }\n CUTEst:STEERING, COPS:9
369600true44truetruestructuralfalsefalsetruefalseotherlinear-InfInfmissingmissingunknownhttps://laurentlessard.com/teaching/524-intro-to-optimization/JuMP model follows Laurent Lessard CS/ECE/ISyE 524, University of Wisconsin–Madison, \n Introduction to Optimization class.\n\n@misc{Lessard524,\n author = {Lessard, Laurent},\n title = {Introduction to Optimization, {CS/ECE/ISyE} 524},\n howpublished = {Lecture notes, University of Wisconsin--Madison},\n url = {https://laurentlessard.com/teaching/524-intro-to-optimization/},\n}\n
37015false4falsetruetetrafalsetruetruetrueothergeneral-InfInfmissingmissingunknownhttps://doi.org/10.2172/834714Minimize the sum of the inverse weighted mean ratio of the elements in a fixed–boundary\ntetrahedral mesh by adjusting the locations of the free vertices.\nThis is problem 19 in the COPS (Version 3) collection of \nE. Dolan and J. More\nsee "Benchmarking Optimization Software with COPS"\nArgonne National Labs Technical Report ANL/MCS-246 (2004)\n@techreport{DolanMore2004COPS,\n author = {Dolan, Elizabeth D. and Mor{'e}, Jorge J.},\n title = {Benchmarking Optimization Software with {COPS} 3.0},\n institution = {Argonne National Laboratory},\n number = {ANL/MCS-TM-273},\n year = {2004},\n doi = {10.2172/834714}\n }\n COPS:19
37112597false19222falsetruetetra_duct12falsetruetruetrueothergeneral-Inf23246.1truemissingunknownhttps://doi.org/10.2172/834714\n\n@techreport{DolanMore2004COPS,\n author = {Dolan, Elizabeth D. and Mor{'e}, Jorge J.},\n title = {Benchmarking Optimization Software with {COPS} 3.0},\n institution = {Argonne National Laboratory},\n number = {ANL/MCS-TM-273},\n year = {2004},\n doi = {10.2172/834714}\n }\n COPS:19
3726417false9000falsetruetetra_duct15falsetruetruetrueothergeneral-Inf10890.9truemissingunknownhttps://doi.org/10.2172/834714\n\n@techreport{DolanMore2004COPS,\n author = {Dolan, Elizabeth D. and Mor{'e}, Jorge J.},\n title = {Benchmarking Optimization Software with {COPS} 3.0},\n institution = {Argonne National Laboratory},\n number = {ANL/MCS-TM-273},\n year = {2004},\n doi = {10.2172/834714}\n }\n COPS:19
3733201false4104falsetruetetra_duct20falsetruetruetrueothergeneral-Inf4959.8truemissingunknownhttps://doi.org/10.2172/834714\n\n@techreport{DolanMore2004COPS,\n author = {Dolan, Elizabeth D. and Mor{'e}, Jorge J.},\n title = {Benchmarking Optimization Software with {COPS} 3.0},\n institution = {Argonne National Laboratory},\n number = {ANL/MCS-TM-273},\n year = {2004},\n doi = {10.2172/834714}\n }\n COPS:19
3744011false4847falsetruetetra_foam5falsetruetruetrueothergeneral-Inf6497.1truemissingunknownhttps://doi.org/10.2172/834714\n\n@techreport{DolanMore2004COPS,\n author = {Dolan, Elizabeth D. and Mor{'e}, Jorge J.},\n title = {Benchmarking Optimization Software with {COPS} 3.0},\n institution = {Argonne National Laboratory},\n number = {ANL/MCS-TM-273},\n year = {2004},\n doi = {10.2172/834714}\n }\n COPS:19
3752598false3116falsetruetetra_gearfalsetruetruetrueothergeneral-Inf4256.38truemissingunknownhttps://doi.org/10.2172/834714\n\n@techreport{DolanMore2004COPS,\n author = {Dolan, Elizabeth D. and Mor{'e}, Jorge J.},\n title = {Benchmarking Optimization Software with {COPS} 3.0},\n institution = {Argonne National Laboratory},\n number = {ANL/MCS-TM-273},\n year = {2004},\n doi = {10.2172/834714}\n }\n COPS:19
3763570false4675falsetruetetra_hookfalsetruetruetrueothergeneral-Inf6157.14truemissingunknownhttps://doi.org/10.2172/834714\n\n@techreport{DolanMore2004COPS,\n author = {Dolan, Elizabeth D. and Mor{'e}, Jorge J.},\n title = {Benchmarking Optimization Software with {COPS} 3.0},\n institution = {Argonne National Laboratory},\n number = {ANL/MCS-TM-273},\n year = {2004},\n doi = {10.2172/834714}\n }\n COPS:19
37730false0falsetruethreepkfalsefalsetruefalseotherunconstrained-Inf20236.5truemissingunknownhttps://bitbucket.org/optrove/sif/src/master/3PK.SIFA problem arising in the estimation of structured O/D matrix\nConverted in Julia from https://github.com/mpf/Optimization-Test-Problems\n\nM. Bierlaire, private communication\n see also\n M. Bierlaire and Ph. L. Toint,\n MEUSE: an origin-destination estimator that exploits structure,\n Transportation Research B, 29, 1, 47--60, 1995.\n SIF input: Ph. Toint, Dec 1989, Corrected July 1993.\n classification SUR2-MN-30-0\n@article{Bierlaire1995,\n title = {Meuse: An origin-destination matrix estimator that exploits structure},\n volume = {29},\n ISSN = {0191-2615},\n url = {https://doi.org/10.1016/0191-2615(94)00025-U},\n DOI = {10.1016/0191-2615(94)00025-u},\n number = {1},\n journal = {Transportation Research Part B: Methodological},\n publisher = {Elsevier BV},\n author = {Bierlaire, M. and Toint, Ph.L.},\n year = {1995},\n month = feb,\n pages = {47--60}\n}\nCUTEst:3PK
3787false0falsetruethurberfalsefalsefalsefalseleast_squaresunconstrained-Inf500.0truemissingunknownhttps://bitbucket.org/optrove/sif/src/master/THURBER.SIFhttps://www.itl.nist.gov/div898/strd/nls/data/LINKS/DATA/thurber.dat\n\nNIST/ITL StRD\nDataset Name: Thurber (Thurber.dat)\n\nFile Format: ASCII\n Starting Values (lines 41 to 47)\n Certified Values (lines 41 to 52)\n Data (lines 61 to 97)\n\nProcedure: Nonlinear Least Squares Regression\n\nDescription: These data are the result of a NIST study involving\n semiconductor electron mobility. The response \n variable is a measure of electron mobility, and the \n predictor variable is the natural log of the density.\n\nReference: Thurber, R., NIST (197?). \n Semiconductor electron mobility modeling.\n\nData: 1 Response Variable (y = electron mobility)\n 1 Predictor Variable (x = log[density])\n 37 Observations\n Higher Level of Difficulty\n Observed Data\n\nModel: Rational Class (cubic/cubic)\n 7 Parameters (b1 to b7)\n\n y = (b1 + b2*x + b3*x**2 + b4*x**3) / \n (1 + b5*x + b6*x**2 + b7*x**3) + e\nT. Migot, Montreal, 2023.\n\nNIST Data fitting problem THURBER given as an inconsistent set of\nnonlinear equations.\nFit: y = (b1 + b2*x + b3*x**2 + b4*x**3) / \n(1 + b5*x + b6*x**2 + b7*x**3) + e\n\nclassification NOR2-MN-7-37\nProblem from the NIST nonlinear regression test set\nhttp://www.itl.nist.gov/div898/strd/nls/nls_main.shtml\nReference: Thurber, R., NIST (197?). \nSemiconductor electron mobility modeling.\n\nSIF input: Nick Gould and Tyrone Rees, Oct 2015\n@misc{NISTStRD,\n author = {{National Institute of Standards and Technology}},\n title = {{NIST/ITL StRD}: Nonlinear Regression Reference Datasets},\n howpublished = {\\url{https://www.itl.nist.gov/div898/strd/nls/nls_main.shtml}},\n year = {1997}\n}\nCUTEst:THURBER, NIST:Thurber
379100true0falsetruetointfalsefalsefalsefalseotherunconstrained-Inf-0.85984truemissingunknownhttps://www.researchgate.net/publication/325314400_Sparse_Test_Problems_for_Unconstrained_OptimizationToint trigonometric function\nProblem 10 in\n L. Luksan, C. Matonoha and J. Vlcek\n Sparse Test Problems for Unconstrained Optimization,\n Technical Report 1064,\n Institute of Computer Science,\n Academy of Science of the Czech Republic\n@techreport{LuksanMatonohaVlcek2010Sparse,\n author = {Luksan, Ladislav and Matonoha, Ctirad and Vlcek, Jan},\n title = {Sparse Test Problems for Unconstrained Optimization},\n institution = {Institute of Computer Science, Academy of Sciences of the Czech Republic},\n number = {V-1064},\n year = {2010},\n address = {Prague, Czech Republic},\n url = {https://www.researchgate.net/publication/325314400_Sparse_Test_Problems_for_Unconstrained_Optimization}\n}\n LuksanSparse:10
380100true0falsetruetointgssfalsefalsefalsefalseotherunconstrained-Inf891.608truemissingunknownhttps://bitbucket.org/optrove/sif/src/master/TOINTGSS.SIFToint's Gaussian problem.\n\n This problem has N-2 trivial groups, all of which have 1 nonlinear\n element\n\nclassification OUR2-AY-V-0\n\n Problem 56 in\n L. Luksan, C. Matonoha and J. Vlcek\n Modified CUTE problems for sparse unconstrained optimization,\n Technical Report 1081,\n Institute of Computer Science,\n Academy of Science of the Czech Republic\n http://www.cs.cas.cz/matonoha/download/V1081.pdf\n\n J.-P. Dussault, Clermont-Ferrand 05/2016.\nproblem 21 in\nPh.L. Toint,\n"Test problems for partially separable optimization and results\nfor the routine PSPMIN",\nReport 83/4, Department of Mathematics, FUNDP (Namur, B), 1983.\n\nSIF input: Ph. Toint, Dec 1989, corrected Nick Gould, July 1993.\n@techreport{Toint1983,\n author = {Ph. L. Toint},\n title = {Test problems for partially separable optimization and results for the routine PSPMIN},\n institution = {Department of Mathematics, FUNDP (Namur, Belgium)},\n number = {Report 83/4},\n year = {1983}\n} \n CUTEst:TOINTGSS, Luksan:56
381144true144truetruetorsionfalsefalsefalsefalseotherlinear-Inf-0.330579truemissingunknownhttps://doi.org/10.2172/834714Torsion problem\nLiz Dolan - Summer 2000\n Version 2.0 - October 2000\n COPS 3.1 - March 2004\n@techreport{DolanMore2004COPS,\n author = {Dolan, Elizabeth D. and Mor{'e}, Jorge J.},\n title = {Benchmarking Optimization Software with {COPS} 3.0},\n institution = {Argonne National Laboratory},\n number = {ANL/MCS-TM-273},\n year = {2004},\n doi = {10.2172/834714}\n }\n COPS:15
382100true0falsetruetquarticfalsefalsefalsefalseleast_squaresunconstrained-Inf0.81truemissingunknownhttps://bitbucket.org/optrove/sif/src/master/TQUARTIC.SIFA quartic function with nontrivial groups and\n repetitious elements.\n\nclassification SUR2-AN-V-0#\n\n Problem 57 in\n L. Luksan, C. Matonoha and J. Vlcek\n Modified CUTE problems for sparse unconstrained optimization,\n Technical Report 1081,\n Institute of Computer Science,\n Academy of Science of the Czech Republic\n http://www.cs.cas.cz/matonoha/download/V1081.pdf\n\n J.-P. Dussault, Clermont-Ferrand 05/2016.\nPh. Toint, private communication.\n\nSIF input: Ph. Toint, Dec 1989.\n@techreport{LuksanMatonohaVlcek2003,\n author = {Luksan, Ladislav and Matonoha, Cestmir and Vlcek, Jan},\n title = {Modified {CUTE} Problems for Sparse Unconstrained Optimization},\n institution = {Institute of Computer Science, Academy of Sciences of the Czech Republic},\n number = {1081},\n year = {2003},\n address = {Prague, Czech Republic},\n url = {http://www.cs.cas.cz/matonoha/download/V1081.pdf},\n } \n CUTEst:TQUARTIC, Luksan:57
3838false3falsetruetrianglefalsetruetruetrueothergeneral-Inf11.328truemissingunknownhttps://doi.org/10.2172/834714Minimize the time taken for a robot arm to travel between two points.\nThis is problem 18 in the COPS (Version 3) collection of \nE. Dolan and J. More\nsee "Benchmarking Optimization Software with COPS"\nArgonne National Labs Technical Report ANL/MCS-246 (2004)\n@techreport{DolanMore2004COPS,\n author = {Dolan, Elizabeth D. and Mor{'e}, Jorge J.},\n title = {Benchmarking Optimization Software with {COPS} 3.0},\n institution = {Argonne National Laboratory},\n number = {ANL/MCS-TM-273},\n year = {2004},\n doi = {10.2172/834714}\n }\n COPS:18
3842244false1896falsetruetriangle_deerfalsetruetruetrueothergeneral-Inf2014.34truemissingunknownhttps://doi.org/10.2172/834714\n\n@techreport{DolanMore2004COPS,\n author = {Dolan, Elizabeth D. and Mor{'e}, Jorge J.},\n title = {Benchmarking Optimization Software with {COPS} 3.0},\n institution = {Argonne National Laboratory},\n number = {ANL/MCS-TM-273},\n year = {2004},\n doi = {10.2172/834714}\n }\n COPS:18
3851366false1182falsetruetriangle_pacmanfalsetruetruetrueothergeneral-Inf1316.28truemissingunknownhttps://doi.org/10.2172/834714\n\n@techreport{DolanMore2004COPS,\n author = {Dolan, Elizabeth D. and Mor{'e}, Jorge J.},\n title = {Benchmarking Optimization Software with {COPS} 3.0},\n institution = {Argonne National Laboratory},\n number = {ANL/MCS-TM-273},\n year = {2004},\n doi = {10.2172/834714}\n }\n COPS:18
3864444false4025falsetruetriangle_turtlefalsetruetruetrueothergeneral-Inf4467.58truemissingunknownhttps://doi.org/10.2172/834714\n\n@techreport{DolanMore2004COPS,\n author = {Dolan, Elizabeth D. and Mor{'e}, Jorge J.},\n title = {Benchmarking Optimization Software with {COPS} 3.0},\n institution = {Argonne National Laboratory},\n number = {ANL/MCS-TM-273},\n year = {2004},\n doi = {10.2172/834714}\n }\n COPS:18
387100true0falsetruetridiafalsefalsefalsefalseotherunconstrained-Inf5049.0truemissingunknownhttps://bitbucket.org/optrove/sif/src/master/TRIDIA.SIFShanno's TRIDIA quadratic tridiagonal problem.\n\n This problem is decomposed in n linear groups, the last n-1 of which\n are 2 x 2 and singular.\n\nclassification QUR2-AN-V-0\nProblem 8 in\nPh.L. Toint,\n"Test problems for partially separable optimization and results\nfor the routine PSPMIN",\nReport 83/4, Department of Mathematics, FUNDP (Namur, B), 1983.\nSee also Buckley#40 (p.96)\nSIF input: Ph. Toint, Dec 1989.\n@techreport{Toint1983,\n author = {Ph. L. Toint},\n title = {Test problems for partially separable optimization and results for the routine PSPMIN},\n institution = {Department of Mathematics, FUNDP (Namur, Belgium)},\n number = {Report 83/4},\n year = {1983}\n} \n CUTEst:TRIDIA
388100true0falsetruetrigfalsefalsefalsefalseotherunconstrained-Inf61.4825truemissingunknownhttps://www.researchgate.net/publication/325314400_Sparse_Test_Problems_for_Unconstrained_OptimizationAnother trigonometric function\nProblem 9 in\n L. Luksan, C. Matonoha and J. Vlcek\n Sparse Test Problems for Unconstrained Optimization,\n Technical Report 1064,\n Institute of Computer Science,\n Academy of Science of the Czech Republic\n@techreport{LuksanMatonohaVlcek2010Sparse,\n author = {Luksan, Ladislav and Matonoha, Ctirad and Vlcek, Jan},\n title = {Sparse Test Problems for Unconstrained Optimization},\n institution = {Institute of Computer Science, Academy of Sciences of the Czech Republic},\n number = {V-1064},\n year = {2010},\n address = {Prague, Czech Republic},\n url = {https://www.researchgate.net/publication/325314400_Sparse_Test_Problems_for_Unconstrained_Optimization}\n}\n LuksanSparse:9
389100true0falsetruetrigbfalsefalsefalsefalseotherunconstrained-Inf2404.78truemissingunknownhttps://www.researchgate.net/publication/325314400_Sparse_Test_Problems_for_Unconstrained_OptimizationBanded trigonometric problem\nProblem 16 in\n L. Luksan, C. Matonoha and J. Vlcek\n Sparse Test Problems for Unconstrained Optimization,\n Technical Report 1064,\n Institute of Computer Science,\n Academy of Science of the Czech Republic\n@techreport{LuksanMatonohaVlcek2010Sparse,\n author = {Luksan, Ladislav and Matonoha, Ctirad and Vlcek, Jan},\n title = {Sparse Test Problems for Unconstrained Optimization},\n institution = {Institute of Computer Science, Academy of Sciences of the Czech Republic},\n number = {V-1064},\n year = {2010},\n address = {Prague, Czech Republic},\n url = {https://www.researchgate.net/publication/325314400_Sparse_Test_Problems_for_Unconstrained_Optimization}\n}\n LuksanSparse:16
390100true0falsetruevardimfalsefalsefalsefalseotherunconstrained-Inf1.31058e14truemissingunknownhttps://bitbucket.org/optrove/sif/src/master/VARDIM.SIFVariable dimension problem.\n This problem is a sum of n+2 least-squares groups, the first n of\n which have only a linear element.\n It Hessian matrix is dense.\n\nclassification OUR2-AN-V-0\nProblem 25 in\nJ.J. More', B.S. Garbow and K.E. Hillstrom,\n"Testing Unconstrained Optimization Software",\nACM Transactions on Mathematical Software, vol. 7(1), pp. 17-41, 1981.\nSee also Buckley#72 (p.98).\nSIF input: Ph. Toint, Dec 1989.\n@article{MoreGarbowHillstrom1981,\n author = {Mor{\\'e}, Jorge J. and Garbow, Burton S. and Hillstrom, Kenneth E.},\n title = {Testing Unconstrained Optimization Software},\n journal = {ACM Transactions on Mathematical Software},\n year = {1981},\n volume = {7},\n number = {1},\n pages = {17--41},\n doi = {10.1145/355934.355936}\n}\nCUTEst:VARDIM
391100true0falsetruevariationalfalsefalsefalsefalseotherunconstrained-InfInftruefalseacademichttps://www.researchgate.net/publication/325314400_Sparse_Test_Problems_for_Unconstrained_OptimizationDiscretization of a variational problem\n\n Problem 15 in\n L. Luksan, C. Matonoha and J. Vlcek\n Sparse Test Problems for Unconstrained Optimization,\n Technical Report 1064,\n Institute of Computer Science,\n Academy of Science of the Czech Republic\n\n https://www.researchgate.net/publication/325314400_Sparse_Test_Problems_for_Unconstrained_Optimization\n\n@techreport{LuksanMatonohaVlcek2010Sparse,\n author = {Luksan, Ladislav and Matonoha, Ctirad and Vlcek, Jan},\n title = {Sparse Test Problems for Unconstrained Optimization},\n institution = {Institute of Computer Science, Academy of Sciences of the Czech Republic},\n number = {V-1064},\n year = {2010},\n address = {Prague, Czech Republic},\n url = {https://www.researchgate.net/publication/325314400_Sparse_Test_Problems_for_Unconstrained_Optimization}\n }\n LuksanSparse:15
3928false0falsetruevibrbeamfalsefalsefalsefalseleast_squaresunconstrained-Inf8231.28truemissingunknownhttps://bitbucket.org/optrove/sif/src/master/VIBRBEAM.SIFA nonlinear least-squares problem arising from laser-Doppler\n measurements of a vibrating beam. The data correspond to a simulated\n experiment where two laser-Doppler velocimeters take measurements\n at random points along the centreline of the beam. These measurements\n consist of a position (x), an incident angle (p) and the magnitude\n of the velocity along the line of sight (v).\n The problem is then to fit\n\n 2 3 2 3\n v = (c + c x + c x + c x ) cos[ d + d x + d x + d x - p ]\n 0 1 2 3 0 1 2 3\n <---- magnitude -----> <------ phase ----->\n\n in the least-squares sense.\n\nclassification SUR2-MN-8-0\nA modification of an exercize for L. Watson course on LANCELOT in\nthe Spring 1993. Compared to the original proposal, the unnecessary\nelements were removed as well as an unnecessary constraint on the phase.\nSIF input: Ph. L. Toint, May 1993, based on a proposal by\nD. E. Montgomery, Virginia Tech., April 1993.\n@article{Gould2015CUTEst,\n author = {Gould, N. I. M. and Orban, D. and Toint, Ph. L.},\n title = {{CUTEst}: a Constrained and Unconstrained Testing Environment with safe threads for mathematical optimization},\n journal = {Computational Optimization and Applications},\n year = {2015},\n volume = {60},\n number = {3},\n pages = {545--557},\n doi = {10.1007/s10589-014-9687-3}\n}\nCUTEst:VIBRBEAM
39331false0falsetruewatsonfalsefalsefalsefalseleast_squaresunconstrained-Inf500.0truemissingunknownhttps://bitbucket.org/optrove/sif/src/master/WATSON.SIFWatson problem in varaible dimension ( 2 <= n <= 31 ).\n This function is a nonlinear least squares with 31 groups.\n\nclassification SUR2-AN-V-0\nproblem 20 in\nJ.J. More', B.S. Garbow and K.E. Hillstrom,\n"Testing Unconstrained Optimization Software",\nACM Transactions on Mathematical Software, vol. 7(1), pp. 17-41, 1981.\nSee also Buckley#128 (p. 100).\n\nSIF input: Ph. Toint, Dec 1989.\n@article{MoreGarbowHillstrom1981,\n author = {Mor{\\'e}, Jorge J. and Garbow, Burton S. and Hillstrom, Kenneth E.},\n title = {Testing Unconstrained Optimization Software},\n journal = {ACM Transactions on Mathematical Software},\n year = {1981},\n volume = {7},\n number = {1},\n pages = {17--41},\n doi = {10.1145/355934.355936}\n} \n CUTEst:WATSON
394100true0falsetruewoodsfalsefalsefalsefalseotherunconstrained-Inf180451.0truemissingunknownhttps://bitbucket.org/optrove/sif/src/master/WOODS.SIFThe extended Woods problem.\n\n This problem is a sum of n/4 sets of 6 terms, each of which is\n assigned its own group. For a given set i, the groups are\n A(i), B(i), C(i), D(i), E(i) and F(i). Groups A(i) and C(i) contain 1\n nonlinear element each, denoted Y(i) and Z(i).\n\n The problem dimension is defined from the number of these sets.\n The number of problem variables is then 4 times larger.\n\n This version uses a slightly unorthodox expression of Woods\n function as a sum of squares (see Buckley)\n\nclassification SUR2-AN-V-0\n\n See also\n\n problem 58 in\n L. Luksan, C. Matonoha and J. Vlcek\n Modified CUTE problems for sparse unconstrained optimization,\n Technical Report 1081,\n Institute of Computer Science,\n Academy of Science of the Czech Republic\n\n http://www.cs.cas.cz/matonoha/download/V1081.pdf\n\n classification SUR2-AN-V-0\n\n J.-P. Dussault, Clermont-Ferrand, 05/2016.\nproblem 14 in\nJ.J. More', B.S. Garbow and K.E. Hillstrom,\n"Testing Unconstrained Optimization Software",\nACM Transactions on Mathematical Software, vol. 7(1), pp. 17-41, 1981.\nSee also Toint#27, Buckley#17 (p. 101), Conn, Gould, Toint#7\n\nSIF input: Ph. Toint, Dec 1989.\n@article{MoreGarbowHillstrom1981,\n author = {Mor{\\'e}, Jorge J. and Garbow, Burton S. and Hillstrom, Kenneth E.},\n title = {Testing Unconstrained Optimization Software},\n journal = {ACM Transactions on Mathematical Software},\n year = {1981},\n volume = {7},\n number = {1},\n pages = {17--41},\n doi = {10.1145/355934.355936}\n} \nCUTEst:WOODS, Luksan:58
3953false3falsetruezangwil3truefalsefalsefalseotherlinear-InfInfmissingmissingunknownhttps://bitbucket.org/optrove/sif/src/master/ZANGWIL3.SIFZangwill's problem in 3 variables.\n\nclassification NLR2-AN-3-3\n\n A. Cebola, Paraná 10/2016.\nproblem 1 in\n P.T. Boggs and J.W. Tolle,\n "A strategy for global convergence in a sequential\n quadratic programming algorithm",\n SINUM 26(3), pp. 600-623, 1989.\n\nProblem from CUTE: https://github.com/mpf/Optimization-Test-Problems/blob/master/cute/zangwil3.mod\n\nproblem 13 (p. 103) in\nA.R. Buckley,\n"Test functions for unconstrained minimization",\nTR 1989CS-3, Mathematics, statistics and computing centre,\nDalhousie University, Halifax (CDN), 1989.\n\nSIF input: Ph. Toint, Dec 1989.\n@article{BoggsTolle1989,\n author = {Boggs, Paul T. and Tolle, Jon W.},\n title = {A Strategy for Global Convergence in a Sequential Quadratic Programming Algorithm},\n journal = {SIAM Journal on Numerical Analysis},\n year = {1989},\n volume = {26},\n number = {3},\n pages = {600--623},\n doi = {10.1137/0726036}\n}\nCUTEst:ZANGWIL3

Then, it is very simple to filter problems using queries on DataFrame. We refer to the documentation of DataFrames.jl for tutorials. For instance, if one wants to select unconstrained scalable problems and use (:nvar, :name).

meta = OptimizationProblems.meta
names_pb_vars = meta[(meta.variable_nvar .== true) .& (meta.ncon .== 0), [:nvar, :name]]
92×2 DataFrame
Rownvarname
Int64String
191NZF1
2100arglina
3100arglinb
4100arglinc
5100argtrig
6100arwhead
7100auglag
8100bdqrtic
9100bearing
10100boundary
11100brownal
12100browngen1
13100browngen2
14100broyden3d
15100broyden7d
16100broydn7d
17100brybnd
18100chainwoo
19100chnrosnb_mod
20100clplatea
21100clplateb
22100clplatec
23100cosine
24100cragglvy
25100cragglvy2
26100curly
27100curly10
28100curly20
29100curly30
3099dixmaane
3199dixmaanf
3299dixmaang
3399dixmaanh
3499dixmaani
3599dixmaanj
3699dixmaank
3799dixmaanl
3899dixmaanm
3999dixmaann
4099dixmaano
4199dixmaanp
42100dixon3dq
43100dqdrtic
44100dqrtic
45100edensch
46100eg2
47100engval1
48100errinros_mod
49100extrosnb
50100fletcbv2
51100fletcbv3_mod
52100fletchcr
53100freuroth
54100genbroydenb
55100genbroydentri
56100genhumps
57100genrose
58100genrose_nash
59100indef_mod
60100integreq
61100liarwhd
62100morebv
63100nazareth
64100ncb20
65100ncb20b
66100noncvxu2
67100noncvxun
68100nondia
69100nondquar
70100penalty1
71100penalty2
72100penalty3
73100powellsg
74100power
75100quartc
76100sbrybnd
77100schmvett
78100scosine
79100sinquad
80100sparsine
81100sparsqur
82100spmsrtls
83100srosenbr
84100toint
85100tointgss
86100tquartic
87100tridia
88100trig
89100trigb
90100vardim
91100variational
92100woods

Then, one can prepare a list of problems using the selected ones.

using ADNLPModels
adproblems = (
  eval(Meta.parse("ADNLPProblems.$(pb[:name])()")) for pb in eachrow(names_pb_vars)
)
Base.Generator{DataFrames.DataFrameRows{DataFrames.DataFrame}, Main.var"#2#3"}(Main.var"#2#3"(), 92×2 DataFrameRows
 Row │ nvar   name
     │ Int64  String
─────┼────────────────────
   1 │    91  NZF1
   2 │   100  arglina
   3 │   100  arglinb
   4 │   100  arglinc
   5 │   100  argtrig
   6 │   100  arwhead
   7 │   100  auglag
   8 │   100  bdqrtic
  ⋮  │   ⋮         ⋮
  86 │   100  tquartic
  87 │   100  tridia
  88 │   100  trig
  89 │   100  trigb
  90 │   100  vardim
  91 │   100  variational
  92 │   100  woods
           77 rows omitted)

Nonlinear Least Squares Problems (NLS)

Problems with :objtype set to :least_squares are nonlinear least squares problems (NLS). For these, you can access the number of NLS equations using a getter like get_nameoftheproblem_nls_nequ().

OptimizationProblems.get_lanczos1_nls_nequ()
24

To filter all NLS problems in the metadata DataFrame:

nls_problems = OptimizationProblems.meta[OptimizationProblems.meta.objtype .== :least_squares, :name]
92-element Vector{String}:
 "NZF1"
 "arglina"
 "arglinb"
 "avion2"
 "bard"
 "bdqrtic"
 "beale"
 "bennett5"
 "boundary"
 "boxbod"
 ⋮
 "rat43"
 "rosenbrock"
 "rozman1"
 "sbrybnd"
 "spmsrtls"
 "thurber"
 "tquartic"
 "vibrbeam"
 "watson"

Test-set membership (:lib)

The :lib column records membership in named optimization test-set collections. Each entry is a comma-separated list of "Collection:ID" pairs; an empty string means the problem has no known test-set membership.

OptimizationProblems.hs1_meta[:lib]  # "CUTEst:HS1, HS:1"
"CUTEst:HS1, HS:1"

Known collections (keys of OptimizationProblems.LIB_REFERENCES):

KeyDescription
AMPGOGavana's Global Optimization benchmark suite
COPSCOPS 3.0 collection (Dolan & Moré, 2004)
CUTEstCUTEst testing environment (Gould et al., 2015)
HSHock & Schittkowski (1981), Vol. 187
HS2Schittkowski (1987), Vol. 282
LuksanLuksan, Matonoha & Vlček (2003) — Modified CUTE problems
LuksanSparseLuksan, Matonoha & Vlček (2010) — Sparse test problems
MGHMoré, Garbow & Hillstrom (1981)
NISTNIST/ITL Statistical Reference Datasets

To filter by collection, use Julia's contains function:

meta = OptimizationProblems.meta
cops_problems = meta[contains.(meta.lib, "COPS"), [:name, :lib]]
28×2 DataFrame
Rownamelib
StringString
1bearingCOPS:16
2camshapeCUTEst:CAMSHAPE, COPS:3
3catmixCUTEst:CATMIX, COPS:14
4chainCUTEst:CHAIN, COPS:4
5channelCUTEst:CHANNEL, COPS:7
6elecCUTEst:ELEC, COPS:2
7gasoilCUTEst:GASOIL, COPS:12
8gliderCUTEst:GLIDER, COPS:11
9marineCUTEst:MARINE, COPS:6
10methanolCUTEst:METHANOL, COPS:13
11minsurfCUTEst:MINSURF, COPS:17
12pineneCUTEst:PINENE, COPS:5
13polygonCUTEst:POLYGON, COPS:1
14robotarmCUTEst:ROBOTARM, COPS:8
15rocketCUTEst:ROCKET, COPS:10
16steeringCUTEst:STEERING, COPS:9
17tetraCOPS:19
18tetra_duct12COPS:19
19tetra_duct15COPS:19
20tetra_duct20COPS:19
21tetra_foam5COPS:19
22tetra_gearCOPS:19
23tetra_hookCOPS:19
24torsionCOPS:15
25triangleCOPS:18
26triangle_deerCOPS:18
27triangle_pacmanCOPS:18
28triangle_turtleCOPS:18
cutest_problems = meta[contains.(meta.lib, "CUTEst"), [:name, :lib]]
261×2 DataFrame
Rownamelib
StringString
1BOX2CUTEst:BOX2
2BOX3CUTEst:BOX3
3aircrftaCUTEst:AIRCRFTA
4allinitCUTEst:ALLINIT
5allinitcCUTEst:ALLINITC
6allinituCUTEst:ALLINITU
7alsotameCUTEst:ALSOTAME
8argaussCUTEst:ARGAUSS
9arglinaCUTEst:ARGLINA
10arglinbCUTEst:ARGLINB
11arglincCUTEst:ARGLINC
12argtrigCUTEst:ARGTRIG
13arwheadCUTEst:ARWHEAD, Luksan:1
14avion2CUTEst:AVION2
15bardCUTEst:BARD
16bdqrticCUTEst:BDQRTIC, Luksan:2
17bealeCUTEst:BEALE
18bennett5CUTEst:BENNETT5, NIST:Bennett5
19biggs5CUTEst:BIGGS5
20biggs6CUTEst:BIGGS6
21boothCUTEst:BOOTH
22boxbodCUTEst:BOXBOD, NIST:BoxBOD
23bqp1varCUTEst:BQP1VAR
24britgasCUTEst:BRITGAS
25brownalCUTEst:BROWNAL
26brownbsCUTEst:BROWNBS
27browndenCUTEst:BROWNDEN
28broydn7dCUTEst:BROYDN7D, Luksan:3
29brybndCUTEst:BRYBND, Luksan:4
30bt1CUTEst:BT1
31camshapeCUTEst:CAMSHAPE, COPS:3
32catenaryCUTEst:CATENARY
33catmixCUTEst:CATMIX, COPS:14
34chainCUTEst:CHAIN, COPS:4
35chainwooCUTEst:CHAINWOO, Luksan:5, LuksanSparse:2
36channelCUTEst:CHANNEL, COPS:7
37chwirut1CUTEst:CHWIRUT1, NIST:Chwirut1
38chwirut2CUTEst:CHWIRUT2, NIST:Chwirut2
39cliffCUTEst:CLIFF
40clnlbeamCUTEst:CLNLBEAM
41clplateaCUTEst:CLPLATEA
42clplatebCUTEst:CLPLATEB
43clplatecCUTEst:CLPLATEC
44cosineCUTEst:COSINE, Luksan:6
45cragglvyCUTEst:CRAGGLVY, Luksan:7
46curly10CUTEst:CURLY10
47curly20CUTEst:CURLY20
48curly30CUTEst:CURLY30
49danwoodCUTEst:DANWOOD, NIST:DanWood
50dixmaanfCUTEst:DIXMAANF,Luksan:12
51dixmaangCUTEst:DIXMAANG,Luksan:13
52dixmaanhCUTEst:DIXMAANH,Luksan:14
53dixmaanjCUTEst:DIXMAANJ,Luksan:16
54dixmaankCUTEst:DIXMAANK,Luksan:17
55dixmaanlCUTEst:DIXMAANL,Luksan:18
56dixmaannCUTEst:DIXMAANN,Luksan:20
57dixmaanoCUTEst:DIXMAANO,Luksan:21
58dixmaanpCUTEst:DIXMAANP,Luksan:22
59dixon3dqCUTEst:DIXON3DQ
60dqdrticCUTEst:DQDRTIC
61dqrticCUTEst:DQRTIC, Luksan:23
62eckerle4CUTEst:ECKERLE4, NIST:Eckerle4
63edenschCUTEst:EDENSCH, Luksan:24
64eg2CUTEst:EG2, Luksan:25
65elecCUTEst:ELEC, COPS:2
66engval1CUTEst:ENGVAL1, Luksan:26
67ensoCUTEst:ENSO, NIST:ENSO
68extrosnbCUTEst:EXTROSNB, Luksan:29
69fletcbv2CUTEst:FLETCBV2, Luksan:31
70fletchcrCUTEst:FLETCHCR, Luksan:32
71fminsrf2CUTEst:FMINSRF2, Luksan:33
72freurothCUTEst:FREUROTH, Luksan:34
73gasoilCUTEst:GASOIL, COPS:12
74gauss1CUTEst:GAUSS1, NIST:Gauss1
75gauss2CUTEst:GAUSS2, NIST:Gauss2
76gauss3CUTEst:GAUSS3, NIST:Gauss3
77gaussianCUTEst:GAUSSIAN
78genhumpsCUTEst:GENHUMPS, Luksan:35
79genroseCUTEst:GENROSE, Luksan:36
80gliderCUTEst:GLIDER, COPS:11
81gulfCUTEst:GULF
82hahn1CUTEst:HAHN1, NIST:Hahn1
83hs1CUTEst:HS1, HS:1
84hs10CUTEst:HS10, HS:10
85hs100CUTEst:HS100, HS:100
86hs101CUTEst:HS101, HS:101
87hs102CUTEst:HS102, HS:102
88hs103CUTEst:HS103, HS:103
89hs104CUTEst:HS104, HS:104
90hs105CUTEst:HS105, HS:105
91hs106CUTEst:HS106, HS:106
92hs107CUTEst:HS107, HS:107
93hs108CUTEst:HS108, HS:108
94hs109CUTEst:HS109, HS:109
95hs11CUTEst:HS11, HS:11
96hs110CUTEst:HS110, HS:110
97hs111CUTEst:HS111, HS:111
98hs112CUTEst:HS112, HS:112
99hs113CUTEst:HS113, HS:113
100hs114CUTEst:HS114, HS:114
101hs116CUTEst:HS116, HS:116
102hs117CUTEst:HS117, HS:117
103hs118CUTEst:HS118, HS:118
104hs119CUTEst:HS119, HS:119
105hs12CUTEst:HS12, HS:12
106hs13CUTEst:HS13, HS:13
107hs14CUTEst:HS14, HS:14
108hs15CUTEst:HS15, HS:15
109hs16CUTEst:HS16, HS:16
110hs17CUTEst:HS17, HS:17
111hs18CUTEst:HS18, HS:18
112hs19CUTEst:HS19, HS:19
113hs2CUTEst:HS2, HS:2
114hs20CUTEst:HS20, HS:20
115hs21CUTEst:HS21, HS:21
116hs22CUTEst:HS22, HS:22
117hs23CUTEst:HS23, HS:23
118hs24CUTEst:HS24, HS:24
119hs25CUTEst:HS25, HS:25
120hs26CUTEst:HS26, HS:26
121hs27CUTEst:HS27, HS:27
122hs28CUTEst:HS28, HS:28
123hs29CUTEst:HS29, HS:29
124hs3CUTEst:HS3, HS:3
125hs30CUTEst:HS30, HS:30
126hs31CUTEst:HS31, HS:31
127hs32CUTEst:HS32, HS:32
128hs33CUTEst:HS33, HS:33
129hs34CUTEst:HS34, HS:34
130hs35CUTEst:HS35, HS:35
131hs36CUTEst:HS36, HS:36
132hs37CUTEst:HS37, HS:37
133hs38CUTEst:HS38, HS:38
134hs39CUTEst:HS39, HS:39
135hs4CUTEst:HS4, HS:4
136hs40CUTEst:HS40, HS:40
137hs41CUTEst:HS41, HS:41
138hs42CUTEst:HS42, HS:42
139hs43CUTEst:HS43, HS:43
140hs44CUTEst:HS44, HS:44
141hs45CUTEst:HS45, HS:45
142hs46CUTEst:HS46, HS:46
143hs47CUTEst:HS47, HS:47
144hs48CUTEst:HS48, HS:48
145hs49CUTEst:HS49, HS:49
146hs5CUTEst:HS5, HS:5
147hs50CUTEst:HS50, HS:50
148hs51CUTEst:HS51, HS:51
149hs52CUTEst:HS52, HS:52
150hs53CUTEst:HS53, HS:53
151hs54CUTEst:HS54, HS:54
152hs55CUTEst:HS55, HS:55
153hs56CUTEst:HS56, HS:56
154hs57CUTEst:HS57, HS:57
155hs59CUTEst:HS59, HS:59
156hs6CUTEst:HS6, HS:6
157hs60CUTEst:HS60, HS:60
158hs61CUTEst:HS61, HS:61
159hs62CUTEst:HS62, HS:62
160hs63CUTEst:HS63, HS:63
161hs64CUTEst:HS64, HS:64
162hs65CUTEst:HS65, HS:65
163hs66CUTEst:HS66, HS:66
164hs68CUTEst:HS68, HS:68
165hs69CUTEst:HS69, HS:69
166hs7CUTEst:HS7, HS:7
167hs70CUTEst:HS70, HS:70
168hs71CUTEst:HS71, HS:71
169hs72CUTEst:HS72, HS:72
170hs73CUTEst:HS73, HS:73
171hs74CUTEst:HS74, HS:74
172hs75CUTEst:HS75, HS:75
173hs76CUTEst:HS76, HS:76
174hs77CUTEst:HS77, HS:77
175hs78CUTEst:HS78, HS:78
176hs79CUTEst:HS79, HS:79
177hs8CUTEst:HS8, HS:8
178hs80CUTEst:HS80, HS:80
179hs81CUTEst:HS81, HS:81
180hs83CUTEst:HS83, HS:83
181hs84CUTEst:HS84, HS:84
182hs86CUTEst:HS86, HS:86
183hs87CUTEst:HS87, HS:87
184hs9CUTEst:HS9, HS:9
185hs93CUTEst:HS93, HS:93
186hs95CUTEst:HS95, HS:95
187hs96CUTEst:HS96, HS:96
188hs97CUTEst:HS97, HS:97
189hs98CUTEst:HS98, HS:98
190hs99CUTEst:HS99, HS:99
191integreqCUTEst:INTEGREQ
192kirby2CUTEst:KIRBY2, NIST:Kirby2
193kowosbCUTEst:KOWOSB
194lanczos1CUTEst:LANCZOS1, NIST:lanczos1
195lanczos2CUTEst:LANCZOS2, NIST:Lanczos2
196lanczos3CUTEst:LANCZOS3, NIST:Lanczos3
197liarwhdCUTEst:LIARWHD, Luksan:38
198marineCUTEst:MARINE, COPS:6
199methanolCUTEst:METHANOL, COPS:13
200meyer3CUTEst:MEYER3
201mgh09CUTEst:MGH09, MGH:9, NIST:MGH09
202mgh10CUTEst:MGH10, MGH:10, NIST:MGH10
203mgh17CUTEst:MGH17, MGH:17, NIST:MGH17
204minsurfCUTEst:MINSURF, COPS:17
205misra1aCUTEst:MISRA1A, NIST:misra1a
206misra1bCUTEst:MISRA1B, NIST:Misra1b
207misra1cCUTEst:MISRA1C, NIST:Misra1c
208misra1dCUTEst:MISRA1D
209morebvCUTEst:MOREBV, Luksan:39
210nastyCUTEst:NASTY
211ncb20CUTEst:NCB20, Luksan:40
212ncb20bCUTEst:NCB20B, Luksan:41
213nelsonCUTEst:NELSON, NIST:Nelson
214noncvxu2CUTEst:NONCVXU2, Luksan:43
215noncvxunCUTEst:NONCVXUN, Luksan:42
216nondiaCUTEst:NONDIA, Luksan:44
217nondquarCUTEst:NONDQUAR, Luksan:45
218osborne1CUTEst:OSBORNE1
219osborne2CUTEst:OSBORNE2
220palmer1cCUTEst:PALMER1C
221palmer1dCUTEst:PALMER1D
222palmer2cCUTEst:PALMER2C
223palmer3cCUTEst:PALMER3C
224palmer4cCUTEst:PALMER4C
225palmer5cCUTEst:PALMER5C
226palmer5dCUTEst:PALMER5D
227palmer6cCUTEst:PALMER6C
228palmer7cCUTEst:PALMER7C
229palmer8cCUTEst:PALMER8C
230penalty1CUTEst:PENALTY1
231penalty2CUTEst:PENALTY2
232penalty3CUTEst:PENALTY3, Luksan:46
233pineneCUTEst:PINENE, COPS:5
234polygonCUTEst:POLYGON, COPS:1
235powellbsCUTEst:POWELLBS
236powellsgCUTEst:POWELLSG, Luksan:47, LuksanSparse:3
237powerCUTEst:POWER
238quartcCUTEst:QUARTC
239rat42CUTEst:RAT42, NIST:Rat42
240rat43CUTEst:RAT43, NIST:Rat43
241robotarmCUTEst:ROBOTARM, COPS:8
242rocketCUTEst:ROCKET, COPS:10
243sbrybndCUTEst:SBRYBND, Luksan:48
244schmvettCUTEst:SCHMVETT, Luksan:49
245scosineCUTEst:SCOSINE, Luksan:50
246sinquadCUTEst:SINQUAD, Luksan:51
247sparsineCUTEst:SPARSINE, Luksan:52
248sparsqurCUTEst:SPARSQUR, Luksan:53
249spmsrtlsCUTEst:SPMSRTLS, Luksan:54
250srosenbrCUTEst:SROSENBR, Luksan:55
251steeringCUTEst:STEERING, COPS:9
252threepkCUTEst:3PK
253thurberCUTEst:THURBER, NIST:Thurber
254tointgssCUTEst:TOINTGSS, Luksan:56
255tquarticCUTEst:TQUARTIC, Luksan:57
256tridiaCUTEst:TRIDIA
257vardimCUTEst:VARDIM
258vibrbeamCUTEst:VIBRBEAM
259watsonCUTEst:WATSON
260woodsCUTEst:WOODS, Luksan:58
261zangwil3CUTEst:ZANGWIL3

OptimizationProblems.LIB_REFERENCES provides the canonical BibTeX entry for each collection, and export_bibtex automatically appends them when include_lib_refs = true (the default).

Problem'source information

The following code will create a .bib file regrouping all the BibTex citations.

using OptimizationProblems
export_bibtex()

Fields documenting the origin of the problem may be incomplete and any help is welcome.