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 OptimizationProblemsEach 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_metaDict{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()1For 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_metaDict{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)10OptimizationProblems.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
└ :xGlobal meta
This package collects all the metadata in a single DataFrame.
OptimizationProblems.meta| Row | nvar | variable_nvar | ncon | variable_ncon | minimize | name | has_equalities_only | has_inequalities_only | has_bounds | has_fixed_variables | objtype | contype | best_known_lower_bound | best_known_upper_bound | is_feasible | defined_everywhere | origin | url | notes | origin_notes | reference | lib |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
| Int64 | Bool | Int64 | Bool | Bool | String | Bool | Bool | Bool | Bool | Symbol | Symbol | Real | Real | Bool? | Bool? | Symbol | String | String | String | String | String | |
| 1 | 1 | false | 0 | false | true | AMPGO02 | false | false | false | false | other | unconstrained | -Inf | 0.839498 | true | missing | unknown | http://infinity77.net/global_optimization/test_functions_1d.html#d-test-functions | A one dimensional optimization problem\n | Problem 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}\n | AMPGO:2 |
| 2 | 1 | false | 0 | false | true | AMPGO03 | false | false | false | false | other | unconstrained | -Inf | 2.88961 | true | missing | unknown | http://infinity77.net/global_optimization/test_functions_1d.html#d-test-functions | A one dimensional optimization problem\n | Problem 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}\n | AMPGO:3 |
| 3 | 1 | false | 0 | false | true | AMPGO04 | false | false | false | false | other | unconstrained | -Inf | -2.5666 | true | missing | unknown | http://infinity77.net/global_optimization/test_functions_1d.html#d-test-functions | A one dimensional optimization problem\n | Problem 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}\n | AMPGO:4 |
| 4 | 1 | false | 0 | false | true | AMPGO05 | false | false | false | false | other | unconstrained | -Inf | -0.0 | true | missing | unknown | http://infinity77.net/global_optimization/test_functions_1d.html#d-test-functions | A one dimensional optimization problem\n | Problem 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}\n | AMPGO:5 |
| 5 | 1 | false | 0 | false | true | AMPGO06 | false | false | false | false | other | unconstrained | -Inf | 3.5177e-43 | true | missing | unknown | http://infinity77.net/global_optimization/test_functions_1d.html#d-test-functions | A one dimensional optimization problem\n | Problem 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}\n | AMPGO:6 |
| 6 | 1 | false | 0 | false | true | AMPGO07 | false | false | false | false | other | unconstrained | -Inf | 2.56475 | true | missing | unknown | http://infinity77.net/global_optimization/test_functions_1d.html#d-test-functions | A one dimensional optimization problem\n | Problem 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}\n | AMPGO:7 |
| 7 | 1 | false | 0 | false | true | AMPGO08 | false | false | false | false | other | unconstrained | -Inf | -2.0928 | true | missing | unknown | http://infinity77.net/global_optimization/test_functions_1d.html#d-test-functions | A one dimensional optimization problem\n | Problem 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}\n | AMPGO:8 |
| 8 | 1 | false | 0 | false | true | AMPGO09 | false | false | false | false | other | unconstrained | -Inf | 0.921136 | true | missing | unknown | http://infinity77.net/global_optimization/test_functions_1d.html#d-test-functions | A one dimensional optimization problem\n | Problem 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}\n | AMPGO:9 |
| 9 | 1 | false | 0 | false | true | AMPGO10 | false | false | false | false | other | unconstrained | -Inf | -0.0 | true | missing | unknown | http://infinity77.net/global_optimization/test_functions_1d.html#d-test-functions | A one dimensional optimization problem\n | Problem 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}\n | AMPGO:10 |
| 10 | 1 | false | 0 | false | true | AMPGO11 | false | false | false | false | other | unconstrained | -Inf | -1.0 | true | missing | unknown | http://infinity77.net/global_optimization/test_functions_1d.html#d-test-functions | A one dimensional optimization problem\n | Problem 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}\n | AMPGO:11 |
| 11 | 1 | false | 0 | false | true | AMPGO12 | false | false | false | false | other | unconstrained | -Inf | 1.0 | true | missing | unknown | http://infinity77.net/global_optimization/test_functions_1d.html#d-test-functions | A one dimensional optimization problem\n | Problem 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}\n | AMPGO:12 |
| 12 | 1 | false | 0 | false | true | AMPGO13 | false | false | false | false | other | unconstrained | -1.5874 | -1.5874 | true | missing | unknown | http://infinity77.net/global_optimization/test_functions_1d.html#d-test-functions | A one dimensional optimization problem\n | Problem 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}\n | AMPGO:13 |
| 13 | 1 | false | 0 | false | true | AMPGO14 | false | false | false | false | other | unconstrained | -Inf | -0.0 | true | missing | unknown | http://infinity77.net/global_optimization/test_functions_1d.html#d-test-functions | A one dimensional optimization problem\n | Problem 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}\n | AMPGO:14 |
| 14 | 1 | false | 0 | false | true | AMPGO15 | false | false | false | false | other | unconstrained | -Inf | 2.15385 | true | missing | unknown | http://infinity77.net/global_optimization/test_functions_1d.html#d-test-functions | A one dimensional optimization problem\n | Problem 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}\n | AMPGO:15 |
| 15 | 1 | false | 0 | false | true | AMPGO18 | false | false | false | false | other | unconstrained | -Inf | 4.0 | true | missing | unknown | http://infinity77.net/global_optimization/test_functions_1d.html#d-test-functions | A one dimensional optimization problem\n | Problem 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}\n | AMPGO:18 |
| 16 | 1 | false | 0 | false | true | AMPGO20 | false | false | false | false | other | unconstrained | -Inf | 3.92246e-43 | true | missing | unknown | http://infinity77.net/global_optimization/test_functions_1d.html#d-test-functions | A one dimensional optimization problem\n | Problem 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}\n | AMPGO:20 |
| 17 | 1 | false | 0 | false | true | AMPGO21 | false | false | false | false | other | unconstrained | -Inf | 0.0 | true | missing | unknown | http://infinity77.net/global_optimization/test_functions_1d.html#d-test-functions | A one dimensional optimization problem\n | Problem 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}\n | AMPGO:21 |
| 18 | 1 | false | 0 | false | true | AMPGO22 | false | false | false | false | other | unconstrained | -Inf | 1.0 | true | missing | unknown | http://infinity77.net/global_optimization/test_functions_1d.html#d-test-functions | A one dimensional optimization problem\n | Problem 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}\n | AMPGO:22 |
| 19 | 3 | false | 1 | false | true | BOX2 | true | false | false | false | other | linear | -Inf | 0.942284 | true | missing | unknown | https://bitbucket.org/optrove/sif/src/master/BOX2.SIF | Box problem in 2 variables, obtained by fixing X3 = 1 in BOX2.\n\nclassification SXR2-AN-3-0\n | Problem 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 |
| 20 | 3 | false | 0 | false | true | BOX3 | false | false | false | false | other | unconstrained | -Inf | 662.868 | true | missing | unknown | https://bitbucket.org/optrove/sif/src/master/BOX3.SIF | SIF input: Ph. Toint, Dec 1989.\n\nBox problem in 3 variables.\n\nclassification SUR2-AN-3-0\n | Problem 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 |
| 21 | 1 | false | 0 | false | true | Dus2_1 | false | false | false | false | other | unconstrained | -Inf | 7.38906 | true | missing | unknown | http://www.dmi.usherb.ca/~dussault/ROP630E17/ | A one dimensional optimization problem\n\nS. Goyette, Sherbrooke 2016/2017\n | Problem 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 | |
| 22 | 1 | false | 0 | false | true | Dus2_3 | false | false | false | false | other | unconstrained | -Inf | 0.972973 | true | missing | unknown | http://www.dmi.usherb.ca/~dussault/ROP630E17/ | A one dimensional optimization problem\n\nS. Goyette, Sherbrooke 2016/2017\n | Problem 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 | |
| 23 | 1 | false | 0 | false | true | Dus2_9 | false | false | false | false | other | unconstrained | -Inf | 1.0 | true | missing | unknown | http://www.dmi.usherb.ca/~dussault/ROP630E17/ | A one dimensional optimization problem\n\nS. Goyette, Sherbrooke 2016/2017\n | Problem 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 | |
| 24 | 1 | false | 0 | false | true | Duscube | false | false | false | false | other | unconstrained | -Inf | -108.0 | true | missing | unknown | http://www.dmi.usherb.ca/~dussault/ROP630E17/ | A one dimensional optimization problem\n\nS. Goyette, Sherbrooke 2016/2017\n | Problem 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 | |
| 25 | 91 | true | 0 | false | true | NZF1 | false | false | false | false | least_squares | unconstrained | -Inf | 34698.4 | true | missing | unknown | https://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 | |
| 26 | 1 | false | 0 | false | true | Shpak1 | false | false | false | false | other | unconstrained | -Inf | 0.839498 | true | missing | unknown | http://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 | |
| 27 | 1 | false | 0 | false | true | Shpak2 | false | false | false | false | other | unconstrained | -Inf | -0.747036 | true | missing | unknown | http://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 | |
| 28 | 1 | false | 0 | false | true | Shpak3 | false | false | false | false | other | unconstrained | -Inf | 2.63055 | true | missing | unknown | http://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 | |
| 29 | 1 | false | 0 | false | true | Shpak4 | false | false | false | false | other | unconstrained | -Inf | -0.677439 | true | missing | unknown | http://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 | |
| 30 | 1 | false | 0 | false | true | Shpak5 | false | false | false | false | other | unconstrained | -Inf | -1.00842 | true | missing | unknown | http://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 | |
| 31 | 1 | false | 0 | false | true | Shpak6 | false | false | false | false | other | unconstrained | -Inf | -1.25667 | true | missing | unknown | http://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 | |
| 32 | 8 | false | 5 | false | true | aircrfta | true | false | true | true | other | general | -Inf | 0 | true | missing | unknown | https://www.osti.gov/biblio/6449249, https://bitbucket.org/optrove/sif/src/master/AIRCRFTA.SIF | The aircraft stability problem by Rheinboldt, as a function\nof the elevator, aileron and rudder deflection controls.\n\nclassification NOR2-RN-8-5\n | Problem 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}\n | CUTEst:AIRCRFTA |
| 33 | 4 | false | 3 | false | true | allinit | false | false | false | false | other | linear | -Inf | Inf | missing | missing | unknown | https://bitbucket.org/optrove/sif/src/master/ALLINIT.SIF | A problem with "all in it". Intended to verify that changes\nto LANCELOT are safe.\n\nclassification OBR2-AY-4-0\n | N. 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}\n | CUTEst:ALLINIT |
| 34 | 4 | false | 4 | false | true | allinitc | false | false | false | false | other | general | -Inf | Inf | missing | missing | unknown | https://bitbucket.org/optrove/sif/src/master/ALLINITC.SIF | A problem with "all in it". Intended to verify that changes\nto LANCELOT are safe.\n\nclassification OOR2-AY-4-1\n | N. 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}\n | CUTEst:ALLINITC |
| 35 | 4 | false | 0 | false | true | allinitu | false | false | false | false | other | unconstrained | -Inf | 13.0 | true | missing | unknown | https://bitbucket.org/optrove/sif/src/master/ALLINITU.SIF | A problem with "all in it". Intended to verify that changes\nto LANCELOT are safe.\n\nclassification OUR2-AY-4-0\n | N. 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}\n | CUTEst:ALLINITU |
| 36 | 2 | false | 3 | false | true | alsotame | false | false | false | false | other | general | -Inf | Inf | missing | missing | unknown | https://bitbucket.org/optrove/sif/src/master/ALSOTAME.SIF | Another simple constrained problem\n\nclassification OOR2-AN-2-1\n | A.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 |
| 37 | 3 | false | 15 | false | true | argauss | true | false | false | false | other | general | -Inf | Inf | missing | missing | unknown | https://doi.org/10.1145/355934.355936, https://bitbucket.org/optrove/sif/src/master/ARGAUSS.SIF | SIF input: Ph. Toint, Dec 1989.\n\nMore''s gaussian problem in 3 variables\n\nclassification NOR2-AN-3-15\n | Problem 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:ARGAUSS |
| 38 | 100 | true | 0 | false | true | arglina | false | false | false | false | least_squares | unconstrained | -Inf | 500.0 | true | missing | unknown | https://doi.org/10.1145/355934.355936, https://bitbucket.org/optrove/sif/src/master/ARGLINA.SIF | Linear function - full rank\n\nclassification SUR2-AN-V-0\n | Problem 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} \n | CUTEst:ARGLINA |
| 39 | 100 | true | 0 | false | true | arglinb | false | false | false | false | least_squares | unconstrained | -Inf | 6.85174e13 | true | missing | unknown | https://doi.org/10.1145/355934.355936, https://bitbucket.org/optrove/sif/src/master/ARGLINB.SIF | Linear function - rank 1\n\nclassification SUR2-AN-V-0\n | Problem 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} \n | CUTEst:ARGLINB |
| 40 | 100 | true | 0 | false | true | arglinc | false | false | false | false | other | unconstrained | -Inf | 6.38544e13 | true | missing | unknown | https://doi.org/10.1145/355934.355936, https://bitbucket.org/optrove/sif/src/master/ARGLINC.SIF | Linear function - rank 1, zero columns and rows\n\nclassification SUR2-AN-V-0\n | Problem 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} \n | CUTEst:ARGLINC |
| 41 | 100 | true | 0 | false | true | argtrig | false | false | false | false | other | unconstrained | -Inf | 0.0 | true | missing | unknown | https://doi.org/10.1145/355934.355936, https://bitbucket.org/optrove/sif/src/master/ARGTRIG.SIF | Variable 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\n | problem 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} \n | CUTEst:ARGTRIG |
| 42 | 100 | true | 0 | false | true | arwhead | false | false | false | false | other | unconstrained | -Inf | 297.0 | true | missing | unknown | http://www.cs.cas.cz/matonoha/download/V1081.pdf, https://bitbucket.org/optrove/sif/src/master/ARWHEAD.SIF | Arrow 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\n | Problem 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} \n | CUTEst:ARWHEAD, Luksan:1 |
| 43 | 100 | true | 0 | false | true | auglag | false | false | false | false | other | unconstrained | -Inf | Inf | missing | missing | literature | https://www.researchgate.net/publication/325314400_Sparse_Test_Problems_for_Unconstrained_Optimization | Augmented 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 |
| 44 | 49 | false | 15 | false | true | avion2 | true | false | true | false | least_squares | linear | -Inf | Inf | missing | missing | unknown | https://bitbucket.org/optrove/sif/src/master/AVION2.SIF | Dassault France avion (airplane design) problem\n\nclassification OLR2-RN-49-15\n | SIF 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}\n | CUTEst:AVION2 |
| 45 | 3 | false | 0 | false | true | bard | false | false | false | false | least_squares | unconstrained | -Inf | 500.0 | true | missing | unknown | https://bitbucket.org/optrove/sif/src/master/BARD.SIF | Bard 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\n | Problem 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 |
| 46 | 100 | true | 0 | false | true | bdqrtic | false | false | false | false | least_squares | unconstrained | -Inf | 21696.0 | true | missing | unknown | https://bitbucket.org/optrove/sif/src/master/BDQRTIC.SIF | This problem is quartic and has a banded Hessian with bandwidth = 9\n\nclassification SUR2-AN-V-0\n | Problem 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 |
| 47 | 2 | false | 0 | false | true | beale | false | false | false | false | least_squares | unconstrained | -Inf | 14.2031 | true | missing | unknown | https://bitbucket.org/optrove/sif/src/master/BEALE.SIF | Beale problem in 2 variables\n\nclassification SUR2-AN-2-0\n\nA. Cebola, Curitiba 10/2016.\n | Problem 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 |
| 48 | 100 | true | 0 | false | true | bearing | false | false | true | true | other | unconstrained | -Inf | 15.0662 | true | missing | unknown | https://doi.org/10.2172/834714 | Given 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\n | This 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 |
| 49 | 3 | false | 0 | false | true | bennett5 | false | false | false | false | least_squares | unconstrained | -Inf | 500.0 | true | missing | unknown | https://bitbucket.org/optrove/sif/src/master/BENNETT5.SIF | https://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\n | Problem 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}\n | CUTEst:BENNETT5, NIST:Bennett5 |
| 50 | 6 | false | 0 | false | true | biggs5 | false | false | true | true | other | unconstrained | -Inf | -3.15621 | true | missing | unknown | https://bitbucket.org/optrove/sif/src/master/BIGGS5.SIF | Biggs 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\n | Inspited 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 |
| 51 | 6 | false | 0 | false | true | biggs6 | false | false | false | false | other | unconstrained | -Inf | -3.15621 | true | missing | unknown | https://bitbucket.org/optrove/sif/src/master/BIGGS6.SIF | Biggs EXP problem in 6 variables\n\nclassification SUR2-AN-6-0\n | problem 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 |
| 52 | 2 | false | 2 | false | true | booth | true | false | false | false | other | linear | -Inf | Inf | missing | missing | unknown | https://bitbucket.org/optrove/sif/src/master/BOOTH.SIF | SIF input: Ph. Toint, Dec 1989.\n\nBooth quadratic problem in 2 variables.\n\nclassification NLR2-AN-2-2\n | Problem 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 |
| 53 | 100 | true | 0 | false | true | boundary | false | false | false | false | least_squares | unconstrained | -Inf | Inf | true | missing | academic | https://www.researchgate.net/publication/325314400_Sparse_Test_Problems_for_Unconstrained_Optimization | Discrete boundary value problem\n | Problem 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 |
| 54 | 2 | false | 0 | false | true | boxbod | false | false | false | false | least_squares | unconstrained | -Inf | 500.0 | true | missing | unknown | https://bitbucket.org/optrove/sif/src/master/BOXBOD.SIF | https://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\n | Problem 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}\n | CUTEst:BOXBOD, NIST:BoxBOD |
| 55 | 1 | false | 1 | false | true | bqp1var | false | true | false | false | other | linear | -Inf | 0.3125 | true | missing | unknown | https://bitbucket.org/optrove/sif/src/master/BQP1VAR.SIF | classification QBR2-AN-1-0\n | a 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 |
| 56 | 450 | false | 360 | false | true | britgas | true | false | true | false | other | general | -Inf | Inf | missing | missing | unknown | https://bitbucket.org/optrove/sif/src/master/BRITGAS.SIF | A 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\n | N. 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 |
| 57 | 100 | true | 0 | false | true | brownal | false | false | false | false | least_squares | unconstrained | -Inf | 0.0 | true | missing | unknown | https://bitbucket.org/optrove/sif/src/master/BROWNAL.SIF | The Brown almost linear problem in variable dimension. This is a nonlinear\nleast-squares problems with n groups.\n\nclassification SUR2-AN-V-0\n | Problem 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 |
| 58 | 2 | false | 0 | false | true | brownbs | false | false | false | false | least_squares | unconstrained | -Inf | 9.99998e11 | true | missing | unknown | https://bitbucket.org/optrove/sif/src/master/BROWNBS.SIF | Brown 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.\n | Problem 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 |
| 59 | 4 | false | 0 | false | true | brownden | false | false | false | false | least_squares | unconstrained | -Inf | 7.92669e6 | true | missing | unknown | https://bitbucket.org/optrove/sif/src/master/BROWNDEN.SIF | Brown and Dennis function\n\nclassification SUR2-AN-4-0\n | Problem 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 |
| 60 | 100 | true | 0 | false | true | browngen1 | false | false | false | false | other | unconstrained | -Inf | Inf | missing | missing | literature | https://www.researchgate.net/publication/325314400_Sparse_Test_Problems_for_Unconstrained_Optimization | Generalization 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 |
| 61 | 100 | true | 0 | false | true | browngen2 | false | false | false | false | other | unconstrained | -Inf | Inf | missing | missing | literature | https://www.researchgate.net/publication/325314400_Sparse_Test_Problems_for_Unconstrained_Optimization | Generalization 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 |
| 62 | 100 | true | 0 | false | true | broyden3d | false | false | false | false | least_squares | unconstrained | -Inf | 0.0 | true | missing | unknown | https://doi.org/10.1145/355934.355936 | Broyden tridiagonal problem in variable dimension. This is a nonlinear\nleast-squares problem with n groups.\n | Problem 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 |
| 63 | 100 | true | 0 | false | true | broyden7d | false | false | false | false | least_squares | unconstrained | -Inf | Inf | missing | missing | literature | https://www.researchgate.net/publication/325314400_Sparse_Test_Problems_for_Unconstrained_Optimization | Seven 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 |
| 64 | 100 | true | 0 | false | true | broydn7d | false | false | false | false | other | unconstrained | -Inf | 274.204 | true | missing | unknown | https://bitbucket.org/optrove/sif/src/master/BROYDN7D.SIF | A seven diagonal variant of the Broyden tridiagonal system,\nfeaturing a band far away from the diagonal.\n\nclassification OUR2-AN-V-0\n | Problem 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 |
| 65 | 100 | true | 0 | false | true | brybnd | false | false | false | false | least_squares | unconstrained | -Inf | 3600.0 | true | missing | unknown | https://bitbucket.org/optrove/sif/src/master/BRYBND.SIF | Broyden 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)\n | problem 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 |
| 66 | 2 | false | 1 | false | true | bt1 | true | false | false | false | other | general | -Inf | Inf | missing | missing | unknown | https://bitbucket.org/optrove/sif/src/master/BT1.SIF | classification QQR2-AN-2-1\n\nA. Cebola, Curitiba 10/2016.\n | problem 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 |
| 67 | 100 | true | 203 | true | true | camshape | false | true | true | false | other | quadratic | -Inf | Inf | missing | missing | unknown | https://bitbucket.org/optrove/sif/src/master/CAMSHAPE.SIF | Maximize 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\n | This 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 |
| 68 | 99 | true | 32 | true | true | catenary | true | false | true | true | linear | quadratic | -Inf | Inf | missing | missing | academic | https://bitbucket.org/optrove/sif/src/master/CATENARY.SIF | The 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\n | K. 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 |
| 69 | 2302 | true | 2002 | true | true | catmix | true | false | true | false | other | general | -Inf | 0.0 | true | missing | unknown | https://bitbucket.org/optrove/sif/src/master/CATMIX.SIF | Catalyst 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\n | This 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 |
| 70 | 100 | true | 77 | true | true | chain | true | false | false | false | other | general | -Inf | Inf | missing | missing | unknown | https://bitbucket.org/optrove/sif/src/master/CHAIN.SIF | Hanging 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\n | This 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 |
| 71 | 100 | true | 0 | false | true | chainwoo | false | false | false | false | least_squares | unconstrained | -Inf | 3.71954e5 | true | missing | unknown | https://bitbucket.org/optrove/sif/src/master/CHAINWOO.SIF | The 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\n | SIF 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 |
| 72 | 96 | true | 96 | true | true | channel | true | false | false | false | other | general | -Inf | Inf | missing | missing | unknown | https://bitbucket.org/optrove/sif/src/master/CHANNEL.SIF | Flow 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\n | This 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 |
| 73 | 100 | true | 0 | false | true | chnrosnb_mod | false | false | false | false | other | unconstrained | -Inf | 17637.9 | true | missing | unknown | http://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 |
| 74 | 3 | false | 0 | false | true | chwirut1 | false | false | false | false | least_squares | unconstrained | -Inf | 500.0 | true | missing | unknown | https://bitbucket.org/optrove/sif/src/master/CHWIRUT1.SIF | https://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\n | Problem 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}\n | CUTEst:CHWIRUT1, NIST:Chwirut1 |
| 75 | 3 | false | 0 | false | true | chwirut2 | false | false | false | false | least_squares | unconstrained | -Inf | 500.0 | true | missing | unknown | https://bitbucket.org/optrove/sif/src/master/CHWIRUT2.SIF | https://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\n | Problem 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}\n | CUTEst:CHWIRUT2, NIST:Chwirut2 |
| 76 | 2 | false | 0 | false | true | cliff | false | false | false | false | other | unconstrained | -Inf | 4.85165e8 | true | missing | unknown | https://bitbucket.org/optrove/sif/src/master/CLIFF.SIF | The "cliff problem" in 2 variables\n\nclassification OUR2-AN-2-0\n | problem 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 |
| 77 | 99 | true | 64 | true | true | clnlbeam | true | false | true | false | other | general | -Inf | 350.0 | true | missing | unknown | https://onlinelibrary.wiley.com/doi/abs/10.1002/oca.4660120103, https://bitbucket.org/optrove/sif/src/master/CLNLBEAM.SIF | The 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\n | H. 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 |
| 78 | 100 | true | 0 | false | true | clplatea | false | false | false | false | other | unconstrained | -Inf | 0.0 | true | missing | unknown | https://bitbucket.org/optrove/sif/src/master/CLPLATEA.SIF | The 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.\n | J. 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 |
| 79 | 100 | true | 0 | false | true | clplateb | false | false | false | false | other | unconstrained | -Inf | 0.0 | true | missing | unknown | https://bitbucket.org/optrove/sif/src/master/CLPLATEB.SIF | The 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.\n | J. 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 |
| 80 | 100 | true | 0 | false | true | clplatec | false | false | false | false | other | unconstrained | -Inf | 0.0 | true | missing | unknown | https://bitbucket.org/optrove/sif/src/master/CLPLATEC.SIF | The 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.\n | J. 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 |
| 81 | 100 | true | 50 | true | true | controlinvestment | true | false | true | false | other | general | -Inf | -0.98 | true | missing | unknown | This is a simple investment problem in optimistic market.\n | Example 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 | ||
| 82 | 100 | true | 0 | false | true | cosine | false | false | false | false | other | unconstrained | -Inf | 86.8807 | true | missing | unknown | https://bitbucket.org/optrove/sif/src/master/COSINE.SIF | The cosine function.\n\nAnother function with nontrivial groups and\nrepetitious elements.\n\nclassification OUR2-AN-V-0\n\nD. Orban, Montreal, 08/2015.\n | problem 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 |
| 83 | 100 | true | 0 | false | true | cragglvy | false | false | false | false | other | unconstrained | -Inf | 52823.1 | true | missing | unknown | https://bitbucket.org/optrove/sif/src/master/CRAGGLVY.SIF | Extended 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\n | Problem 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 |
| 84 | 100 | true | 0 | false | true | cragglvy2 | false | false | false | false | least_squares | unconstrained | -Inf | 52823.1 | true | missing | unknown | https://www.researchgate.net/publication/325314400_Sparse_Test_Problems_for_Unconstrained_Optimization | Chained 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 |
| 85 | 100 | true | 0 | false | true | curly | false | false | false | false | other | unconstrained | -Inf | -0.00623722 | true | missing | unknown | http://www.cs.cas.cz/matonoha/download/V1081.pdf | A 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 | |
| 86 | 100 | true | 0 | false | true | curly10 | false | false | false | false | other | unconstrained | -Inf | -0.00623722 | true | missing | unknown | https://bitbucket.org/optrove/sif/src/master/CURLY10.SIF | A 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.\n | Nick 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 |
| 87 | 100 | true | 0 | false | true | curly20 | false | false | false | false | other | unconstrained | -Inf | -0.0129654 | true | missing | unknown | https://bitbucket.org/optrove/sif/src/master/CURLY20.SIF | A 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.\n | Nick 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 |
| 88 | 100 | true | 0 | false | true | curly30 | false | false | false | false | other | unconstrained | -Inf | -0.020383 | true | missing | unknown | https://bitbucket.org/optrove/sif/src/master/CURLY30.SIF | A 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.\n | Nick 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 |
| 89 | 2 | false | 0 | false | true | danwood | false | false | false | false | least_squares | unconstrained | -Inf | 500.0 | true | missing | unknown | https://www.itl.nist.gov/div898/strd/nls/data/LINKS/DATA/danwood.dat, https://bitbucket.org/optrove/sif/src/master/DANWOOD.SIF | NIST/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\n | Problem 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 |
| 90 | 99 | true | 0 | false | true | dixmaane | false | false | false | false | other | unconstrained | -Inf | 731.833 | true | missing | unknown | http://www.cs.cas.cz/matonoha/download/V1081.pdf | The Dixon-Maany test problem (version E by default)\n\nclassification OUR2-AN-V-0\n\nD. Orban, Montreal, 08/2015.\n | L. 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 |
| 91 | 99 | true | 0 | false | true | dixmaanf | false | false | false | false | other | unconstrained | -Inf | 1348.42 | true | missing | unknown | http://www.cs.cas.cz/matonoha/download/V1081.pdf, https://bitbucket.org/optrove/sif/src/master/DIXMAANF.SIF | The Dixon-Maany test problem (version E by default)\n\nclassification OUR2-AN-V-0\n\nD. Orban, Montreal, 08/2015.\n | problems 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 |
| 92 | 99 | true | 0 | false | true | dixmaang | false | false | false | false | other | unconstrained | -Inf | 2495.83 | true | missing | unknown | http://www.cs.cas.cz/matonoha/download/V1081.pdf, https://bitbucket.org/optrove/sif/src/master/DIXMAANG.SIF | The Dixon-Maany test problem (version E by default)\n\nclassification OUR2-AN-V-0\n\nD. Orban, Montreal, 08/2015.\n | problems 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 |
| 93 | 99 | true | 0 | false | true | dixmaanh | false | false | false | false | other | unconstrained | -Inf | 4974.25 | true | missing | unknown | http://www.cs.cas.cz/matonoha/download/V1081.pdf, https://bitbucket.org/optrove/sif/src/master/DIXMAANH.SIF | The Dixon-Maany test problem (version E by default)\n\nclassification OUR2-AN-V-0\n\nD. Orban, Montreal, 08/2015.\n | problems 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 |
| 94 | 99 | true | 0 | false | true | dixmaani | false | false | false | false | other | unconstrained | -Inf | 663.646 | true | missing | unknown | http://www.cs.cas.cz/matonoha/download/V1081.pdf | The Dixon-Maany test problem (version I by default)\n\nclassification OUR2-AN-V-0\n\nD. Orban, Montreal, 08/2015.\n | L. 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 |
| 95 | 99 | true | 0 | false | true | dixmaanj | false | false | false | false | other | unconstrained | -Inf | 1281.33 | true | missing | unknown | http://www.cs.cas.cz/matonoha/download/V1081.pdf, https://bitbucket.org/optrove/sif/src/master/DIXMAANJ.SIF | The Dixon-Maany test problem (version I by default)\n\nclassification OUR2-AN-V-0\n\nD. Orban, Montreal, 08/2015.\n | problems 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 |
| 96 | 99 | true | 0 | false | true | dixmaank | false | false | false | false | other | unconstrained | -Inf | 2427.65 | true | missing | unknown | http://www.cs.cas.cz/matonoha/download/V1081.pdf, https://bitbucket.org/optrove/sif/src/master/DIXMAANK.SIF | The Dixon-Maany test problem (version I by default)\n\nclassification OUR2-AN-V-0\n\nD. Orban, Montreal, 08/2015.\n | problems 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 |
| 97 | 99 | true | 0 | false | true | dixmaanl | false | false | false | false | other | unconstrained | -Inf | 4903.7 | true | missing | unknown | http://www.cs.cas.cz/matonoha/download/V1081.pdf, https://bitbucket.org/optrove/sif/src/master/DIXMAANL.SIF | The Dixon-Maany test problem (version I by default)\n\nclassification OUR2-AN-V-0\n\nD. Orban, Montreal, 08/2015.\n | problems 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 |
| 98 | 99 | true | 0 | false | true | dixmaanm | false | false | false | false | other | unconstrained | -Inf | 314.313 | true | missing | unknown | http://www.cs.cas.cz/matonoha/download/V1081.pdf | The Dixon-Maany test problem (version M by default)\n\nD. Orban, Montreal, 08/2015.\n | L. 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 |
| 99 | 99 | true | 0 | false | true | dixmaann | false | false | false | false | other | unconstrained | -Inf | 665.66 | true | missing | unknown | http://www.cs.cas.cz/matonoha/download/V1081.pdf, https://bitbucket.org/optrove/sif/src/master/DIXMAANN.SIF | The Dixon-Maany test problem (version M by default)\n\nD. Orban, Montreal, 08/2015.\n\nclassification OUR2-AN-V-0\n | See 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 |
| 100 | 99 | true | 0 | false | true | dixmaano | false | false | false | false | other | unconstrained | -Inf | 1196.31 | true | missing | unknown | http://www.cs.cas.cz/matonoha/download/V1081.pdf, https://bitbucket.org/optrove/sif/src/master/DIXMAANO.SIF | The Dixon-Maany test problem (version M by default)\n\nD. Orban, Montreal, 08/2015.\n\nclassification OUR2-AN-V-0\n | See 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 |
| 101 | 99 | true | 0 | false | true | dixmaanp | false | false | false | false | other | unconstrained | -Inf | 2342.52 | true | missing | unknown | http://www.cs.cas.cz/matonoha/download/V1081.pdf, https://bitbucket.org/optrove/sif/src/master/DIXMAANP.SIF | The Dixon-Maany test problem (version M by default)\n\nD. Orban, Montreal, 08/2015.\n\nclassification OUR2-AN-V-0\n | See 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 |
| 102 | 100 | true | 0 | false | true | dixon3dq | false | false | false | false | least_squares | unconstrained | -Inf | 8.0 | true | missing | unknown | https://bitbucket.org/optrove/sif/src/master/DIXON3DQ.SIF | Dixon's tridiagonal quadratic.\n\nclassification QUR2-AN-V-0\n | problem 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 |
| 103 | 100 | true | 0 | false | true | dqdrtic | false | false | false | false | other | unconstrained | -Inf | 177282.0 | true | missing | unknown | https://bitbucket.org/optrove/sif/src/master/DQDRTIC.SIF | Diagonal quadratic problem\n\nclassification QUR2-AN-V-0\n | problem 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 |
| 104 | 100 | true | 0 | false | true | dqrtic | false | false | false | false | other | unconstrained | -Inf | 1.85427e9 | true | missing | unknown | http://www.cs.cas.cz/matonoha/download/V1081.pdf, https://bitbucket.org/optrove/sif/src/master/DQRTIC.SIF | Variable dimension diagonal quartic problem.\n\nclassification OUR2-AN-V-0\n | Problem 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 |
| 105 | 3 | false | 0 | false | true | eckerle4 | false | false | false | false | least_squares | unconstrained | -Inf | 500.0 | true | missing | unknown | https://bitbucket.org/optrove/sif/src/master/ECKERLE4.SIF | https://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\n | Problem 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}\n | CUTEst:ECKERLE4, NIST:Eckerle4 |
| 106 | 100 | true | 0 | false | true | edensch | false | false | false | false | other | unconstrained | -Inf | 1699.0 | true | missing | unknown | https://bitbucket.org/optrove/sif/src/master/EDENSCH.SIF | The extended Dennis and Schnabel problem, as defined by Li.\n\nclassification OUR2-AN-V-0\n | G. 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 |
| 107 | 100 | true | 0 | false | true | eg2 | false | false | false | false | other | unconstrained | -Inf | -83.3056 | true | missing | unknown | https://bitbucket.org/optrove/sif/src/master/EG2.SIF | A 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\n | Section 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 |
| 108 | 99 | true | 33 | true | true | elec | true | false | false | false | other | quadratic | -Inf | Inf | missing | missing | unknown | https://bitbucket.org/optrove/sif/src/master/ELEC.SIF | Given 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\n | This 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 |
| 109 | 100 | true | 0 | false | true | engval1 | false | false | false | false | other | unconstrained | -Inf | 5841.0 | true | missing | unknown | https://bitbucket.org/optrove/sif/src/master/ENGVAL1.SIF | The 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\n | Problem 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 |
| 110 | 9 | false | 0 | false | true | enso | false | false | false | false | least_squares | unconstrained | -Inf | 500.0 | true | missing | unknown | https://bitbucket.org/optrove/sif/src/master/ENSO.SIF | https://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\n | Problem 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}\n | CUTEst:ENSO, NIST:ENSO |
| 111 | 100 | true | 0 | false | true | errinros_mod | false | false | false | false | least_squares | unconstrained | -Inf | 3.13991e5 | true | missing | unknown | http://www.cs.cas.cz/matonoha/download/V1081.pdf | Errin 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 |
| 112 | 100 | true | 0 | false | true | extrosnb | false | false | false | false | other | unconstrained | -Inf | 39604.0 | true | missing | unknown | https://bitbucket.org/optrove/sif/src/master/EXTROSNB.SIF | The extended Rosenbrock function (nonseparable version).\n\nclassification SUR2-AN-V-0\n | Problem 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 |
| 113 | 100 | true | 0 | false | true | fletcbv2 | false | false | false | false | other | unconstrained | -Inf | -0.513108 | true | missing | unknown | https://bitbucket.org/optrove/sif/src/master/FLETCBV2.SIF | Another Boundary Value problem.\n\nclassification OUR2-AN-V-0\n | The 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 |
| 114 | 100 | true | 0 | false | true | fletcbv3_mod | false | false | false | false | other | unconstrained | -Inf | -0.0187925 | true | missing | unknown | http://www.cs.cas.cz/matonoha/download/V1081.pdf | classification OUR2-AN-V-0\n\nJ.-P. Dussault, Rennes 09/2015.\n | The 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 |
| 115 | 100 | true | 0 | false | true | fletchcr | false | false | false | false | other | unconstrained | -Inf | 9900.0 | true | missing | unknown | https://bitbucket.org/optrove/sif/src/master/FLETCHCR.SIF | The chained Rosenbrock function as given by Fletcher.\n\nclassification OUR2-AN-V-0\n | problem 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 |
| 116 | 100 | false | 0 | false | true | fminsrf2 | false | false | false | false | other | unconstrained | -Inf | 2504.27 | true | missing | unknown | https://bitbucket.org/optrove/sif/src/master/FMINSRF2.SIF | The 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\n | Setting 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 |
| 117 | 100 | true | 0 | false | true | freuroth | false | false | false | false | least_squares | unconstrained | -Inf | 99556.5 | true | missing | unknown | http://www.cs.cas.cz/matonoha/download/V1081.pdf, https://bitbucket.org/optrove/sif/src/master/FREUROTH.SIF | The Freudentstein and Roth test problem\n\nclassification SUR2-AN-V-0\nJ.-P. Dussault, Rennes 09/2015.\n | problem 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 |
| 118 | 2603 | true | 2600 | true | true | gasoil | true | false | true | false | other | general | -Inf | Inf | missing | missing | unknown | https://bitbucket.org/optrove/sif/src/master/GASOIL.SIF | Catalytic 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\n | This 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 |
| 119 | 8 | false | 0 | false | true | gauss1 | false | false | false | false | least_squares | unconstrained | -Inf | 500.0 | true | missing | unknown | https://bitbucket.org/optrove/sif/src/master/GAUSS1.SIF | https://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\n | Problem 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}\n | CUTEst:GAUSS1, NIST:Gauss1 |
| 120 | 8 | false | 0 | false | true | gauss2 | false | false | false | false | least_squares | unconstrained | -Inf | 500.0 | true | missing | unknown | https://bitbucket.org/optrove/sif/src/master/GAUSS2.SIF | https://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\n | Problem 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}\n | CUTEst:GAUSS2, NIST:Gauss2 |
| 121 | 8 | false | 0 | false | true | gauss3 | false | false | false | false | least_squares | unconstrained | -Inf | 500.0 | true | missing | unknown | https://bitbucket.org/optrove/sif/src/master/GAUSS3.SIF | https://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\n | Problem 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}\n | CUTEst:GAUSS3, NIST:Gauss3 |
| 122 | 3 | false | 0 | false | true | gaussian | false | false | false | false | least_squares | unconstrained | -Inf | 3.88811e-6 | true | missing | unknown | https://bitbucket.org/optrove/sif/src/master/GAUSSIAN.SIF | More''s gaussian problem in 3 variables. This is a nonlinear least-squares\nversion of problem ARGAUSS.\n\nclassification SUR2-AN-3-0\n | Problem 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 |
| 123 | 100 | true | 0 | false | true | genbroydenb | false | false | false | false | least_squares | unconstrained | -Inf | Inf | missing | missing | literature | https://www.researchgate.net/publication/325314400_Sparse_Test_Problems_for_Unconstrained_Optimization | Generalized Broyden banded function\n | Problem 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 |
| 124 | 100 | true | 0 | false | true | genbroydentri | false | false | false | false | least_squares | unconstrained | -Inf | Inf | missing | missing | literature | https://www.researchgate.net/publication/325314400_Sparse_Test_Problems_for_Unconstrained_Optimization\n | Generalized Broyden Tridiagonal Function\n | Problem 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 |
| 125 | 100 | true | 0 | false | true | genhumps | false | false | false | false | other | unconstrained | -Inf | 2.53684e6 | true | missing | unknown | http://www.cs.cas.cz/matonoha/download/V1081.pdf, https://bitbucket.org/optrove/sif/src/master/GENHUMPS.SIF | A 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.\n | problem 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 |
| 126 | 100 | true | 0 | false | true | genrose | false | false | false | false | least_squares | unconstrained | -Inf | 405.106 | true | missing | unknown | https://bitbucket.org/optrove/sif/src/master/GENROSE.SIF | Generalized 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\n | problem 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 |
| 127 | 100 | true | 0 | false | true | genrose_nash | false | false | false | false | other | unconstrained | -Inf | 404.126 | true | missing | unknown | http://www.cs.cas.cz/matonoha/download/V1081.pdf | Generalized 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#\n | problem 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 |
| 128 | 506 | true | 407 | true | false | glider | true | false | true | false | other | general | -Inf | Inf | missing | missing | unknown | https://bitbucket.org/optrove/sif/src/master/GLIDER.SIF | Hang 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\n | This 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 |
| 129 | 3 | false | 0 | false | true | gulf | false | false | false | false | least_squares | unconstrained | -Inf | 0.0 | true | false | real | https://bitbucket.org/optrove/sif/src/master/GULF.SIF | The 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\n | problem 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 |
| 130 | 7 | false | 0 | false | true | hahn1 | false | false | false | false | least_squares | unconstrained | -Inf | 500.0 | true | missing | unknown | https://www.itl.nist.gov/div898/strd/nls/data/LINKS/DATA/hahn1.dat, https://bitbucket.org/optrove/sif/src/master/HAHN1.SIF | NIST/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\n | Problem 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}\n | CUTEst:HAHN1, NIST:Hahn1 |
| 131 | 3 | false | 0 | false | true | helical | false | false | false | false | other | unconstrained | -Inf | 0.0 | true | missing | unknown | https://doi.org/10.1145/355934.355936 | \n | problem 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 |
| 132 | 98 | true | 68 | true | true | hovercraft1d | true | false | false | false | least_squares | linear | -Inf | Inf | missing | missing | unknown | https://laurentlessard.com/teaching/524-intro-to-optimization/ | \n | JuMP 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 | |
| 133 | 2 | false | 0 | false | true | hs1 | false | false | true | false | other | unconstrained | -Inf | 909.0 | true | missing | unknown | https://bitbucket.org/optrove/sif/src/master/HS1.SIF | Hock 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.\n | problem 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 |
| 134 | 2 | false | 1 | false | true | hs10 | false | true | false | false | other | general | -Inf | Inf | missing | missing | unknown | https://bitbucket.org/optrove/sif/src/master/HS10.SIF | Hock and Schittkowski problem number 10.\n\nclassification LQR2-AN-2-1\n\nN. Antunes, Curitiba, 10/2016.\n | problem 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 |
| 135 | 7 | false | 4 | false | true | hs100 | false | true | false | false | other | general | -Inf | 714.0 | true | missing | unknown | https://bitbucket.org/optrove/sif/src/master/HS100.SIF | Hock and Schittkowski problem number 100.\n\nclassification OOR2-AN-7-4\n\nclassification PPR-AN-7-4\n\nA. Montoison, Montreal, 05/2018.\n | problem 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 |
| 136 | 7 | false | 5 | false | true | hs101 | false | true | true | false | other | general | -Inf | Inf | missing | missing | unknown | https://bitbucket.org/optrove/sif/src/master/HS101.SIF | Hock and Schittkowski problem number 101.\n\nclassification OOR2-AN-7-5\n\nclassification PPR-AN-7-6\n\nA. Montoison, Montreal, 05/2018.\n | problem 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 |
| 137 | 7 | false | 5 | false | true | hs102 | false | true | true | false | other | general | -Inf | Inf | missing | missing | unknown | https://bitbucket.org/optrove/sif/src/master/HS102.SIF | Hock and Schittkowski problem number 102.\n\nclassification OOR2-AN-7-5\n\nclassification PPR-AN-7-6\n\nA. Montoison, Montreal, 05/2018.\n | problem 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 |
| 138 | 7 | false | 5 | false | true | hs103 | false | true | true | false | other | general | -Inf | Inf | missing | missing | unknown | https://bitbucket.org/optrove/sif/src/master/HS103.SIF | Hock and Schittkowski problem number 103.\n\nclassification OOR2-AN-7-5\n\nclassification PPR-AN-7-6\n\nA. Montoison, Montreal, 05/2018.\n | problem 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 |
| 139 | 8 | false | 5 | false | true | hs104 | false | true | true | false | other | general | -Inf | Inf | missing | missing | unknown | https://bitbucket.org/optrove/sif/src/master/HS104.SIF | Hock and Schittkowski problem number 104.\n\nclassification OOR2-AN-8-5\n\nclassification PPR-AN-8-6\n\nA. Montoison, Montreal, 05/2018.\n | problem 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 |
| 140 | 8 | false | 1 | false | true | hs105 | false | true | true | false | other | linear | -Inf | Inf | missing | missing | unknown | https://bitbucket.org/optrove/sif/src/master/HS105.SIF | Hock and Schittkowski problem number 105.\n\nclassification OLR2-AY-8-1\n\nclassification GLR-AN-8-1\n\nA. Montoison, Montreal, 05/2018.\n | problem 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 |
| 141 | 8 | false | 6 | false | true | hs106 | false | true | true | false | other | general | -Inf | Inf | missing | missing | unknown | https://bitbucket.org/optrove/sif/src/master/HS106.SIF | Hock 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.\n | problem 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 |
| 142 | 9 | false | 6 | false | true | hs107 | true | false | true | false | other | general | -Inf | Inf | missing | missing | unknown | https://bitbucket.org/optrove/sif/src/master/HS107.SIF | Hock 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.\n | problem 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 |
| 143 | 9 | false | 12 | false | true | hs108 | false | true | true | false | other | general | -Inf | Inf | missing | missing | unknown | https://bitbucket.org/optrove/sif/src/master/HS108.SIF | Hock and Schittkowski problem number 108.\n\nclassification QQR2-AY-9-13\n\nclassification QQR-AN-9-13\n\nA. Montoison, Montreal, 05/2018.\n | problem 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 |
| 144 | 9 | false | 9 | false | true | hs109 | false | false | true | false | other | general | -Inf | Inf | missing | missing | unknown | https://bitbucket.org/optrove/sif/src/master/HS109.SIF | Hock and Schittkowski problem number 109.\n\nclassification OOR2-AY-9-10\n\nclassification PGR-AN-9-10\n\nA. Montoison, Montreal, 05/2018.\n | Problem 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 |
| 145 | 2 | false | 1 | false | true | hs11 | false | true | false | false | other | general | -Inf | Inf | missing | missing | unknown | https://bitbucket.org/optrove/sif/src/master/HS11.SIF | Hock and Schittkowski problem number 11.\n\nclassification SQR2-AN-2-1\n\nN. Antunes, Curitiba, 10/2016.\n | problem 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 |
| 146 | 10 | false | 0 | false | true | hs110 | false | false | true | false | other | unconstrained | -Inf | -43.1343 | true | missing | unknown | https://bitbucket.org/optrove/sif/src/master/HS110.SIF | Hock 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.\n | problem 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 |
| 147 | 10 | false | 3 | false | true | hs111 | true | false | true | false | other | general | -Inf | Inf | missing | missing | unknown | https://bitbucket.org/optrove/sif/src/master/HS111.SIF | Hock 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.\n | problem 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 |
| 148 | 10 | false | 3 | false | true | hs112 | true | false | true | false | other | linear | -Inf | Inf | missing | missing | unknown | https://bitbucket.org/optrove/sif/src/master/HS112.SIF | Hock 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.\n | Problem 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 |
| 149 | 10 | false | 8 | false | true | hs113 | false | true | false | false | other | general | -Inf | 753.0 | true | missing | unknown | https://bitbucket.org/optrove/sif/src/master/HS113.SIF | Hock and Schittkowski problem number 113.\n\nclassification QQR2-AN-10-8\n\nclassification QQR-AN-10-8\n\nA. Montoison, Montreal, 05/2018.\n | Problem 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 |
| 150 | 10 | false | 11 | false | true | hs114 | false | false | true | false | other | general | -Inf | Inf | missing | missing | unknown | https://bitbucket.org/optrove/sif/src/master/HS114.SIF | Hock 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.\n | problem 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 |
| 151 | 13 | false | 15 | false | true | hs116 | false | true | true | false | other | general | -Inf | Inf | missing | missing | unknown | https://bitbucket.org/optrove/sif/src/master/HS116.SIF | Hock 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.\n | problem 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 |
| 152 | 15 | false | 5 | false | true | hs117 | false | true | true | false | other | general | -Inf | 2400.11 | true | missing | unknown | https://bitbucket.org/optrove/sif/src/master/HS117.SIF | Hock and Schittkowski problem number 117.\n\nclassification OQR2-AN-15-5\n\nclassification PQR-AN-15-5\n\nA. Montoison, Montreal, 05/2018.\n | problem 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 |
| 153 | 15 | false | 17 | false | true | hs118 | false | true | true | false | other | linear | -Inf | 942.716 | true | missing | unknown | https://bitbucket.org/optrove/sif/src/master/HS118.SIF | Hock and Schittkowski problem number 118.\n\nclassification QLR2-AN-15-17\n\nclassification QLR-AN-15-17\n\nA. Montoison, Montreal, 05/2018.\n | problem 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 |
| 154 | 16 | false | 8 | false | true | hs119 | true | false | true | false | other | linear | -Inf | Inf | missing | missing | unknown | https://bitbucket.org/optrove/sif/src/master/HS119.SIF | Hock and Schittkowski problem number 119.\n\nclassification OLR2-AN-16-8\n\nclassification PLR-AN-16-8\n\nA. Montoison, Montreal, 05/2018.\n | problem 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 |
| 155 | 2 | false | 1 | false | true | hs12 | false | true | false | false | other | general | -Inf | 0.0 | true | missing | unknown | https://bitbucket.org/optrove/sif/src/master/HS12.SIF | Hock and Schittkowski problem number 12.\n\nclassification QQR2-AN-2-1\n\nN. Antunes, Curitiba, 10/2016.\n | problem 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 |
| 156 | 2 | false | 1 | false | true | hs13 | false | true | true | false | least_squares | general | -Inf | Inf | missing | missing | unknown | https://bitbucket.org/optrove/sif/src/master/HS13.SIF | Hock 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.\n | problem 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 |
| 157 | 2 | false | 2 | false | true | hs14 | false | false | false | false | least_squares | general | -Inf | Inf | missing | missing | unknown | https://bitbucket.org/optrove/sif/src/master/HS14.SIF | Hock and Schittkowski problem number 14.\n\nclassification SQR2-AN-2-2\n\n N. Antunes, Curitiba, 10/2016.\n | problem 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 |
| 158 | 2 | false | 2 | false | true | hs15 | false | true | true | false | other | general | -Inf | Inf | missing | missing | unknown | https://bitbucket.org/optrove/sif/src/master/HS15.SIF | Hock and Schittkowski problem number 15.\n\nclassification SQR2-AN-2-2\n\n N. Antunes, Curitiba, 10/2016.\n | problem 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 |
| 159 | 2 | false | 2 | false | true | hs16 | false | true | true | false | other | general | -Inf | Inf | missing | missing | unknown | https://bitbucket.org/optrove/sif/src/master/HS16.SIF | Hock and Schittkowski problem number 16.\n\nclassification SQR2-AN-2-2\n\n N. Antunes, Curitiba, 10/2016.\n | problem 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 |
| 160 | 2 | false | 2 | false | true | hs17 | false | true | true | false | other | general | -Inf | Inf | missing | missing | unknown | https://bitbucket.org/optrove/sif/src/master/HS17.SIF | Hock and Schittkowski problem number 17.\n\nclassification SQR2-AN-2-2\n\n N. Antunes, Curitiba, 10/2016.\n | problem 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 |
| 161 | 2 | false | 2 | false | true | hs18 | false | true | true | false | other | general | -Inf | Inf | missing | missing | unknown | https://bitbucket.org/optrove/sif/src/master/HS18.SIF | Hock and Schittkowski problem number 18.\n\nclassification SQR2-AN-2-2\n\n N. Antunes, Curitiba, 10/2016.\n | problem 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 |
| 162 | 2 | false | 2 | false | true | hs19 | false | true | true | false | other | general | -Inf | Inf | missing | missing | unknown | https://bitbucket.org/optrove/sif/src/master/HS19.SIF | Hock and Schittkowski problem number 19.\n\nclassification OQR2-AN-2-2\n\nclassification PQR2-AN-2-2\n\n A. Montoison, Montreal, 04/2018.\n | problem 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 |
| 163 | 2 | false | 0 | false | true | hs2 | false | false | true | false | other | unconstrained | -Inf | 909.0 | true | missing | unknown | https://bitbucket.org/optrove/sif/src/master/HS2.SIF | Hock 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.\n | problem 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 |
| 164 | 2 | false | 3 | false | true | hs20 | false | true | true | false | other | general | -Inf | Inf | missing | missing | unknown | https://bitbucket.org/optrove/sif/src/master/HS20.SIF | Hock and Schittkowski problem number 20.\n\nclassification SQR2-AN-2-3\n\n N. Antunes, Curitiba, 10/2016.\n | problem 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 |
| 165 | 2 | false | 0 | false | true | hs201 | false | false | false | false | other | unconstrained | -Inf | 45.0 | true | missing | unknown | https://doi.org/10.1007/978-3-642-61582-5 | Hock and Schittkowski problem number 201.\n | Problem 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 |
| 166 | 2 | false | 1 | false | true | hs21 | false | true | true | false | other | linear | -Inf | Inf | missing | missing | unknown | https://bitbucket.org/optrove/sif/src/master/HS21.SIF | Hock and Schittkowski problem number 21.\n\nclassification QLR2-AN-2-1\n\n A. Montoison, Montreal, 04/2018.\n | problem 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 |
| 167 | 2 | false | 0 | false | true | hs211 | false | false | false | false | other | unconstrained | -Inf | 750.0 | true | missing | unknown | https://doi.org/10.1007/978-3-642-61582-5 | Hock and Schittkowski problem number 211.\n | Problem 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 |
| 168 | 4 | false | 2 | false | true | hs219 | true | false | false | false | linear | general | -1.0 | -1.0 | true | true | unknown | https://doi.org/10.1007/978-3-642-61582-5 | Schittkowski problem number 219.\n\nSolution is: (1, 1, 0, 0) with f(x^*) = -1\n | Problem 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 |
| 169 | 2 | false | 2 | false | true | hs22 | false | true | false | false | least_squares | general | -Inf | Inf | missing | missing | unknown | https://bitbucket.org/optrove/sif/src/master/HS22.SIF | Hock and Schittkowski problem number 22.\n\nclassification QQR2-AN-2-2\n\n A. Montoison, Montreal, 04/2018.\n | problem 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 |
| 170 | 2 | false | 1 | false | true | hs220 | true | false | true | false | other | general | 1 | 25000 | true | missing | unknown | https://doi.org/10.1007/978-3-642-61582-5 | Hock and Schittkowski problem number 220.\n | Problem 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 |
| 171 | 2 | false | 1 | false | true | hs221 | false | true | true | false | other | general | -1 | -0.25 | true | missing | unknown | https://doi.org/10.1007/978-3-642-61582-5 | Hock and Schittkowski problem number 221.\n | Problem 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 |
| 172 | 2 | false | 1 | false | true | hs222 | false | true | true | false | other | general | -1.5 | -1.3 | true | missing | unknown | https://doi.org/10.1007/978-3-642-61582-5 | Hock and Schittkowski problem number 222.\n | Problem 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 |
| 173 | 2 | false | 2 | false | true | hs223 | false | true | true | false | other | general | -0.834032 | -0.1 | true | missing | unknown | https://doi.org/10.1007/978-3-642-61582-5 | Hock and Schittkowski problem number 223.\n | Problem 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 |
| 174 | 2 | false | 4 | false | true | hs224 | false | true | true | false | other | linear | -304 | -304 | true | missing | unknown | https://doi.org/10.1007/978-3-642-61582-5 | Hock and Schittkowski problem number 224.\n | Problem 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 |
| 175 | 2 | false | 5 | false | true | hs225 | false | true | false | false | other | general | 2 | 2 | true | missing | unknown | https://doi.org/10.1007/978-3-642-61582-5 | Hock and Schittkowski problem number 225.\n | Problem 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 |
| 176 | 2 | false | 2 | false | true | hs226 | false | true | true | false | other | general | -0.5 | -0.5 | true | missing | unknown | https://doi.org/10.1007/978-3-642-61582-5 | Hock and Schittkowski problem number 226.\n | Problem 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 |
| 177 | 2 | false | 2 | false | true | hs227 | false | true | false | false | other | general | 1 | 1 | true | missing | unknown | https://doi.org/10.1007/978-3-642-61582-5 | Hock and Schittkowski problem number 227.\n | Problem 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 |
| 178 | 2 | false | 2 | false | true | hs228 | false | true | false | false | other | general | -3 | -3 | true | missing | unknown | https://doi.org/10.1007/978-3-642-61582-5 | Hock and Schittkowski problem number 228.\n | Problem 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 |
| 179 | 2 | false | 0 | false | true | hs229 | false | false | true | false | other | unconstrained | 0 | 0 | true | missing | unknown | https://doi.org/10.1007/978-3-642-61582-5 | Hock and Schittkowski problem number 229.\n | Problem 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 |
| 180 | 2 | false | 5 | false | true | hs23 | false | true | true | false | least_squares | general | -Inf | Inf | missing | missing | unknown | https://bitbucket.org/optrove/sif/src/master/HS23.SIF | Hock and Schittkowski problem number 23.\n\nclassification QQR2-AN-2-5\n\nA. Montoison, Montreal, 04/2018.\n | problem 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 |
| 181 | 2 | false | 2 | false | true | hs230 | false | true | false | false | other | general | 0.375 | 0.375 | true | missing | unknown | https://doi.org/10.1007/978-3-642-61582-5 | Hock and Schittkowski problem number 230.\n | Problem 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 |
| 182 | 2 | false | 2 | false | true | hs231 | false | true | false | false | other | linear | 0 | 0 | true | missing | unknown | https://doi.org/10.1007/978-3-642-61582-5 | Hock and Schittkowski problem number 231.\n | Problem 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 |
| 183 | 2 | false | 3 | false | true | hs232 | false | true | true | false | other | linear | -1 | -1 | true | missing | unknown | https://doi.org/10.1007/978-3-642-61582-5 | Hock and Schittkowski problem number 232.\n | Problem 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 |
| 184 | 2 | false | 1 | false | true | hs233 | false | true | false | false | other | general | 0 | 0 | true | missing | unknown | https://doi.org/10.1007/978-3-642-61582-5 | Hock and Schittkowski problem number 233.\n | Problem 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 |
| 185 | 2 | false | 1 | false | true | hs234 | false | true | true | false | other | general | -0.8 | -0.8 | true | missing | unknown | https://doi.org/10.1007/978-3-642-61582-5 | Hock and Schittkowski problem number 234.\n | Problem 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 |
| 186 | 3 | false | 1 | false | true | hs235 | true | false | false | false | other | general | 0.04 | 0.04 | true | missing | unknown | https://doi.org/10.1007/978-3-642-61582-5 | Hock and Schittkowski problem number 235.\n | Problem 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 |
| 187 | 2 | false | 2 | false | true | hs236 | false | true | true | false | other | general | -58.9034 | -58.9034 | true | missing | unknown | https://doi.org/10.1007/978-3-642-61582-5 | Hock and Schittkowski problem number 236.\n | Problem 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 |
| 188 | 2 | false | 3 | false | true | hs237 | false | true | true | false | other | general | -58.9034 | -58.9034 | true | missing | unknown | https://doi.org/10.1007/978-3-642-61582-5 | Hock and Schittkowski problem number 237.\n | Problem 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 |
| 189 | 2 | false | 3 | false | true | hs238 | false | true | true | false | other | general | -58.9034 | -58.9034 | true | missing | unknown | https://doi.org/10.1007/978-3-642-61582-5 | Hock and Schittkowski problem number 238.\n | Problem 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 |
| 190 | 2 | false | 1 | false | true | hs239 | false | true | true | false | other | general | -58.9034 | -58.9034 | true | missing | unknown | https://doi.org/10.1007/978-3-642-61582-5 | Hock and Schittkowski problem number 239.\n | Problem 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 |
| 191 | 2 | false | 2 | false | true | hs24 | false | true | true | false | other | linear | -Inf | -0.0133646 | true | missing | unknown | https://bitbucket.org/optrove/sif/src/master/HS24.SIF | Hock and Schittkowski problem number 24.\n\nclassification OLR2-AN-2-3\n\nclassification PLR2-AN-2-3\n\nA. Montoison, Montreal, 04/2018.\n | problem 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 |
| 192 | 3 | false | 0 | false | true | hs240 | false | false | false | false | other | unconstrained | 0 | 0 | true | missing | unknown | https://doi.org/10.1007/978-3-642-61582-5 | Hock and Schittkowski problem number 240.\n | Problem 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 |
| 193 | 3 | false | 0 | false | true | hs241 | false | false | false | false | other | unconstrained | 0 | 0 | true | missing | unknown | https://doi.org/10.1007/978-3-642-61582-5 | Hock and Schittkowski problem number 241.\n | Problem 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 |
| 194 | 3 | false | 0 | false | true | hs242 | false | false | true | false | other | unconstrained | 0 | 0 | true | missing | unknown | https://doi.org/10.1007/978-3-642-61582-5 | Hock and Schittkowski problem number 242.\n | Problem 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 |
| 195 | 3 | false | 0 | false | true | hs243 | false | false | false | false | other | unconstrained | 0.7966 | 0.7966 | true | missing | unknown | https://doi.org/10.1007/978-3-642-61582-5 | Hock and Schittkowski problem number 243.\n | Problem 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 |
| 196 | 3 | false | 0 | false | true | hs244 | false | false | false | false | other | unconstrained | 0 | 0 | true | missing | unknown | https://doi.org/10.1007/978-3-642-61582-5 | Hock and Schittkowski problem number 244.\n | Problem 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 |
| 197 | 3 | false | 0 | false | true | hs245 | false | false | false | false | other | unconstrained | 0 | 0 | true | missing | unknown | https://doi.org/10.1007/978-3-642-61582-5 | Hock and Schittkowski problem number 245.\n | Problem 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 |
| 198 | 3 | false | 0 | false | true | hs246 | false | false | false | false | other | unconstrained | 0 | 0 | true | missing | unknown | https://doi.org/10.1007/978-3-642-61582-5 | Hock and Schittkowski problem number 246.\n | Problem 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 |
| 199 | 3 | false | 2 | false | true | hs248 | false | false | false | false | other | general | -0.8 | -0.8 | true | missing | unknown | https://doi.org/10.1007/978-3-642-61582-5 | Hock and Schittkowski problem number 248.\n | Problem 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 |
| 200 | 3 | false | 1 | false | true | hs249 | false | true | true | false | other | general | 1 | 1 | true | missing | unknown | https://doi.org/10.1007/978-3-642-61582-5 | Hock and Schittkowski problem number 249.\n | Problem 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 |
| 201 | 3 | false | 0 | false | true | hs25 | false | false | true | false | other | unconstrained | -Inf | 32.835 | true | missing | unknown | https://bitbucket.org/optrove/sif/src/master/HS25.SIF | Hock 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.\n | problem 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 |
| 202 | 3 | false | 2 | false | true | hs250 | false | true | true | false | other | linear | -3300 | -3300 | true | missing | unknown | https://doi.org/10.1007/978-3-642-61582-5 | Hock and Schittkowski problem number 250.\n | Problem 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 |
| 203 | 3 | false | 1 | false | true | hs251 | false | true | true | false | other | linear | -3456 | -3456 | true | missing | unknown | https://doi.org/10.1007/978-3-642-61582-5 | Hock and Schittkowski problem number 251.\n | Problem 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 |
| 204 | 3 | false | 1 | false | true | hs252 | true | false | false | false | other | general | 0.04 | 0.04 | true | missing | unknown | https://doi.org/10.1007/978-3-642-61582-5 | Hock and Schittkowski problem number 252.\n | Problem 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 |
| 205 | 3 | false | 1 | false | true | hs253 | false | true | true | false | other | linear | 87.3794 | 87.3794 | true | missing | unknown | https://doi.org/10.1007/978-3-642-61582-5 | Hock and Schittkowski problem number 253.\n | Problem 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 |
| 206 | 3 | false | 2 | false | true | hs254 | true | false | true | false | other | general | -1.73205 | -1.73205 | true | missing | unknown | https://doi.org/10.1007/978-3-642-61582-5 | Hock and Schittkowski problem number 254.\n | Problem 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 |
| 207 | 4 | false | 0 | false | true | hs255 | false | false | false | false | other | unconstrained | 0 | 0 | true | missing | unknown | https://doi.org/10.1007/978-3-642-61582-5 | Hock and Schittkowski problem number 255.\n | Problem 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 |
| 208 | 4 | false | 0 | false | true | hs256 | false | false | false | false | other | unconstrained | 0 | 0 | true | missing | unknown | https://doi.org/10.1007/978-3-642-61582-5 | Hock and Schittkowski problem number 256.\n | Problem 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 |
| 209 | 4 | false | 0 | false | true | hs257 | false | false | true | false | other | unconstrained | 0 | 0 | true | missing | unknown | https://doi.org/10.1007/978-3-642-61582-5 | Hock and Schittkowski problem number 257.\n | Problem 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 |
| 210 | 4 | false | 0 | false | true | hs258 | false | false | false | false | other | unconstrained | 0 | 0 | true | missing | unknown | https://doi.org/10.1007/978-3-642-61582-5 | Hock and Schittkowski problem number 258.\n | Problem 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 |
| 211 | 4 | false | 0 | false | true | hs259 | false | false | false | false | other | unconstrained | 0 | 0 | true | missing | unknown | https://doi.org/10.1007/978-3-642-61582-5 | Hock and Schittkowski problem number 259.\n | Problem 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 |
| 212 | 3 | false | 1 | false | true | hs26 | true | false | false | false | other | general | -Inf | 21.16 | true | missing | unknown | https://bitbucket.org/optrove/sif/src/master/HS26.SIF | Hock and Schittkowski problem number 26.\n\nclassification OOR2-AY-3-1\n\nA. Cebola, Curitiba 10/2016.\n | problem 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 |
| 213 | 4 | false | 0 | false | true | hs260 | false | false | false | false | other | unconstrained | 0 | 0 | true | missing | unknown | https://doi.org/10.1007/978-3-642-61582-5 | Hock and Schittkowski problem number 260.\n | Problem 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 |
| 214 | 4 | false | 0 | false | true | hs261 | false | false | false | false | other | unconstrained | 0 | 0 | true | missing | unknown | https://doi.org/10.1007/978-3-642-61582-5 | Hock and Schittkowski problem number 261.\n | Problem 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 |
| 215 | 4 | false | 4 | false | true | hs262 | false | false | true | false | other | linear | -10 | -10 | true | missing | unknown | https://doi.org/10.1007/978-3-642-61582-5 | Hock and Schittkowski problem number 262.\n | Problem 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 |
| 216 | 4 | false | 4 | false | true | hs263 | false | false | false | false | other | general | -1 | -1 | true | missing | unknown | https://doi.org/10.1007/978-3-642-61582-5 | Hock and Schittkowski problem number 263.\n | Problem 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 |
| 217 | 4 | false | 3 | false | true | hs264 | false | true | false | false | other | general | -44 | -44 | true | missing | unknown | https://doi.org/10.1007/978-3-642-61582-5 | Hock and Schittkowski problem number 264.\n | Problem 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 |
| 218 | 4 | false | 2 | false | true | hs265 | true | false | true | false | other | linear | 0.974747 | 0.974747 | true | missing | unknown | https://doi.org/10.1007/978-3-642-61582-5 | Hock and Schittkowski problem number 265.\n | Problem 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 |
| 219 | 3 | false | 1 | false | true | hs27 | true | false | false | false | other | general | -Inf | Inf | missing | missing | unknown | https://bitbucket.org/optrove/sif/src/master/HS27.SIF | Hock and Schittkowski problem number 27.\n\nclassification SQR2-AN-3-1\n\nA. Cebola, Curitiba 10/2016.\n | problem 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 |
| 220 | 3 | false | 1 | false | true | hs28 | true | false | false | false | least_squares | linear | -Inf | 13.0 | true | missing | unknown | https://bitbucket.org/optrove/sif/src/master/HS28.SIF | Hock and Schittkowski problem number 28.\n\nclassification SLR2-AY-3-1\n\nclassification QLR2-AN-3-1\n\nA. Montoison, Montreal, 04/2018.\n | problem 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 |
| 221 | 3 | false | 1 | false | true | hs29 | false | true | false | false | other | general | -Inf | -1.0 | true | missing | unknown | https://bitbucket.org/optrove/sif/src/master/HS29.SIF | Hock and Schittkowski problem number 29.\n\nclassification OQR2-AN-3-1\n\nclassification PQR2-AN-3-1\n\nA. Montoison, Montreal, 04/2018.\n | problem 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 |
| 222 | 2 | false | 0 | false | true | hs3 | false | false | true | false | other | unconstrained | -Inf | 1.00081 | true | missing | unknown | https://bitbucket.org/optrove/sif/src/master/HS3.SIF | Hock and Schittkowski problem number 3.\n\nclassification QBR2-AN-2-0\n\nN. Antunes, Curitiba, 10/2016.\n | problem 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 |
| 223 | 3 | false | 1 | false | true | hs30 | false | true | true | false | least_squares | general | -Inf | 3.0 | true | missing | unknown | https://bitbucket.org/optrove/sif/src/master/HS30.SIF | Hock and Schittkowski problem number 30.\n\nclassification QQR2-AN-3-1\n\nA. Montoison, Montreal, 04/2018.\n | problem 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 |
| 224 | 3 | false | 1 | false | true | hs31 | false | true | true | false | other | general | -Inf | 19.0 | true | missing | unknown | https://bitbucket.org/optrove/sif/src/master/HS31.SIF | Hock and Schittkowski problem number 31.\n\nclassification QQR2-AN-3-1\n\nA. Montoison, Montreal, 05/2018.\n | problem 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 |
| 225 | 2 | false | 1 | false | true | hs316 | true | false | false | false | quadratic | quadratic | -Inf | Inf | true | missing | academic | https://doi.org/10.1007/978-3-642-61582-5 | Schittkowski problem number 316.\n\n classification QQR2-AN-2-1\n\nM. Gollier, Montréal, 05/2023\n | Problem 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 |
| 226 | 2 | false | 1 | false | true | hs317 | true | false | false | false | quadratic | quadratic | -Inf | Inf | true | missing | academic | https://doi.org/10.1007/978-3-642-61582-5 | Schittkowski problem number 317.\n\n classification QQR2-AN-2-1\n\nM. Gollier, Montréal, 05/2023\n | Problem 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 |
| 227 | 2 | false | 1 | false | true | hs318 | true | false | false | false | quadratic | quadratic | -Inf | Inf | true | missing | academic | https://doi.org/10.1007/978-3-642-61582-5 | Schittkowski problem number 318.\n\n classification QQR2-AN-2-1\n\nM. Gollier, Montréal, 05/2023\n | Problem 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 |
| 228 | 2 | false | 1 | false | true | hs319 | true | false | false | false | quadratic | quadratic | -Inf | Inf | true | missing | academic | https://doi.org/10.1007/978-3-642-61582-5 | Schittkowski problem number 319.\n\n classification QQR2-AN-2-1\n\nM. Gollier, Montréal, 05/2023\n | Problem 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 |
| 229 | 3 | false | 2 | false | true | hs32 | false | false | true | false | other | general | -Inf | 7.2 | true | missing | unknown | https://bitbucket.org/optrove/sif/src/master/HS32.SIF | Hock and Schittkowski problem number 32.\n\nclassification SOR2-AY-3-2\n\nclassification QPR2-AN-3-2\n\nA. Montoison, Montreal, 05/2018.\n | problem 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 |
| 230 | 2 | false | 1 | false | true | hs320 | true | false | false | false | quadratic | quadratic | -Inf | Inf | true | missing | academic | https://doi.org/10.1007/978-3-642-61582-5 | Schittkowski problem number 320.\n\n classification QQR2-AN-2-1\n\nM. Gollier, Montréal, 05/2023\n | Problem 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 |
| 231 | 2 | false | 1 | false | true | hs321 | true | false | false | false | quadratic | quadratic | -Inf | Inf | true | missing | academic | https://doi.org/10.1007/978-3-642-61582-5 | Schittkowski problem number 321.\n\n classification QQR2-AN-2-1\n\nM. Gollier, Montréal, 05/2023\n | Problem 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 |
| 232 | 2 | false | 1 | false | true | hs322 | true | false | false | false | quadratic | quadratic | -Inf | Inf | true | missing | academic | https://doi.org/10.1007/978-3-642-61582-5 | Schittkowski problem number 322.\n\n classification QQR2-AN-2-1\n\nM. Gollier, Montréal, 05/2023\n | Problem 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 |
| 233 | 3 | false | 2 | false | true | hs33 | false | true | true | false | other | general | -Inf | -3.0 | true | missing | unknown | https://bitbucket.org/optrove/sif/src/master/HS33.SIF | Hock and Schittkowski problem number 33.\n\nclassification OQR2-AN-3-2\n\nclassification PQR2-AN-3-2\n\nA. Montoison, Montreal, 05/2018.\n | problem 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 |
| 234 | 3 | false | 2 | false | true | hs34 | false | true | true | false | other | general | -Inf | 0.0 | true | missing | unknown | https://bitbucket.org/optrove/sif/src/master/HS34.SIF | Hock and Schittkowski problem number 34.\n\nclassification LOR2-AN-3-2\n\nclassification LGR2-AN-3-2\n\nA. Montoison, Montreal, 05/2018.\n | problem 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 |
| 235 | 3 | false | 1 | false | true | hs35 | false | true | true | false | other | linear | -Inf | 2.25 | true | missing | unknown | https://bitbucket.org/optrove/sif/src/master/HS35.SIF | Hock and Schittkowski problem number 35.\n\nclassification QLR2-AN-3-1\n\nA. Montoison, Montreal, 05/2018.\n | problem 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 |
| 236 | 3 | false | 1 | false | true | hs36 | false | true | true | false | other | linear | -Inf | -1000.0 | true | missing | unknown | https://bitbucket.org/optrove/sif/src/master/HS36.SIF | Hock and Schittkowski problem number 36.\n\nclassification OLR2-AN-3-1\n\nclassification PLR2-AN-3-1\n\nA. Montoison, Montreal, 05/2018.\n | problem 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 |
| 237 | 3 | false | 1 | false | true | hs37 | false | true | true | false | other | linear | -Inf | -1000.0 | true | missing | unknown | https://bitbucket.org/optrove/sif/src/master/HS37.SIF | Hock and Schittkowski problem number 37.\n\nclassification OLR2-AN-3-2\n\nclassification PLR2-AN-3-2\n\nA. Montoison, Montreal, 05/2018.\n | problem 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 |
| 238 | 10 | false | 3 | false | true | hs378 | true | false | false | false | other | general | -Inf | Inf | true | missing | academic | https://doi.org/10.1007/978-3-642-61582-5 | Schittkowski problem number 378.\n\n classification OOR2-AN-10-3\n\nM. Gollier, Montréal, 05/2023\n | Problem 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 |
| 239 | 4 | false | 0 | false | true | hs38 | false | false | true | false | other | unconstrained | -Inf | 19192.0 | true | missing | unknown | https://bitbucket.org/optrove/sif/src/master/HS38.SIF | Hock 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.\n | problem 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 |
| 240 | 4 | false | 2 | false | true | hs39 | true | false | false | false | other | general | -Inf | Inf | missing | missing | unknown | https://bitbucket.org/optrove/sif/src/master/HS39.SIF | Hock and Schittkowski problem number 39.\n\nclassification LOR2-AN-4-2\n\nD. Cabral, Curitiba, 10/2016.\n | problem 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 |
| 241 | 2 | false | 0 | false | true | hs4 | false | false | true | false | other | unconstrained | -Inf | 3.32357 | true | missing | unknown | https://bitbucket.org/optrove/sif/src/master/HS4.SIF | Hock and Schittkowski problem number 4.\n\nclassification OBR2-AN-2-0\n\nN. Antunes, Curitiba, 10/2016.\n | problem 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 |
| 242 | 4 | false | 3 | false | true | hs40 | true | false | false | false | other | general | -Inf | Inf | missing | missing | unknown | https://bitbucket.org/optrove/sif/src/master/HS40.SIF | Hock and Schittkowski problem number 40.\n\nclassification OOR2-AN-4-3\n\nD. Cabral, Curitiba, 10/2016.\n | problem 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 |
| 243 | 4 | false | 1 | false | true | hs41 | true | false | true | false | other | linear | -Inf | Inf | missing | missing | unknown | https://bitbucket.org/optrove/sif/src/master/HS41.SIF | Hock and Schittkowski problem number 41.\n\nclassification OLR2-AN-4-1\n\nclassification PLR2-AN-4-1\n\nA. Montoison, Montreal, 05/2018.\n | problem 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 |
| 244 | 4 | false | 2 | false | true | hs42 | true | false | false | false | least_squares | general | -Inf | Inf | missing | missing | unknown | https://bitbucket.org/optrove/sif/src/master/HS42.SIF | Hock and Schittkowski problem number 42.\n\nclassification SQR2-AN-4-2\n\nclassification QQR2-AN-4-1\n\nA. Montoison, Montreal, 05/2018.\n | problem 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 |
| 245 | 4 | false | 3 | false | true | hs43 | false | true | false | false | other | general | -Inf | 0.0 | true | missing | unknown | https://bitbucket.org/optrove/sif/src/master/HS43.SIF | Hock and Schittkowski problem number 43.\n\nThe Rosen-Suzuki test problem.\n\nclassification QQR2-AN-4-3\n\nA. Montoison, Montreal, 05/2018.\n | problem 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 |
| 246 | 4 | false | 6 | false | true | hs44 | false | true | true | false | other | linear | -Inf | 0.0 | true | missing | unknown | https://bitbucket.org/optrove/sif/src/master/HS44.SIF | Hock and Schittkowski problem number 44.\n\nclassification QLR2-AN-4-6\n\nA. Montoison, Montreal, 05/2018.\n | problem 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 |
| 247 | 5 | false | 0 | false | true | hs45 | false | false | true | false | other | unconstrained | -Inf | 1.73333 | true | missing | unknown | https://bitbucket.org/optrove/sif/src/master/HS45.SIF | Hock and Schittkowski problem number 45.\n\nclassification OBR2-AN-5-0\n\nclassification PBR2-AN-5-0\n\nA. Montoison, Montreal, 05/2018.\n | problem 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 |
| 248 | 5 | false | 2 | false | true | hs46 | true | false | false | false | other | general | -Inf | Inf | missing | missing | unknown | https://bitbucket.org/optrove/sif/src/master/HS46.SIF | Hock and Schittkowski problem number 46.\n\nclassification OOR2-AY-5-2\n\nclassification PGR2-AN-5-2\n\nA. Montoison, Montreal, 05/2018.\n | problem 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 |
| 249 | 5 | false | 3 | false | true | hs47 | true | false | false | false | other | general | -Inf | 20.7381 | true | missing | unknown | https://bitbucket.org/optrove/sif/src/master/HS47.SIF | Hock and Schittkowski problem number 47.\n\nclassification OOR2-AY-5-3\n\nclassification PPR2-AN-5-3\n\nA. Montoison, Montreal, 05/2018.\n | problem 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 |
| 250 | 5 | false | 2 | false | true | hs48 | true | false | false | false | least_squares | linear | -Inf | 84.0 | true | missing | unknown | https://bitbucket.org/optrove/sif/src/master/HS48.SIF | Hock and Schittkowski problem number 48.\n\nclassification SLR2-AY-5-2\n\nclassification QLR2-AN-5-2\n\nA. Montoison, Montreal, 05/2018.\n | problem 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 |
| 251 | 5 | false | 2 | false | true | hs49 | true | false | false | false | other | linear | -Inf | 266.0 | true | missing | unknown | https://bitbucket.org/optrove/sif/src/master/HS49.SIF | Hock and Schittkowski problem number 49.\n\nclassification OLR2-AY-5-2\n\nclassification PLR2-AN-5-2\n\nA. Montoison, Montreal, 05/2018.\n | problem 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 |
| 252 | 2 | false | 0 | false | true | hs5 | false | false | true | false | other | unconstrained | -Inf | 1.0 | true | missing | unknown | https://bitbucket.org/optrove/sif/src/master/HS5.SIF | Hock and Schittkowski problem number 5.\n\nclassification OBR2-AN-2-0\n\nN. Antunes, Curitiba, 10/2016.\n | problem 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 |
| 253 | 5 | false | 3 | false | true | hs50 | true | false | false | false | other | linear | -Inf | 7516.0 | true | missing | unknown | https://bitbucket.org/optrove/sif/src/master/HS50.SIF | Hock and Schittkowski problem number 50.\n\nclassification OLR2-AY-5-3\n\nclassification PLR2-AN-5-3\n\nA. Montoison, Montreal, 05/2018.\n | problem 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 |
| 254 | 5 | false | 3 | false | true | hs51 | true | false | false | false | least_squares | linear | -Inf | 8.5 | true | missing | unknown | https://bitbucket.org/optrove/sif/src/master/HS51.SIF | Hock and Schittkowski problem number 51.\n\nclassification QLR2-AY-5-3\n\nclassification QLR2-AN-5-3\n\nA. Montoison, Montreal, 05/2018.\n | problem 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 |
| 255 | 5 | false | 3 | false | true | hs52 | true | false | false | false | least_squares | linear | -Inf | Inf | missing | missing | unknown | https://bitbucket.org/optrove/sif/src/master/HS52.SIF | Hock and Schittkowski problem number 52.\n\nclassification QLR2-AY-5-3\n\nclassification QLR2-AN-5-3\n\nA. Montoison, Montreal, 05/2018.\n | problem 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 |
| 256 | 5 | false | 3 | false | true | hs53 | true | false | true | false | least_squares | linear | -Inf | Inf | missing | missing | unknown | https://bitbucket.org/optrove/sif/src/master/HS53.SIF | Hock and Schittkowski problem number 53.\n\nclassification QLR2-AY-5-3\n\nclassification QLR2-AN-5-3\n\nA. Montoison, Montreal, 05/2018.\n | problem 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 |
| 257 | 6 | false | 1 | false | true | hs54 | true | false | true | false | other | linear | -Inf | Inf | missing | missing | unknown | https://bitbucket.org/optrove/sif/src/master/HS54.SIF | Hock and Schittkowski problem number 54.\n\nclassification OLR2-AN-6-1\n\nclassification GLR2-AN-6-1\n\nA. Montoison, Montreal, 05/2018.\n | problem 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 |
| 258 | 6 | false | 6 | false | true | hs55 | true | false | true | false | other | linear | -Inf | Inf | missing | missing | unknown | https://bitbucket.org/optrove/sif/src/master/HS55.SIF | Hock and Schittkowski problem number 54.\n\nclassification OLR2-AN-6-6\n\nclassification GLR2-AN-6-1\n\nA. Montoison, Montreal, 05/2018.\n | problem 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 |
| 259 | 7 | false | 4 | false | true | hs56 | true | false | false | false | other | general | -Inf | Inf | missing | missing | unknown | https://bitbucket.org/optrove/sif/src/master/HS56.SIF | classification OOR2-AN-7-4\n\nclassification PGR2-AN-7-4\n\nA. Montoison, Montreal, 05/2018.\n | problem 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 |
| 260 | 2 | false | 1 | false | true | hs57 | false | true | true | false | least_squares | general | -Inf | 0.0307986 | true | missing | unknown | https://bitbucket.org/optrove/sif/src/master/HS57.SIF | classification SQR2-AN-2-1\n\nclassification SQR-AN-2-1\n\nA. Montoison, Montreal, 05/2018.\n | problem 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 |
| 261 | 2 | false | 3 | false | true | hs59 | false | true | true | false | other | general | -Inf | Inf | missing | missing | unknown | https://bitbucket.org/optrove/sif/src/master/HS59.SIF | Hock and Schittkowski problem number 54.\n\nclassification OQR2-AN-2-3\n\nclassification GLR2-AN-6-1\n\nA. Montoison, Montreal, 05/2018.\n | problem 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 |
| 262 | 2 | false | 1 | false | true | hs6 | true | false | false | false | least_squares | general | -Inf | Inf | missing | missing | unknown | https://bitbucket.org/optrove/sif/src/master/HS6.SIF | classification QQR2-AN-2-1\n \n D. Orban, Montreal, 04/2016.\n | problem 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 |
| 263 | 3 | false | 1 | false | true | hs60 | true | false | true | false | other | general | -Inf | Inf | missing | missing | unknown | https://bitbucket.org/optrove/sif/src/master/HS60.SIF | Hock and Schittkowski problem number 60.\n\nclassification OOR2-AY-3-1\n\nclassification PPR2-AN-3-1\n\nA. Montoison, Montreal, 05/2018.\n | problem 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 |
| 264 | 3 | false | 2 | false | true | hs61 | true | false | false | false | other | general | -Inf | Inf | missing | missing | unknown | https://bitbucket.org/optrove/sif/src/master/HS61.SIF | Hock and Schittkowski problem number 61.\n\nclassification QQR2-AN-3-2\nA. Montoison, Montreal, 05/2018.\n | problem 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 |
| 265 | 3 | false | 1 | false | true | hs62 | true | false | true | false | other | linear | -Inf | Inf | missing | missing | unknown | https://bitbucket.org/optrove/sif/src/master/HS62.SIF | Hock and Schittkowski problem number 62.\n\nclassification OLR2-AY-3-1\n\nclassification GLR2-AN-3-1\nA. Montoison, Montreal, 05/2018.\n | problem 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 |
| 266 | 3 | false | 2 | false | true | hs63 | true | false | true | false | other | general | -Inf | Inf | missing | missing | unknown | https://bitbucket.org/optrove/sif/src/master/HS63.SIF | Hock and Schittkowski problem number 63.\n\nclassification QQR2-AY-3-2\n\nclassification QQR2-AN-3-2\nA. Montoison, Montreal, 05/2018.\n | problem 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 |
| 267 | 3 | false | 1 | false | true | hs64 | false | true | true | false | other | general | -Inf | Inf | missing | missing | unknown | https://bitbucket.org/optrove/sif/src/master/HS64.SIF | Hock and Schittkowski problem number 64.\n\nclassification OOR2-AN-3-1\n\nclassification PPR2-AN-3-1\n\nA. Montoison, Montreal, 05/2018.\n | problem 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 |
| 268 | 3 | false | 1 | false | true | hs65 | false | true | true | false | other | general | -Inf | Inf | missing | missing | unknown | https://bitbucket.org/optrove/sif/src/master/HS65.SIF | Hock and Schittkowski problem number 65.\n\nclassification QQR2-AN-3-1\n\nA. Montoison, Montreal, 05/2018.\n | problem 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 |
| 269 | 3 | false | 2 | false | true | hs66 | false | true | true | false | other | general | -Inf | 0.58 | true | missing | unknown | https://bitbucket.org/optrove/sif/src/master/HS66.SIF | Hock and Schittkowski problem number 66.\n\nclassification LOR2-AN-3-2\n\nclassification LGR2-AN-3-2\n\nA. Montoison, Montreal, 05/2018.\n | problem 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 |
| 270 | 4 | false | 2 | false | true | hs68 | true | false | true | false | other | general | -Inf | Inf | true | missing | unknown | https://bitbucket.org/optrove/sif/src/master/HS68.SIF | Hock and Schittkowski problem number 68.\n\nThis is a cost optimal inspection plan.\n\nclassification OOR2-MN-4-2\n\nclassification GGR-P1-1\n | Original 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 |
| 271 | 4 | false | 2 | false | true | hs69 | true | false | true | false | other | general | -Inf | Inf | true | missing | unknown | https://bitbucket.org/optrove/sif/src/master/HS69.SIF | Hock and Schittkowski problem number 69.\n\nThis is a cost optimal inspection plan.\n\nclassification OOR2-MN-4-2\n\nclassification GGR-P1-2\n | Original 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 |
| 272 | 2 | false | 1 | false | true | hs7 | true | false | false | false | other | general | -Inf | Inf | missing | missing | unknown | https://bitbucket.org/optrove/sif/src/master/HS7.SIF | Hock and Schittkowski problem number 7.\n\nclassification OOR2-AN-2-1\n\nD. Orban, Montreal, 04/2016.\n | problem 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 |
| 273 | 4 | false | 1 | false | true | hs70 | false | true | true | false | other | general | -Inf | 0.987859 | true | missing | unknown | https://bitbucket.org/optrove/sif/src/master/HS70.SIF | Hock 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.\n | problem 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 |
| 274 | 4 | false | 2 | false | true | hs71 | false | false | true | false | other | general | -Inf | Inf | missing | missing | unknown | https://bitbucket.org/optrove/sif/src/master/HS71.SIF | Hock and Schittkowski problem number 71.\n\nclassification OOR2-AY-4-2\n\nclassification PPR2-AN-4-2\n\nA. Montoison, Montreal, 05/2018.\n | problem 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 |
| 275 | 4 | false | 2 | false | true | hs72 | false | true | true | false | other | general | -Inf | Inf | missing | missing | unknown | https://bitbucket.org/optrove/sif/src/master/HS72.SIF | Hock 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.\n | problem 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 |
| 276 | 4 | false | 3 | false | true | hs73 | false | false | true | false | other | general | -Inf | Inf | missing | missing | unknown | https://bitbucket.org/optrove/sif/src/master/HS73.SIF | Hock 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.\n | problem 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 |
| 277 | 4 | false | 4 | false | true | hs74 | false | false | true | false | other | general | -Inf | Inf | missing | missing | unknown | https://bitbucket.org/optrove/sif/src/master/HS74.SIF | Hock and Schittkowski problem number 74.\n\nclassification OOR2-AY-4-5\n\nclassification PGR-AN-4-5\n\nA. Montoison, Montreal, 05/2018.\n | problem 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 |
| 278 | 4 | false | 4 | false | true | hs75 | false | false | true | false | other | general | -Inf | Inf | missing | missing | unknown | https://bitbucket.org/optrove/sif/src/master/HS75.SIF | Hock and Schittkowski problem number 75.\n\nclassification OOR2-AY-4-5\n\nclassification PGR-AN-4-5\n\nA. Montoison, Montreal, 05/2018.\n | problem 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 |
| 279 | 4 | false | 3 | false | true | hs76 | false | true | true | false | other | linear | -Inf | -1.25 | true | missing | unknown | https://bitbucket.org/optrove/sif/src/master/HS76.SIF | Hock and Schittkowski problem number 76.\n\nclassification QLR2-AN-4-3\n\nclassification QLR-AN-4-3\n\nA. Montoison, Montreal, 05/2018.\n | problem 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 |
| 280 | 5 | false | 2 | false | true | hs77 | true | false | false | false | other | general | -Inf | Inf | missing | missing | unknown | https://bitbucket.org/optrove/sif/src/master/HS77.SIF | Hock and Schittkowski problem number 77.\n\nclassification OOR2-AY-5-2\n\nclassification PGR-AN-5-2\n\nA. Montoison, Montreal, 05/2018.\n | problem 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 |
| 281 | 5 | false | 3 | false | true | hs78 | true | false | false | false | other | general | -Inf | Inf | missing | missing | unknown | https://bitbucket.org/optrove/sif/src/master/HS78.SIF | Hock and Schittkowski problem number 78.\n\nclassification OOR2-AN-5-3\n\nclassification PPR-AN-5-3\n\nA. Montoison, Montreal, 05/2018.\n | problem 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 |
| 282 | 5 | false | 3 | false | true | hs79 | true | false | false | false | other | general | -Inf | Inf | missing | missing | unknown | https://bitbucket.org/optrove/sif/src/master/HS79.SIF | Hock and Schittkowski problem number 79.\n\nclassification OOR2-AY-5-3\n\nclassification PPR-AN-5-3\n\nA. Montoison, Montreal, 05/2018.\n | problem 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 |
| 283 | 2 | false | 2 | false | true | hs8 | true | false | false | false | other | general | -Inf | Inf | missing | missing | unknown | https://bitbucket.org/optrove/sif/src/master/HS8.SIF | Hock and Schittkowski problem number 8.\n\nclassification CQR2-AN-2-2\n\nclassification OOR2-AN-2-1\n\nD. Orban, Montreal, 04/2016.\n | problem 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 |
| 284 | 5 | false | 3 | false | true | hs80 | true | false | true | false | other | general | -Inf | Inf | missing | missing | unknown | https://bitbucket.org/optrove/sif/src/master/HS80.SIF | Hock and Schittkowski problem number 80.\n\nclassification OOR2-AN-5-3\n\nclassification GPR-AN-5-3\n\nA. Montoison, Montreal, 05/2018.\n | problem 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 |
| 285 | 5 | false | 3 | false | true | hs81 | true | false | true | false | other | general | -Inf | Inf | missing | missing | unknown | https://bitbucket.org/optrove/sif/src/master/HS81.SIF | Hock and Schittkowski problem number 81.\n\nclassification OOR2-AN-5-3\n\nclassification GPR-AN-5-3\n\nA. Montoison, Montreal, 05/2018.\n | Problem 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 |
| 286 | 5 | false | 3 | false | true | hs83 | false | true | true | false | other | general | -Inf | Inf | missing | missing | unknown | https://bitbucket.org/optrove/sif/src/master/HS83.SIF | Hock and Schittkowski problem number 83.\n\nclassification QQR2-AN-5-3\n\nclassification QQR-AN-5-3\n\nA. Montoison, Montreal, 05/2018.\n | problem 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 |
| 287 | 5 | false | 3 | false | true | hs84 | false | true | true | false | other | general | -Inf | -2.35124e6 | true | missing | unknown | https://bitbucket.org/optrove/sif/src/master/HS84.SIF | Hock and Schittkowski problem number 84.\n\nclassification QQR2-AN-5-3\n\nclassification QQR-AN-5-3\n\nA. Montoison, Montreal, 05/2018.\n | problem 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 |
| 288 | 5 | false | 10 | false | true | hs86 | false | true | true | false | other | linear | -Inf | 20.0 | true | missing | unknown | https://bitbucket.org/optrove/sif/src/master/HS86.SIF | Hock and Schittkowski problem number 86.\n\nclassification OLR2-AN-5-10\n\nclassification PLR-AN-5-10\n\nA. Montoison, Montreal, 05/2018.\n | problem 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 |
| 289 | 6 | false | 4 | false | true | hs87 | true | false | true | false | other | general | -Inf | Inf | true | missing | unknown | https://bitbucket.org/optrove/sif/src/master/HS87.SIF | Hock 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\n | problem 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 |
| 290 | 2 | false | 1 | false | true | hs9 | true | false | false | false | other | linear | -Inf | 0.0 | true | missing | unknown | https://bitbucket.org/optrove/sif/src/master/HS9.SIF | Hock and Schittkowski problem number 9.\n\nclassification OLR2-AN-2-1\n\nA. Cebola, Curitiba , 10/2016.\n | problem 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 |
| 291 | 6 | false | 2 | false | true | hs93 | false | true | true | false | other | general | -Inf | 137.066 | true | missing | unknown | https://bitbucket.org/optrove/sif/src/master/HS93.SIF | Hock 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.\n | problem 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 |
| 292 | 6 | false | 4 | false | true | hs95 | false | true | true | false | other | general | -Inf | Inf | missing | missing | unknown | https://bitbucket.org/optrove/sif/src/master/HS95.SIF | Hock and Schittkowski problem number 95.\n\nclassification LQR2-AN-6-4\n\nclassification PPR-AN-6-4\n\nA. Montoison, Montreal, 05/2018.\n | problem 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 |
| 293 | 6 | false | 4 | false | true | hs96 | false | true | true | false | other | general | -Inf | Inf | missing | missing | unknown | https://bitbucket.org/optrove/sif/src/master/HS96.SIF | Hock and Schittkowski problem number 96.\n\nclassification LQR2-AN-6-4\n\nclassification PPR-AN-6-4\n\nA. Montoison, Montreal, 05/2018.\n | problem 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 |
| 294 | 6 | false | 4 | false | true | hs97 | false | true | true | false | other | general | -Inf | Inf | missing | missing | unknown | https://bitbucket.org/optrove/sif/src/master/HS97.SIF | Hock and Schittkowski problem number 97.\n\nclassification LQR2-AN-6-4\n\nclassification PPR-AN-6-4\n\nA. Montoison, Montreal, 05/2018.\n | problem 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 |
| 295 | 6 | false | 4 | false | true | hs98 | false | true | true | false | other | general | -Inf | Inf | missing | missing | unknown | https://bitbucket.org/optrove/sif/src/master/HS98.SIF | Hock and Schittkowski problem number 98.\n\nclassification LQR2-AN-6-4\n\nclassification PPR-AN-6-4\n\nA. Montoison, Montreal, 05/2018.\n | problem 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 |
| 296 | 7 | false | 2 | false | true | hs99 | true | false | true | false | other | general | -Inf | Inf | missing | missing | unknown | https://bitbucket.org/optrove/sif/src/master/HS99.SIF | Hock and Schittkowski problem number 99.\n\nclassification OOR2-AN-7-2\n\nclassification PPR-AN-6-4\n | problem 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 |
| 297 | 100 | true | 0 | false | true | indef_mod | false | false | false | false | other | unconstrained | -Inf | 91.6655 | true | missing | unknown | http://www.cs.cas.cz/matonoha/download/V1081.pdf | Problem 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 |
| 298 | 100 | true | 0 | false | true | integreq | false | false | false | false | least_squares | unconstrained | -Inf | 0.0 | true | missing | unknown | https://bitbucket.org/optrove/sif/src/master/INTEGREQ.SIF | The discrete integral problem.\n\nclassification NOR2-AN-V-V\n | problem 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 |
| 299 | 2 | false | 0 | false | true | jennrichsampson | false | false | false | false | least_squares | unconstrained | -Inf | 4171.31 | true | missing | unknown | https://doi.org/10.1145/355934.355936 | \n | problem 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 |
| 300 | 5 | false | 0 | false | true | kirby2 | false | false | false | false | least_squares | unconstrained | -Inf | 500.0 | true | missing | unknown | https://bitbucket.org/optrove/sif/src/master/KIRBY2.SIF | https://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\n | Problem 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}\n | CUTEst:KIRBY2, NIST:Kirby2 |
| 301 | 4 | false | 0 | false | true | kowosb | false | false | false | false | least_squares | unconstrained | -Inf | 0.0264978 | true | missing | unknown | https://bitbucket.org/optrove/sif/src/master/KOWOSB.SIF | A 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\n | Problem 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 |
| 302 | 6 | false | 0 | false | true | lanczos1 | false | false | false | false | least_squares | unconstrained | -Inf | 500.0 | true | missing | unknown | https://bitbucket.org/optrove/sif/src/master/LANCZOS1.SIF | https://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\n | Problem 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}\n | CUTEst:LANCZOS1, NIST:lanczos1 |
| 303 | 6 | false | 0 | false | true | lanczos2 | false | false | false | false | least_squares | unconstrained | -Inf | 500.0 | true | missing | unknown | https://bitbucket.org/optrove/sif/src/master/LANCZOS2.SIF | https://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\n | Problem 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}\n | CUTEst:LANCZOS2, NIST:Lanczos2 |
| 304 | 6 | false | 0 | false | true | lanczos3 | false | false | false | false | least_squares | unconstrained | -Inf | 500.0 | true | missing | unknown | https://bitbucket.org/optrove/sif/src/master/LANCZOS3.SIF | https://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\n | Problem 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}\n | CUTEst:LANCZOS3, NIST:Lanczos3 |
| 305 | 100 | true | 0 | false | true | liarwhd | false | false | false | false | other | unconstrained | -Inf | 58500.0 | true | missing | unknown | https://bitbucket.org/optrove/sif/src/master/LIARWHD.SIF | G. 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.\n | G. 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 |
| 306 | 15 | false | 11 | false | true | lincon | false | false | false | false | other | linear | -Inf | Inf | missing | missing | unknown | https://github.com/JuliaSmoothOptimizers/NLPModelsTest.jl | \n | Test 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 | |
| 307 | 2 | false | 2 | false | true | linsv | false | true | false | false | other | linear | -Inf | Inf | missing | missing | unknown | https://github.com/JuliaSmoothOptimizers/NLPModelsTest.jl | \n | Test 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 | |
| 308 | 111 | true | 40 | true | true | marine | true | false | true | false | other | general | -Inf | Inf | missing | missing | unknown | https://bitbucket.org/optrove/sif/src/master/MARINE.SIF | Marine 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\n | This 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 |
| 309 | 3005 | true | 3000 | true | true | methanol | true | false | true | false | other | general | -Inf | Inf | missing | missing | unknown | https://bitbucket.org/optrove/sif/src/master/METHANOL.SIF | Methanol-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\n | This 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 |
| 310 | 3 | false | 0 | false | true | meyer3 | false | false | false | false | least_squares | unconstrained | -Inf | 1.69361e9 | true | missing | unknown | https://bitbucket.org/optrove/sif/src/master/MEYER3.SIF | Meyer function\n\nclassification SUR2-RN-3-0\n | Problem 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 |
| 311 | 2 | false | 2 | false | true | mgh01feas | true | false | false | false | other | general | -Inf | Inf | missing | missing | unknown | https://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 | |
| 312 | 4 | false | 0 | false | true | mgh09 | false | false | false | false | least_squares | unconstrained | -Inf | 500.0 | true | missing | unknown | https://bitbucket.org/optrove/sif/src/master/MGH09.SIF | https://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\n | Problem 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 |
| 313 | 3 | false | 0 | false | true | mgh10 | false | false | false | false | least_squares | unconstrained | -Inf | 500.0 | true | false | academic | https://bitbucket.org/optrove/sif/src/master/MGH10.SIF | https://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\n | Problem 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 |
| 314 | 5 | false | 0 | false | true | mgh17 | false | false | false | false | least_squares | unconstrained | -Inf | 500.0 | true | missing | unknown | https://bitbucket.org/optrove/sif/src/master/MGH17.SIF | https://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\n | Problem 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 |
| 315 | 144 | true | 256 | true | true | minsurf | false | false | false | false | other | linear | -Inf | Inf | missing | missing | unknown | https://bitbucket.org/optrove/sif/src/master/MINSURF.SIF | Minimal 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\n | This 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 |
| 316 | 2 | false | 0 | false | true | misra1a | false | false | false | false | least_squares | unconstrained | -Inf | 500.0 | true | missing | unknown | https://bitbucket.org/optrove/sif/src/master/MISRA1A.SIF | https://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\n | Problem 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}\n | CUTEst:MISRA1A, NIST:misra1a |
| 317 | 2 | false | 0 | false | true | misra1b | false | false | false | false | least_squares | unconstrained | -Inf | 500.0 | true | missing | unknown | https://bitbucket.org/optrove/sif/src/master/MISRA1B.SIF | https://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\n | Problem 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}\n | CUTEst:MISRA1B, NIST:Misra1b |
| 318 | 2 | false | 0 | false | true | misra1c | false | false | false | false | least_squares | unconstrained | -Inf | 500.0 | true | missing | unknown | https://bitbucket.org/optrove/sif/src/master/MISRA1C.SIF | https://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\n | Problem 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}\n | CUTEst:MISRA1C, NIST:Misra1c |
| 319 | 2 | false | 0 | false | true | misra1d | false | false | false | false | least_squares | unconstrained | -Inf | 500.0 | true | missing | unknown | https://bitbucket.org/optrove/sif/src/master/MISRA1D.SIF | https://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\n | Problem 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}\n | CUTEst:MISRA1D |
| 320 | 100 | true | 0 | false | true | morebv | false | false | false | false | least_squares | unconstrained | -Inf | 0.500942 | true | missing | unknown | https://bitbucket.org/optrove/sif/src/master/MOREBV.SIF | The 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.\n | problem 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 |
| 321 | 2 | false | 0 | false | true | nasty | false | false | false | false | other | unconstrained | -Inf | 0.5 | true | missing | unknown | Nasty problem.\n\nclassification QUR2-AN-2-0\n | a very simple box-constrained quadratic\n | CUTEst:NASTY | ||
| 322 | 100 | true | 0 | false | true | nazareth | false | false | false | false | least_squares | unconstrained | -Inf | Inf | missing | missing | literature | https://www.researchgate.net/publication/325314400_Sparse_Test_Problems_for_Unconstrained_Optimization | Sparse 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 |
| 323 | 100 | true | 0 | false | true | ncb20 | false | false | false | false | other | unconstrained | -Inf | 182.002 | true | missing | unknown | https://bitbucket.org/optrove/sif/src/master/NCB20.SIF | A 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.\n | Ph. 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 |
| 324 | 100 | true | 0 | false | true | ncb20b | false | false | false | false | other | unconstrained | -Inf | 200.0 | true | missing | unknown | https://bitbucket.org/optrove/sif/src/master/NCB20B.SIF | A 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.\n | Ph. 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 |
| 325 | 3 | false | 0 | false | true | nelson | false | false | false | false | least_squares | unconstrained | -Inf | 500.0 | true | false | real | https://bitbucket.org/optrove/sif/src/master/NELSON.SIF | https://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\n | Problem 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}\n | CUTEst:NELSON, NIST:Nelson |
| 326 | 100 | true | 0 | false | true | noncvxu2 | false | false | false | false | other | unconstrained | -Inf | 2.63975e6 | true | missing | unknown | https://bitbucket.org/optrove/sif/src/master/NONCVXU2.SIF | A 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.\n | SIF 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 |
| 327 | 100 | true | 0 | false | true | noncvxun | false | false | false | false | other | unconstrained | -Inf | 2.72701e6 | true | missing | unknown | https://bitbucket.org/optrove/sif/src/master/NONCVXUN.SIF | A 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.\n | SIF 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 |
| 328 | 100 | true | 0 | false | true | nondia | false | false | false | false | other | unconstrained | -Inf | 39604.0 | true | missing | unknown | https://bitbucket.org/optrove/sif/src/master/NONDIA.SIF | The 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)\n | D. 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 |
| 329 | 100 | true | 0 | false | true | nondquar | false | false | false | false | other | unconstrained | -Inf | 106.0 | true | missing | unknown | https://bitbucket.org/optrove/sif/src/master/NONDQUAR.SIF | A 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.\n | problem 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 |
| 330 | 5 | false | 0 | false | true | osborne1 | false | false | false | false | least_squares | unconstrained | -Inf | 7.06876 | true | missing | unknown | https://bitbucket.org/optrove/sif/src/master/OSBORNE1.SIF | Osborne 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\n | Problem 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 |
| 331 | 11 | false | 0 | false | true | osborne2 | false | false | false | false | least_squares | unconstrained | -Inf | 2.09342 | true | missing | unknown | https://bitbucket.org/optrove/sif/src/master/OSBORNE2.SIF | Osborne 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\n | Problem 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 |
| 332 | 8 | false | 0 | false | true | palmer1c | false | false | false | false | least_squares | unconstrained | -Inf | 3.45295e8 | true | missing | unknown | https://bitbucket.org/optrove/sif/src/master/PALMER1C.SIF | A 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\n | M. 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}\n | CUTEst:PALMER1C |
| 333 | 7 | false | 0 | false | true | palmer1d | false | false | false | false | least_squares | unconstrained | -Inf | 2.87266e7 | true | missing | unknown | https://bitbucket.org/optrove/sif/src/master/PALMER1D.SIF | A 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\n | M. 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}\n | CUTEst:PALMER1D |
| 334 | 8 | false | 0 | false | true | palmer2c | false | false | false | false | least_squares | unconstrained | -Inf | 2.6894e7 | true | missing | unknown | https://bitbucket.org/optrove/sif/src/master/PALMER2C.SIF | A 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\n | M. 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}\n | CUTEst:PALMER2C |
| 335 | 8 | false | 0 | false | true | palmer3c | false | false | false | false | least_squares | unconstrained | -Inf | 8.12197e6 | true | missing | unknown | https://bitbucket.org/optrove/sif/src/master/PALMER3C.SIF | A 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\n | M. 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}\n | CUTEst:PALMER3C |
| 336 | 8 | false | 0 | false | true | palmer4c | false | false | false | false | least_squares | unconstrained | -Inf | 8.09445e6 | true | missing | unknown | https://bitbucket.org/optrove/sif/src/master/PALMER4C.SIF | A 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\n | M. 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}\n | CUTEst:PALMER4C |
| 337 | 6 | false | 0 | false | true | palmer5c | false | false | false | false | least_squares | unconstrained | -Inf | 25495.0 | true | missing | unknown | https://bitbucket.org/optrove/sif/src/master/PALMER5C.SIF | A 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\n | M. 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}\n | CUTEst:PALMER5C |
| 338 | 4 | false | 0 | false | true | palmer5d | false | false | false | false | least_squares | unconstrained | -Inf | 22262.6 | true | missing | unknown | https://bitbucket.org/optrove/sif/src/master/PALMER5D.SIF | A 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\n | M. 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}\n | CUTEst:PALMER5D |
| 339 | 8 | false | 0 | false | true | palmer6c | false | false | false | false | least_squares | unconstrained | -Inf | 7.72166e5 | true | missing | unknown | https://bitbucket.org/optrove/sif/src/master/PALMER6C.SIF | A 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\n | M. 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}\n | CUTEst:PALMER6C |
| 340 | 8 | false | 0 | false | true | palmer7c | false | false | false | false | least_squares | unconstrained | -Inf | 3.20513e6 | true | missing | unknown | https://bitbucket.org/optrove/sif/src/master/PALMER7C.SIF | A 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\n | M. 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}\n | CUTEst:PALMER7C |
| 341 | 8 | false | 0 | false | true | palmer8c | false | false | false | false | least_squares | unconstrained | -Inf | 850271.0 | true | missing | unknown | https://bitbucket.org/optrove/sif/src/master/PALMER8C.SIF | A 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\n | M. 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}\n | CUTEst:PALMER8C |
| 342 | 100 | true | 0 | false | true | penalty1 | false | false | false | false | least_squares | unconstrained | -Inf | 1.0 | true | missing | unknown | https://bitbucket.org/optrove/sif/src/master/PENALTY1.SIF | A 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\n | Problem 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 |
| 343 | 100 | true | 0 | false | true | penalty2 | false | false | false | false | other | unconstrained | -Inf | 1.68848e6 | true | missing | unknown | https://bitbucket.org/optrove/sif/src/master/PENALTY2.SIF | The 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.\n | Problem 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 |
| 344 | 100 | true | 0 | false | true | penalty3 | false | false | false | false | other | unconstrained | -Inf | 1.00639e8 | true | missing | unknown | https://bitbucket.org/optrove/sif/src/master/PENALTY3.SIF | A 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.\n | problem 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 |
| 345 | 5005 | true | 5000 | true | true | pinene | true | false | true | false | other | general | -Inf | Inf | missing | missing | unknown | https://bitbucket.org/optrove/sif/src/master/PINENE.SIF | Isomerization 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\n | This 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 |
| 346 | 100 | true | 50 | true | true | polygon | false | false | true | false | other | linear | -Inf | Inf | false | missing | unknown | https://bitbucket.org/optrove/sif/src/master/POLYGON.SIF | Find 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\n | This 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 |
| 347 | 100 | true | 50 | true | true | polygon1 | false | false | true | false | other | linear | -Inf | Inf | false | missing | unknown | https://doi.org/10.2172/834714 | Find 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 | |
| 348 | 100 | true | 1 | false | true | polygon2 | true | false | true | false | other | linear | -Inf | Inf | false | missing | unknown | https://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\n | JuMP 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 | |
| 349 | 100 | true | 100 | true | true | polygon3 | false | true | false | false | other | general | -Inf | -0.0 | true | missing | unknown | https://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\n | JuMP 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 | |
| 350 | 2 | false | 0 | false | true | powellbs | false | false | false | false | other | unconstrained | -Inf | 0.567631 | true | missing | unknown | https://bitbucket.org/optrove/sif/src/master/POWELLBS.SIF | Powell 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\n | Problem 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 |
| 351 | 100 | true | 0 | false | true | powellsg | false | false | false | false | least_squares | unconstrained | -Inf | 5375.0 | true | missing | unknown | https://bitbucket.org/optrove/sif/src/master/POWELLSG.SIF | The 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.\n | Problem 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 |
| 352 | 100 | true | 0 | false | true | power | false | false | false | false | least_squares | unconstrained | -Inf | 2.55025e7 | true | missing | unknown | https://bitbucket.org/optrove/sif/src/master/POWER.SIF | The Power problem by Oren.\n\nclassification OUR2-AN-V-0\n | S.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}\n | CUTEst:POWER |
| 353 | 100 | true | 0 | false | true | quartc | false | false | false | false | other | unconstrained | -Inf | 1.85427e9 | true | missing | unknown | https://bitbucket.org/optrove/sif/src/master/QUARTC.SIF | A simple quartic function.\n\nclassification OUR2-AN-V-0\n | problem 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 |
| 354 | 3 | false | 0 | false | true | rat42 | false | false | false | false | least_squares | unconstrained | -Inf | 500.0 | true | missing | unknown | https://bitbucket.org/optrove/sif/src/master/RAT42.SIF | https://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\n | Problem 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}\n | CUTEst:RAT42, NIST:Rat42 |
| 355 | 4 | false | 0 | false | true | rat43 | false | false | false | false | least_squares | unconstrained | -Inf | 500.0 | true | missing | unknown | https://bitbucket.org/optrove/sif/src/master/RAT43.SIF | https://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\n | Problem 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}\n | CUTEst:RAT43, NIST:Rat43 |
| 356 | 109 | true | 102 | true | true | robotarm | false | false | true | true | other | general | -Inf | Inf | missing | missing | unknown | https://bitbucket.org/optrove/sif/src/master/ROBOTARM.SIF | Minimize the time taken for a robot arm to travel between two points.\n\nclassification OOR2-AN-V-V\n | This 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 |
| 357 | 405 | true | 304 | true | false | rocket | true | false | true | false | other | general | -Inf | Inf | missing | missing | unknown | https://bitbucket.org/optrove/sif/src/master/ROCKET.SIF | Goddard 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\n | This 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 |
| 358 | 2 | false | 0 | false | true | rosenbrock | false | false | false | false | least_squares | unconstrained | -Inf | 32.3086 | true | missing | unknown | https://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 | |
| 359 | 4 | false | 0 | false | true | rozman1 | false | false | false | false | least_squares | unconstrained | -Inf | 500.0 | true | missing | unknown | https://www.itl.nist.gov/div898/strd/nls/data/LINKS/DATA/rozman1.dat | https://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}\n | NIST:Roszman1 |
| 360 | 100 | true | 0 | false | true | sbrybnd | false | false | false | false | least_squares | unconstrained | -Inf | 1568.0 | true | missing | unknown | https://bitbucket.org/optrove/sif/src/master/SBRYBND.SIF | Broyden 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.\n | problem 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 |
| 361 | 100 | true | 0 | false | true | schmvett | false | false | false | false | other | unconstrained | -Inf | -189.068 | true | missing | unknown | https://bitbucket.org/optrove/sif/src/master/SCHMVETT.SIF | The 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.\n | J.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 |
| 362 | 100 | true | 0 | false | true | scosine | false | false | false | false | other | unconstrained | -Inf | 86.8807 | true | missing | unknown | https://bitbucket.org/optrove/sif/src/master/SCOSINE.SIF | Another 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)\n | N. 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 |
| 363 | 100 | true | 0 | false | true | sinquad | false | false | false | false | other | unconstrained | -Inf | 0.6561 | true | missing | unknown | https://bitbucket.org/optrove/sif/src/master/SINQUAD.SIF | Another 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.\n | N. 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 |
| 364 | 100 | true | 0 | false | true | sparsine | false | false | false | false | other | unconstrained | -Inf | 20893.3 | true | missing | unknown | https://bitbucket.org/optrove/sif/src/master/SPARSINE.SIF | A 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.\n | SIF 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 |
| 365 | 100 | true | 0 | false | true | sparsqur | false | false | false | false | other | unconstrained | -Inf | 1420.31 | true | missing | unknown | https://bitbucket.org/optrove/sif/src/master/SPARSQUR.SIF | A 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.\n | SIF 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 |
| 366 | 100 | true | 0 | false | true | spmsrtls | false | false | false | false | least_squares | unconstrained | -Inf | 49.3239 | true | missing | unknown | https://bitbucket.org/optrove/sif/src/master/SPMSRTLS.SIF | Liu and Nocedal tridiagonal matrix square root problem.\n\nclassification SUR2-AN-V-V\n | problem 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 |
| 367 | 100 | true | 0 | false | true | srosenbr | false | false | false | false | other | unconstrained | -Inf | 1210.0 | true | missing | unknown | https://bitbucket.org/optrove/sif/src/master/SROSENBR.SIF | The 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 |
| 368 | 506 | true | 408 | true | true | steering | false | false | true | false | other | general | -Inf | Inf | missing | missing | unknown | https://bitbucket.org/optrove/sif/src/master/STEERING.SIF | Rocket 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\n | This 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 |
| 369 | 600 | true | 44 | true | true | structural | false | false | true | false | other | linear | -Inf | Inf | missing | missing | unknown | https://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 | |
| 370 | 15 | false | 4 | false | true | tetra | false | true | true | true | other | general | -Inf | Inf | missing | missing | unknown | https://doi.org/10.2172/834714 | Minimize 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.\n | This 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 |
| 371 | 12597 | false | 19222 | false | true | tetra_duct12 | false | true | true | true | other | general | -Inf | 23246.1 | true | missing | unknown | https://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 |
| 372 | 6417 | false | 9000 | false | true | tetra_duct15 | false | true | true | true | other | general | -Inf | 10890.9 | true | missing | unknown | https://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 |
| 373 | 3201 | false | 4104 | false | true | tetra_duct20 | false | true | true | true | other | general | -Inf | 4959.8 | true | missing | unknown | https://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 |
| 374 | 4011 | false | 4847 | false | true | tetra_foam5 | false | true | true | true | other | general | -Inf | 6497.1 | true | missing | unknown | https://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 |
| 375 | 2598 | false | 3116 | false | true | tetra_gear | false | true | true | true | other | general | -Inf | 4256.38 | true | missing | unknown | https://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 |
| 376 | 3570 | false | 4675 | false | true | tetra_hook | false | true | true | true | other | general | -Inf | 6157.14 | true | missing | unknown | https://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 |
| 377 | 30 | false | 0 | false | true | threepk | false | false | true | false | other | unconstrained | -Inf | 20236.5 | true | missing | unknown | https://bitbucket.org/optrove/sif/src/master/3PK.SIF | A problem arising in the estimation of structured O/D matrix\n | Converted 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}\n | CUTEst:3PK |
| 378 | 7 | false | 0 | false | true | thurber | false | false | false | false | least_squares | unconstrained | -Inf | 500.0 | true | missing | unknown | https://bitbucket.org/optrove/sif/src/master/THURBER.SIF | https://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\n | Problem 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}\n | CUTEst:THURBER, NIST:Thurber |
| 379 | 100 | true | 0 | false | true | toint | false | false | false | false | other | unconstrained | -Inf | -0.85984 | true | missing | unknown | https://www.researchgate.net/publication/325314400_Sparse_Test_Problems_for_Unconstrained_Optimization | Toint trigonometric function\n | Problem 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 |
| 380 | 100 | true | 0 | false | true | tointgss | false | false | false | false | other | unconstrained | -Inf | 891.608 | true | missing | unknown | https://bitbucket.org/optrove/sif/src/master/TOINTGSS.SIF | Toint'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.\n | problem 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 |
| 381 | 144 | true | 144 | true | true | torsion | false | false | false | false | other | linear | -Inf | -0.330579 | true | missing | unknown | https://doi.org/10.2172/834714 | Torsion problem\n | Liz 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 |
| 382 | 100 | true | 0 | false | true | tquartic | false | false | false | false | least_squares | unconstrained | -Inf | 0.81 | true | missing | unknown | https://bitbucket.org/optrove/sif/src/master/TQUARTIC.SIF | A 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.\n | Ph. 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 |
| 383 | 8 | false | 3 | false | true | triangle | false | true | true | true | other | general | -Inf | 11.328 | true | missing | unknown | https://doi.org/10.2172/834714 | Minimize the time taken for a robot arm to travel between two points.\n | This 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 |
| 384 | 2244 | false | 1896 | false | true | triangle_deer | false | true | true | true | other | general | -Inf | 2014.34 | true | missing | unknown | https://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 |
| 385 | 1366 | false | 1182 | false | true | triangle_pacman | false | true | true | true | other | general | -Inf | 1316.28 | true | missing | unknown | https://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 |
| 386 | 4444 | false | 4025 | false | true | triangle_turtle | false | true | true | true | other | general | -Inf | 4467.58 | true | missing | unknown | https://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 |
| 387 | 100 | true | 0 | false | true | tridia | false | false | false | false | other | unconstrained | -Inf | 5049.0 | true | missing | unknown | https://bitbucket.org/optrove/sif/src/master/TRIDIA.SIF | Shanno'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\n | Problem 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 |
| 388 | 100 | true | 0 | false | true | trig | false | false | false | false | other | unconstrained | -Inf | 61.4825 | true | missing | unknown | https://www.researchgate.net/publication/325314400_Sparse_Test_Problems_for_Unconstrained_Optimization | Another trigonometric function\n | Problem 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 |
| 389 | 100 | true | 0 | false | true | trigb | false | false | false | false | other | unconstrained | -Inf | 2404.78 | true | missing | unknown | https://www.researchgate.net/publication/325314400_Sparse_Test_Problems_for_Unconstrained_Optimization | Banded trigonometric problem\n | Problem 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 |
| 390 | 100 | true | 0 | false | true | vardim | false | false | false | false | other | unconstrained | -Inf | 1.31058e14 | true | missing | unknown | https://bitbucket.org/optrove/sif/src/master/VARDIM.SIF | Variable 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\n | Problem 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}\n | CUTEst:VARDIM |
| 391 | 100 | true | 0 | false | true | variational | false | false | false | false | other | unconstrained | -Inf | Inf | true | false | academic | https://www.researchgate.net/publication/325314400_Sparse_Test_Problems_for_Unconstrained_Optimization | Discretization 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 |
| 392 | 8 | false | 0 | false | true | vibrbeam | false | false | false | false | least_squares | unconstrained | -Inf | 8231.28 | true | missing | unknown | https://bitbucket.org/optrove/sif/src/master/VIBRBEAM.SIF | A 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\n | A 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}\n | CUTEst:VIBRBEAM |
| 393 | 31 | false | 0 | false | true | watson | false | false | false | false | least_squares | unconstrained | -Inf | 500.0 | true | missing | unknown | https://bitbucket.org/optrove/sif/src/master/WATSON.SIF | Watson problem in varaible dimension ( 2 <= n <= 31 ).\n This function is a nonlinear least squares with 31 groups.\n\nclassification SUR2-AN-V-0\n | problem 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 |
| 394 | 100 | true | 0 | false | true | woods | false | false | false | false | other | unconstrained | -Inf | 180451.0 | true | missing | unknown | https://bitbucket.org/optrove/sif/src/master/WOODS.SIF | The 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.\n | problem 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} \n | CUTEst:WOODS, Luksan:58 |
| 395 | 3 | false | 3 | false | true | zangwil3 | true | false | false | false | other | linear | -Inf | Inf | missing | missing | unknown | https://bitbucket.org/optrove/sif/src/master/ZANGWIL3.SIF | Zangwill's problem in 3 variables.\n\nclassification NLR2-AN-3-3\n\n A. Cebola, Paraná 10/2016.\n | problem 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}\n | CUTEst: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]]| 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 |
| 9 | 100 | bearing |
| 10 | 100 | boundary |
| 11 | 100 | brownal |
| 12 | 100 | browngen1 |
| 13 | 100 | browngen2 |
| 14 | 100 | broyden3d |
| 15 | 100 | broyden7d |
| 16 | 100 | broydn7d |
| 17 | 100 | brybnd |
| 18 | 100 | chainwoo |
| 19 | 100 | chnrosnb_mod |
| 20 | 100 | clplatea |
| 21 | 100 | clplateb |
| 22 | 100 | clplatec |
| 23 | 100 | cosine |
| 24 | 100 | cragglvy |
| 25 | 100 | cragglvy2 |
| 26 | 100 | curly |
| 27 | 100 | curly10 |
| 28 | 100 | curly20 |
| 29 | 100 | curly30 |
| 30 | 99 | dixmaane |
| 31 | 99 | dixmaanf |
| 32 | 99 | dixmaang |
| 33 | 99 | dixmaanh |
| 34 | 99 | dixmaani |
| 35 | 99 | dixmaanj |
| 36 | 99 | dixmaank |
| 37 | 99 | dixmaanl |
| 38 | 99 | dixmaanm |
| 39 | 99 | dixmaann |
| 40 | 99 | dixmaano |
| 41 | 99 | dixmaanp |
| 42 | 100 | dixon3dq |
| 43 | 100 | dqdrtic |
| 44 | 100 | dqrtic |
| 45 | 100 | edensch |
| 46 | 100 | eg2 |
| 47 | 100 | engval1 |
| 48 | 100 | errinros_mod |
| 49 | 100 | extrosnb |
| 50 | 100 | fletcbv2 |
| 51 | 100 | fletcbv3_mod |
| 52 | 100 | fletchcr |
| 53 | 100 | freuroth |
| 54 | 100 | genbroydenb |
| 55 | 100 | genbroydentri |
| 56 | 100 | genhumps |
| 57 | 100 | genrose |
| 58 | 100 | genrose_nash |
| 59 | 100 | indef_mod |
| 60 | 100 | integreq |
| 61 | 100 | liarwhd |
| 62 | 100 | morebv |
| 63 | 100 | nazareth |
| 64 | 100 | ncb20 |
| 65 | 100 | ncb20b |
| 66 | 100 | noncvxu2 |
| 67 | 100 | noncvxun |
| 68 | 100 | nondia |
| 69 | 100 | nondquar |
| 70 | 100 | penalty1 |
| 71 | 100 | penalty2 |
| 72 | 100 | penalty3 |
| 73 | 100 | powellsg |
| 74 | 100 | power |
| 75 | 100 | quartc |
| 76 | 100 | sbrybnd |
| 77 | 100 | schmvett |
| 78 | 100 | scosine |
| 79 | 100 | sinquad |
| 80 | 100 | sparsine |
| 81 | 100 | sparsqur |
| 82 | 100 | spmsrtls |
| 83 | 100 | srosenbr |
| 84 | 100 | toint |
| 85 | 100 | tointgss |
| 86 | 100 | tquartic |
| 87 | 100 | tridia |
| 88 | 100 | trig |
| 89 | 100 | trigb |
| 90 | 100 | vardim |
| 91 | 100 | variational |
| 92 | 100 | woods |
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()24To 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):
| Key | Description |
|---|---|
AMPGO | Gavana's Global Optimization benchmark suite |
COPS | COPS 3.0 collection (Dolan & Moré, 2004) |
CUTEst | CUTEst testing environment (Gould et al., 2015) |
HS | Hock & Schittkowski (1981), Vol. 187 |
HS2 | Schittkowski (1987), Vol. 282 |
Luksan | Luksan, Matonoha & Vlček (2003) — Modified CUTE problems |
LuksanSparse | Luksan, Matonoha & Vlček (2010) — Sparse test problems |
MGH | Moré, Garbow & Hillstrom (1981) |
NIST | NIST/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]]| Row | name | lib |
|---|---|---|
| String | String | |
| 1 | bearing | COPS:16 |
| 2 | camshape | CUTEst:CAMSHAPE, COPS:3 |
| 3 | catmix | CUTEst:CATMIX, COPS:14 |
| 4 | chain | CUTEst:CHAIN, COPS:4 |
| 5 | channel | CUTEst:CHANNEL, COPS:7 |
| 6 | elec | CUTEst:ELEC, COPS:2 |
| 7 | gasoil | CUTEst:GASOIL, COPS:12 |
| 8 | glider | CUTEst:GLIDER, COPS:11 |
| 9 | marine | CUTEst:MARINE, COPS:6 |
| 10 | methanol | CUTEst:METHANOL, COPS:13 |
| 11 | minsurf | CUTEst:MINSURF, COPS:17 |
| 12 | pinene | CUTEst:PINENE, COPS:5 |
| 13 | polygon | CUTEst:POLYGON, COPS:1 |
| 14 | robotarm | CUTEst:ROBOTARM, COPS:8 |
| 15 | rocket | CUTEst:ROCKET, COPS:10 |
| 16 | steering | CUTEst:STEERING, COPS:9 |
| 17 | tetra | COPS:19 |
| 18 | tetra_duct12 | COPS:19 |
| 19 | tetra_duct15 | COPS:19 |
| 20 | tetra_duct20 | COPS:19 |
| 21 | tetra_foam5 | COPS:19 |
| 22 | tetra_gear | COPS:19 |
| 23 | tetra_hook | COPS:19 |
| 24 | torsion | COPS:15 |
| 25 | triangle | COPS:18 |
| 26 | triangle_deer | COPS:18 |
| 27 | triangle_pacman | COPS:18 |
| 28 | triangle_turtle | COPS:18 |
cutest_problems = meta[contains.(meta.lib, "CUTEst"), [:name, :lib]]| Row | name | lib |
|---|---|---|
| String | String | |
| 1 | BOX2 | CUTEst:BOX2 |
| 2 | BOX3 | CUTEst:BOX3 |
| 3 | aircrfta | CUTEst:AIRCRFTA |
| 4 | allinit | CUTEst:ALLINIT |
| 5 | allinitc | CUTEst:ALLINITC |
| 6 | allinitu | CUTEst:ALLINITU |
| 7 | alsotame | CUTEst:ALSOTAME |
| 8 | argauss | CUTEst:ARGAUSS |
| 9 | arglina | CUTEst:ARGLINA |
| 10 | arglinb | CUTEst:ARGLINB |
| 11 | arglinc | CUTEst:ARGLINC |
| 12 | argtrig | CUTEst:ARGTRIG |
| 13 | arwhead | CUTEst:ARWHEAD, Luksan:1 |
| 14 | avion2 | CUTEst:AVION2 |
| 15 | bard | CUTEst:BARD |
| 16 | bdqrtic | CUTEst:BDQRTIC, Luksan:2 |
| 17 | beale | CUTEst:BEALE |
| 18 | bennett5 | CUTEst:BENNETT5, NIST:Bennett5 |
| 19 | biggs5 | CUTEst:BIGGS5 |
| 20 | biggs6 | CUTEst:BIGGS6 |
| 21 | booth | CUTEst:BOOTH |
| 22 | boxbod | CUTEst:BOXBOD, NIST:BoxBOD |
| 23 | bqp1var | CUTEst:BQP1VAR |
| 24 | britgas | CUTEst:BRITGAS |
| 25 | brownal | CUTEst:BROWNAL |
| 26 | brownbs | CUTEst:BROWNBS |
| 27 | brownden | CUTEst:BROWNDEN |
| 28 | broydn7d | CUTEst:BROYDN7D, Luksan:3 |
| 29 | brybnd | CUTEst:BRYBND, Luksan:4 |
| 30 | bt1 | CUTEst:BT1 |
| 31 | camshape | CUTEst:CAMSHAPE, COPS:3 |
| 32 | catenary | CUTEst:CATENARY |
| 33 | catmix | CUTEst:CATMIX, COPS:14 |
| 34 | chain | CUTEst:CHAIN, COPS:4 |
| 35 | chainwoo | CUTEst:CHAINWOO, Luksan:5, LuksanSparse:2 |
| 36 | channel | CUTEst:CHANNEL, COPS:7 |
| 37 | chwirut1 | CUTEst:CHWIRUT1, NIST:Chwirut1 |
| 38 | chwirut2 | CUTEst:CHWIRUT2, NIST:Chwirut2 |
| 39 | cliff | CUTEst:CLIFF |
| 40 | clnlbeam | CUTEst:CLNLBEAM |
| 41 | clplatea | CUTEst:CLPLATEA |
| 42 | clplateb | CUTEst:CLPLATEB |
| 43 | clplatec | CUTEst:CLPLATEC |
| 44 | cosine | CUTEst:COSINE, Luksan:6 |
| 45 | cragglvy | CUTEst:CRAGGLVY, Luksan:7 |
| 46 | curly10 | CUTEst:CURLY10 |
| 47 | curly20 | CUTEst:CURLY20 |
| 48 | curly30 | CUTEst:CURLY30 |
| 49 | danwood | CUTEst:DANWOOD, NIST:DanWood |
| 50 | dixmaanf | CUTEst:DIXMAANF,Luksan:12 |
| 51 | dixmaang | CUTEst:DIXMAANG,Luksan:13 |
| 52 | dixmaanh | CUTEst:DIXMAANH,Luksan:14 |
| 53 | dixmaanj | CUTEst:DIXMAANJ,Luksan:16 |
| 54 | dixmaank | CUTEst:DIXMAANK,Luksan:17 |
| 55 | dixmaanl | CUTEst:DIXMAANL,Luksan:18 |
| 56 | dixmaann | CUTEst:DIXMAANN,Luksan:20 |
| 57 | dixmaano | CUTEst:DIXMAANO,Luksan:21 |
| 58 | dixmaanp | CUTEst:DIXMAANP,Luksan:22 |
| 59 | dixon3dq | CUTEst:DIXON3DQ |
| 60 | dqdrtic | CUTEst:DQDRTIC |
| 61 | dqrtic | CUTEst:DQRTIC, Luksan:23 |
| 62 | eckerle4 | CUTEst:ECKERLE4, NIST:Eckerle4 |
| 63 | edensch | CUTEst:EDENSCH, Luksan:24 |
| 64 | eg2 | CUTEst:EG2, Luksan:25 |
| 65 | elec | CUTEst:ELEC, COPS:2 |
| 66 | engval1 | CUTEst:ENGVAL1, Luksan:26 |
| 67 | enso | CUTEst:ENSO, NIST:ENSO |
| 68 | extrosnb | CUTEst:EXTROSNB, Luksan:29 |
| 69 | fletcbv2 | CUTEst:FLETCBV2, Luksan:31 |
| 70 | fletchcr | CUTEst:FLETCHCR, Luksan:32 |
| 71 | fminsrf2 | CUTEst:FMINSRF2, Luksan:33 |
| 72 | freuroth | CUTEst:FREUROTH, Luksan:34 |
| 73 | gasoil | CUTEst:GASOIL, COPS:12 |
| 74 | gauss1 | CUTEst:GAUSS1, NIST:Gauss1 |
| 75 | gauss2 | CUTEst:GAUSS2, NIST:Gauss2 |
| 76 | gauss3 | CUTEst:GAUSS3, NIST:Gauss3 |
| 77 | gaussian | CUTEst:GAUSSIAN |
| 78 | genhumps | CUTEst:GENHUMPS, Luksan:35 |
| 79 | genrose | CUTEst:GENROSE, Luksan:36 |
| 80 | glider | CUTEst:GLIDER, COPS:11 |
| 81 | gulf | CUTEst:GULF |
| 82 | hahn1 | CUTEst:HAHN1, NIST:Hahn1 |
| 83 | hs1 | CUTEst:HS1, HS:1 |
| 84 | hs10 | CUTEst:HS10, HS:10 |
| 85 | hs100 | CUTEst:HS100, HS:100 |
| 86 | hs101 | CUTEst:HS101, HS:101 |
| 87 | hs102 | CUTEst:HS102, HS:102 |
| 88 | hs103 | CUTEst:HS103, HS:103 |
| 89 | hs104 | CUTEst:HS104, HS:104 |
| 90 | hs105 | CUTEst:HS105, HS:105 |
| 91 | hs106 | CUTEst:HS106, HS:106 |
| 92 | hs107 | CUTEst:HS107, HS:107 |
| 93 | hs108 | CUTEst:HS108, HS:108 |
| 94 | hs109 | CUTEst:HS109, HS:109 |
| 95 | hs11 | CUTEst:HS11, HS:11 |
| 96 | hs110 | CUTEst:HS110, HS:110 |
| 97 | hs111 | CUTEst:HS111, HS:111 |
| 98 | hs112 | CUTEst:HS112, HS:112 |
| 99 | hs113 | CUTEst:HS113, HS:113 |
| 100 | hs114 | CUTEst:HS114, HS:114 |
| 101 | hs116 | CUTEst:HS116, HS:116 |
| 102 | hs117 | CUTEst:HS117, HS:117 |
| 103 | hs118 | CUTEst:HS118, HS:118 |
| 104 | hs119 | CUTEst:HS119, HS:119 |
| 105 | hs12 | CUTEst:HS12, HS:12 |
| 106 | hs13 | CUTEst:HS13, HS:13 |
| 107 | hs14 | CUTEst:HS14, HS:14 |
| 108 | hs15 | CUTEst:HS15, HS:15 |
| 109 | hs16 | CUTEst:HS16, HS:16 |
| 110 | hs17 | CUTEst:HS17, HS:17 |
| 111 | hs18 | CUTEst:HS18, HS:18 |
| 112 | hs19 | CUTEst:HS19, HS:19 |
| 113 | hs2 | CUTEst:HS2, HS:2 |
| 114 | hs20 | CUTEst:HS20, HS:20 |
| 115 | hs21 | CUTEst:HS21, HS:21 |
| 116 | hs22 | CUTEst:HS22, HS:22 |
| 117 | hs23 | CUTEst:HS23, HS:23 |
| 118 | hs24 | CUTEst:HS24, HS:24 |
| 119 | hs25 | CUTEst:HS25, HS:25 |
| 120 | hs26 | CUTEst:HS26, HS:26 |
| 121 | hs27 | CUTEst:HS27, HS:27 |
| 122 | hs28 | CUTEst:HS28, HS:28 |
| 123 | hs29 | CUTEst:HS29, HS:29 |
| 124 | hs3 | CUTEst:HS3, HS:3 |
| 125 | hs30 | CUTEst:HS30, HS:30 |
| 126 | hs31 | CUTEst:HS31, HS:31 |
| 127 | hs32 | CUTEst:HS32, HS:32 |
| 128 | hs33 | CUTEst:HS33, HS:33 |
| 129 | hs34 | CUTEst:HS34, HS:34 |
| 130 | hs35 | CUTEst:HS35, HS:35 |
| 131 | hs36 | CUTEst:HS36, HS:36 |
| 132 | hs37 | CUTEst:HS37, HS:37 |
| 133 | hs38 | CUTEst:HS38, HS:38 |
| 134 | hs39 | CUTEst:HS39, HS:39 |
| 135 | hs4 | CUTEst:HS4, HS:4 |
| 136 | hs40 | CUTEst:HS40, HS:40 |
| 137 | hs41 | CUTEst:HS41, HS:41 |
| 138 | hs42 | CUTEst:HS42, HS:42 |
| 139 | hs43 | CUTEst:HS43, HS:43 |
| 140 | hs44 | CUTEst:HS44, HS:44 |
| 141 | hs45 | CUTEst:HS45, HS:45 |
| 142 | hs46 | CUTEst:HS46, HS:46 |
| 143 | hs47 | CUTEst:HS47, HS:47 |
| 144 | hs48 | CUTEst:HS48, HS:48 |
| 145 | hs49 | CUTEst:HS49, HS:49 |
| 146 | hs5 | CUTEst:HS5, HS:5 |
| 147 | hs50 | CUTEst:HS50, HS:50 |
| 148 | hs51 | CUTEst:HS51, HS:51 |
| 149 | hs52 | CUTEst:HS52, HS:52 |
| 150 | hs53 | CUTEst:HS53, HS:53 |
| 151 | hs54 | CUTEst:HS54, HS:54 |
| 152 | hs55 | CUTEst:HS55, HS:55 |
| 153 | hs56 | CUTEst:HS56, HS:56 |
| 154 | hs57 | CUTEst:HS57, HS:57 |
| 155 | hs59 | CUTEst:HS59, HS:59 |
| 156 | hs6 | CUTEst:HS6, HS:6 |
| 157 | hs60 | CUTEst:HS60, HS:60 |
| 158 | hs61 | CUTEst:HS61, HS:61 |
| 159 | hs62 | CUTEst:HS62, HS:62 |
| 160 | hs63 | CUTEst:HS63, HS:63 |
| 161 | hs64 | CUTEst:HS64, HS:64 |
| 162 | hs65 | CUTEst:HS65, HS:65 |
| 163 | hs66 | CUTEst:HS66, HS:66 |
| 164 | hs68 | CUTEst:HS68, HS:68 |
| 165 | hs69 | CUTEst:HS69, HS:69 |
| 166 | hs7 | CUTEst:HS7, HS:7 |
| 167 | hs70 | CUTEst:HS70, HS:70 |
| 168 | hs71 | CUTEst:HS71, HS:71 |
| 169 | hs72 | CUTEst:HS72, HS:72 |
| 170 | hs73 | CUTEst:HS73, HS:73 |
| 171 | hs74 | CUTEst:HS74, HS:74 |
| 172 | hs75 | CUTEst:HS75, HS:75 |
| 173 | hs76 | CUTEst:HS76, HS:76 |
| 174 | hs77 | CUTEst:HS77, HS:77 |
| 175 | hs78 | CUTEst:HS78, HS:78 |
| 176 | hs79 | CUTEst:HS79, HS:79 |
| 177 | hs8 | CUTEst:HS8, HS:8 |
| 178 | hs80 | CUTEst:HS80, HS:80 |
| 179 | hs81 | CUTEst:HS81, HS:81 |
| 180 | hs83 | CUTEst:HS83, HS:83 |
| 181 | hs84 | CUTEst:HS84, HS:84 |
| 182 | hs86 | CUTEst:HS86, HS:86 |
| 183 | hs87 | CUTEst:HS87, HS:87 |
| 184 | hs9 | CUTEst:HS9, HS:9 |
| 185 | hs93 | CUTEst:HS93, HS:93 |
| 186 | hs95 | CUTEst:HS95, HS:95 |
| 187 | hs96 | CUTEst:HS96, HS:96 |
| 188 | hs97 | CUTEst:HS97, HS:97 |
| 189 | hs98 | CUTEst:HS98, HS:98 |
| 190 | hs99 | CUTEst:HS99, HS:99 |
| 191 | integreq | CUTEst:INTEGREQ |
| 192 | kirby2 | CUTEst:KIRBY2, NIST:Kirby2 |
| 193 | kowosb | CUTEst:KOWOSB |
| 194 | lanczos1 | CUTEst:LANCZOS1, NIST:lanczos1 |
| 195 | lanczos2 | CUTEst:LANCZOS2, NIST:Lanczos2 |
| 196 | lanczos3 | CUTEst:LANCZOS3, NIST:Lanczos3 |
| 197 | liarwhd | CUTEst:LIARWHD, Luksan:38 |
| 198 | marine | CUTEst:MARINE, COPS:6 |
| 199 | methanol | CUTEst:METHANOL, COPS:13 |
| 200 | meyer3 | CUTEst:MEYER3 |
| 201 | mgh09 | CUTEst:MGH09, MGH:9, NIST:MGH09 |
| 202 | mgh10 | CUTEst:MGH10, MGH:10, NIST:MGH10 |
| 203 | mgh17 | CUTEst:MGH17, MGH:17, NIST:MGH17 |
| 204 | minsurf | CUTEst:MINSURF, COPS:17 |
| 205 | misra1a | CUTEst:MISRA1A, NIST:misra1a |
| 206 | misra1b | CUTEst:MISRA1B, NIST:Misra1b |
| 207 | misra1c | CUTEst:MISRA1C, NIST:Misra1c |
| 208 | misra1d | CUTEst:MISRA1D |
| 209 | morebv | CUTEst:MOREBV, Luksan:39 |
| 210 | nasty | CUTEst:NASTY |
| 211 | ncb20 | CUTEst:NCB20, Luksan:40 |
| 212 | ncb20b | CUTEst:NCB20B, Luksan:41 |
| 213 | nelson | CUTEst:NELSON, NIST:Nelson |
| 214 | noncvxu2 | CUTEst:NONCVXU2, Luksan:43 |
| 215 | noncvxun | CUTEst:NONCVXUN, Luksan:42 |
| 216 | nondia | CUTEst:NONDIA, Luksan:44 |
| 217 | nondquar | CUTEst:NONDQUAR, Luksan:45 |
| 218 | osborne1 | CUTEst:OSBORNE1 |
| 219 | osborne2 | CUTEst:OSBORNE2 |
| 220 | palmer1c | CUTEst:PALMER1C |
| 221 | palmer1d | CUTEst:PALMER1D |
| 222 | palmer2c | CUTEst:PALMER2C |
| 223 | palmer3c | CUTEst:PALMER3C |
| 224 | palmer4c | CUTEst:PALMER4C |
| 225 | palmer5c | CUTEst:PALMER5C |
| 226 | palmer5d | CUTEst:PALMER5D |
| 227 | palmer6c | CUTEst:PALMER6C |
| 228 | palmer7c | CUTEst:PALMER7C |
| 229 | palmer8c | CUTEst:PALMER8C |
| 230 | penalty1 | CUTEst:PENALTY1 |
| 231 | penalty2 | CUTEst:PENALTY2 |
| 232 | penalty3 | CUTEst:PENALTY3, Luksan:46 |
| 233 | pinene | CUTEst:PINENE, COPS:5 |
| 234 | polygon | CUTEst:POLYGON, COPS:1 |
| 235 | powellbs | CUTEst:POWELLBS |
| 236 | powellsg | CUTEst:POWELLSG, Luksan:47, LuksanSparse:3 |
| 237 | power | CUTEst:POWER |
| 238 | quartc | CUTEst:QUARTC |
| 239 | rat42 | CUTEst:RAT42, NIST:Rat42 |
| 240 | rat43 | CUTEst:RAT43, NIST:Rat43 |
| 241 | robotarm | CUTEst:ROBOTARM, COPS:8 |
| 242 | rocket | CUTEst:ROCKET, COPS:10 |
| 243 | sbrybnd | CUTEst:SBRYBND, Luksan:48 |
| 244 | schmvett | CUTEst:SCHMVETT, Luksan:49 |
| 245 | scosine | CUTEst:SCOSINE, Luksan:50 |
| 246 | sinquad | CUTEst:SINQUAD, Luksan:51 |
| 247 | sparsine | CUTEst:SPARSINE, Luksan:52 |
| 248 | sparsqur | CUTEst:SPARSQUR, Luksan:53 |
| 249 | spmsrtls | CUTEst:SPMSRTLS, Luksan:54 |
| 250 | srosenbr | CUTEst:SROSENBR, Luksan:55 |
| 251 | steering | CUTEst:STEERING, COPS:9 |
| 252 | threepk | CUTEst:3PK |
| 253 | thurber | CUTEst:THURBER, NIST:Thurber |
| 254 | tointgss | CUTEst:TOINTGSS, Luksan:56 |
| 255 | tquartic | CUTEst:TQUARTIC, Luksan:57 |
| 256 | tridia | CUTEst:TRIDIA |
| 257 | vardim | CUTEst:VARDIM |
| 258 | vibrbeam | CUTEst:VIBRBEAM |
| 259 | watson | CUTEst:WATSON |
| 260 | woods | CUTEst:WOODS, Luksan:58 |
| 261 | zangwil3 | CUTEst: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.