up some refs

Author: tmigot

src/Meta/arwhead.jl

@@ -21,18 +21,15 @@ arwhead_meta = Dict(
 Arrow head problem.
 A quartic problem whose Hessian is an arrow-head (downwards) with
 diagonal central part and border-width of 1.
-
-classification OUR2-AN-V-0
-
-D. Orban, Montreal, 08/2015.
 """,
   :origin_notes => raw"""
-Source:
 Problem 55 in
 A.R. Conn, N.I.M. Gould, M. Lescrenier and Ph.L. Toint,
 Performance of a multifrontal scheme for partially separable
 optimization,
 Report 88/4, Dept of Mathematics, FUNDP (Namur, B), 1988.
+SIF input: Ph. Toint, Dec 1989.
+classification OUR2-AN-V-0
 
 See also
 
@@ -42,26 +39,17 @@ Modified CUTE problems for sparse unconstrained optimization,
 Technical Report 1081,
 Institute of Computer Science,
 Academy of Science of the Czech Republic
----
-Problem :
-A quartic problem whose Hessian is an arrow-head (downwards) with
-diagonal central part and border-width of 1.
-Source: Problem 55 in
-A.R. Conn, N.I.M. Gould, M. Lescrenier and Ph.L. Toint,
-"Performance of a multifrontal scheme for partially separable
-optimization",
-Report 88/4, Dept of Mathematics, FUNDP (Namur, B), 1988.
-SIF input: Ph. Toint, Dec 1989.
-classification OUR2-AN-V-0
+
+D. Orban, Montreal, 08/2015.
 """,
   :reference => raw"""
-@techreport{LuksanMatonohaVlcek2003,
-  author       = {Luksan, Ladislav and Matonoha, Cestmir and Vlcek, Jan},
-  title        = {Modified {CUTE} Problems for Sparse Unconstrained Optimization},
-  institution  = {Institute of Computer Science, Academy of Sciences of the Czech Republic},
-  number       = {1081},
-  year         = {2003},
-  address      = {Prague, Czech Republic}
+@techreport{ConnGouldLescrenierToint1988,
+  author      = {Conn, A. R. and Gould, N. I. M. and Lescrenier, M. and Toint, Ph. L.},
+  title       = {Performance of a multifrontal scheme for partially separable optimization},
+  institution = {Department of Mathematics, FUNDP},
+  address     = {Namur, Belgium},
+  number      = {Report 88/4},
+  year        = {1988}
 }  
 """,
   :lib => "CUTEst:ARWHEAD, Luksan:1",

src/Meta/bdqrtic.jl

@@ -18,9 +18,9 @@ bdqrtic_meta = Dict(
   :origin => :unknown,
   :url => "https://bitbucket.org/optrove/sif/src/master/BDQRTIC.SIF",
   :notes => raw"""
-A quartic with a banded Hessian of bandwidth 9
-
-Source:
+This problem is quartic and has a banded Hessian with bandwidth = 9
+""",
+  :origin_notes => raw"""
 Problem 61 in
 A.R. Conn, N.I.M. Gould, M. Lescrenier and Ph.L. Toint,
 Performance of a multifrontal scheme for partially separable
@@ -38,31 +38,20 @@ Academy of Science of the Czech Republic
 
 http://www.cs.cas.cz/matonoha/download/V1081.pdf
 
+SIF input: Ph. Toint, Dec 1989.
 classification SUR2-AN-V-0
 
 D. Orban, Montreal, 08/2015.
-""",
-  :origin_notes => raw"""
-Problem :
-This problem is quartic and has a banded Hessian with bandwidth = 9
-Source: Problem 61 in
-A.R. Conn, N.I.M. Gould, M. Lescrenier and Ph.L. Toint,
-"Performance of a multifrontal scheme for partially separable
-optimization",
-Report 88/4, Dept of Mathematics, FUNDP (Namur, B), 1988.
-SIF input: Ph. Toint, Dec 1989.
-classification SUR2-AN-V-0
 """,
   :reference => raw"""
-@techreport{LuksanMatonohaVlcek2003,
-  author       = {Luksan, Ladislav and Matonoha, Cestmir and Vlcek, Jan},
-  title        = {Modified {CUTE} Problems for Sparse Unconstrained Optimization},
-    institution  = {Institute of Computer Science, Academy of Sciences of the Czech Republic},
-  number       = {1081},
-  year         = {2003},
-  address      = {Prague, Czech Republic},
-  url          = {http://www.cs.cas.cz/matonoha/download/V1081.pdf},
-  }  
+@techreport{ConnGouldLescrenierToint1988,
+  author      = {Conn, A. R. and Gould, N. I. M. and Lescrenier, M. and Toint, Ph. L.},
+  title       = {Performance of a multifrontal scheme for partially separable optimization},
+  institution = {Department of Mathematics, FUNDP},
+  address     = {Namur, Belgium},
+  number      = {Report 88/4},
+  year        = {1988}
+}  
   """,
 
   :lib => "CUTEst:BDQRTIC, Luksan:2",

src/Meta/broydn7d.jl

@@ -20,8 +20,8 @@ broydn7d_meta = Dict(
   :notes => raw"""
 A seven diagonal variant of the Broyden tridiagonal system,
 featuring a band far away from the diagonal.
-
-Source:
+""",
+  :origin_notes => raw"""
 Problem 3.4 in
 Ph. L. Toint,
 Some numerical results using a sparse matrix updating formula in
@@ -55,36 +55,25 @@ http://www.cs.cas.cz/matonoha/download/V1081.pdf
 
 See also Buckley#84
 
+SIF input: Ph. Toint, Dec 1989.
 classification OUR2-AN-V-0
 
 D. Orban, Montreal, 08/2015.
 
 # Note: discrepancy with CUTEst appears to be a bug in CUTEst, this matches the original paper
 # (See issue #36)
-""",
-  :origin_notes => raw"""
-Problem :
-A seven diagonal variant of the Broyden tridiagonal system,
-featuring a band far away from the diagonal.
-Source:
-Ph.L. Toint,
-"Some numerical results using a sparse matrix updating formula in
-unconstrained optimization",
-Mathematics of Computation, vol. 32(114), pp. 839-852, 1978.
-See also Buckley#84
-SIF input: Ph. Toint, Dec 1989.
-classification OUR2-AN-V-0
 """,
   :reference => raw"""
-@techreport{LuksanMatonohaVlcek2003,
-  author       = {Luksan, Ladislav and Matonoha, Cestmir and Vlcek, Jan},
-  title        = {Modified {CUTE} Problems for Sparse Unconstrained Optimization},
-    institution  = {Institute of Computer Science, Academy of Sciences of the Czech Republic},
-  number       = {1081},
-  year         = {2003},
-  address      = {Prague, Czech Republic},
-  url          = {http://www.cs.cas.cz/matonoha/download/V1081.pdf},
-  }  
+@article{Toint1978MathComp,
+  author  = {Toint, Ph. L.},
+  title   = {Some numerical results using a sparse matrix updating formula in unconstrained optimization},
+  journal = {Mathematics of Computation},
+  year    = {1978},
+  volume  = {32},
+  number  = {143},
+  pages   = {839--851},
+  doi     = {10.1090/s0025-5718-1978-0483452-7}
+}  
   """,
 
   :lib => "CUTEst:BROYDN7D, Luksan:3",

src/Meta/chainwoo.jl

@@ -18,7 +18,19 @@ chainwoo_meta = Dict(
   :origin => :unknown,
   :url => "https://bitbucket.org/optrove/sif/src/master/CHAINWOO.SIF",
   :notes => raw"""
-Source:  problem 8 in
+The chained Woods problem, a variant on Woods function
+This problem is a sum of n/2 sets of 6 terms, each of which is
+assigned its own group.  For a given set i, the groups are
+A(i), B(i), C(i), D(i), E(i) and F(i). Groups A(i) and C(i) contain 1
+nonlinear element each, denoted Y(i) and Z(i).
+The problem dimension is defined from the number of these sets.
+The number of problem variables is then 2 times + 2 as large
+This version uses a slightly unorthodox expression of Woods
+function as a sum of squares (see Buckley)
+""",
+  :origin_notes => raw"""
+Problem :
+Problem 8 in
 A. R. Conn, N. I. M. Gould and Ph. L. Toint,
 Testing a class of methods for solving minimization
 problems with simple bounds on their variables,
@@ -35,6 +47,7 @@ Academy of Science of the Czech Republic
 
 http://www.cs.cas.cz/matonoha/download/V1081.pdf
 
+SIF input: Nick Gould and Ph. Toint, Dec 1995.
 classification SUR2-AN-V-0
 
 D. Orban, Montreal, 08/2015.
@@ -49,36 +62,18 @@ Institute of Computer Science,
 Academy of Science of the Czech Republic
 
 https://www.researchgate.net/publication/325314400_Sparse_Test_Problems_for_Unconstrained_Optimization
-""",
-  :origin_notes => raw"""
-Problem :
-The chained Woods problem, a variant on Woods function
-This problem is a sum of n/2 sets of 6 terms, each of which is
-assigned its own group.  For a given set i, the groups are
-A(i), B(i), C(i), D(i), E(i) and F(i). Groups A(i) and C(i) contain 1
-nonlinear element each, denoted Y(i) and Z(i).
-The problem dimension is defined from the number of these sets.
-The number of problem variables is then 2 times + 2 as large
-This version uses a slightly unorthodox expression of Woods
-function as a sum of squares (see Buckley)
-Source:  problem 8 in
-A.R.Conn,N.I.M.Gould and Ph.L.Toint,
-"Testing a class of methods for solving minimization 
-problems with simple bounds on their variables, 
-Mathematics of Computation 50, pp 399-430, 1988.
-SIF input: Nick Gould and Ph. Toint, Dec 1995.
-classification SUR2-AN-V-0
 """,
   :reference => raw"""
-@techreport{LuksanMatonohaVlcek2003,
-  author       = {Luksan, Ladislav and Matonoha, Cestmir and Vlcek, Jan},
-  title        = {Modified {CUTE} Problems for Sparse Unconstrained Optimization},
-    institution  = {Institute of Computer Science, Academy of Sciences of the Czech Republic},
-  number       = {1081},
-  year         = {2003},
-  address      = {Prague, Czech Republic},
-  url          = {http://www.cs.cas.cz/matonoha/download/V1081.pdf},
-  }  
+@article{ConnGouldToint1988MathComp,
+  author  = {Conn, Andrew R. and Gould, Nicholas I. M. and Toint, Philippe L.},
+  title   = {Testing a class of methods for solving minimization problems with simple bounds on the variables},
+  journal = {Mathematics of Computation},
+  year    = {1988},
+  volume  = {50},
+  number  = {182},
+  pages   = {399--430},
+  doi     = {10.1090/s0025-5718-1988-0929544-3}
+}  
   """,
 
   :lib => "CUTEst:CHAINWOO, Luksan:5, LuksanSparse:2",

src/Meta/cragglvy.jl

@@ -19,14 +19,18 @@ cragglvy_meta = Dict(
   :url => "https://bitbucket.org/optrove/sif/src/master/CRAGGLVY.SIF",
   :notes => raw"""
 Extended Cragg and Levy problem.
-The Hessian matrix is 7-diagonal.
-
-Source: problem 32 in
+This problem is a sum of m  sets of 5 groups,
+There are 2m+2 variables. The Hessian matrix is 7-diagonal.
+""",
+  :origin_notes => raw"""
+Problem 32 in
 Ph. L. Toint,
 Test problems for partially separable optimization and results
 for the routine PSPMIN,
 Report 83/4, Department of Mathematics, FUNDP (Namur, B), 1983.
 
+See  also Buckley#18
+
 See also
 
 problem 7 in
@@ -38,34 +42,19 @@ Academy of Science of the Czech Republic
 
 http://www.cs.cas.cz/matonoha/download/V1081.pdf
 
+SIF input: Ph. Toint, Dec 1989.
 classification OUR2-AY-V-0
 
 D. Orban, Montreal, 08/2015.
-""",
-  :origin_notes => raw"""
-Problem :
-Extended Cragg and Levy problem.
-This problem is a sum of m  sets of 5 groups,
-There are 2m+2 variables. The Hessian matrix is 7-diagonal.
-Source:  problem 32 in
-Ph. L. Toint,
-"Test problems for partially separable optimization and results
-for the routine PSPMIN",
-Report 83/4, Department of Mathematics, FUNDP (Namur, B), 1983.
-See  also Buckley#18
-SIF input: Ph. Toint, Dec 1989.
-classification OUR2-AY-V-0
 """,
   :reference => raw"""
-@techreport{LuksanMatonohaVlcek2003,
-  author       = {Luksan, Ladislav and Matonoha, Cestmir and Vlcek, Jan},
-  title        = {Modified {CUTE} Problems for Sparse Unconstrained Optimization},
-    institution  = {Institute of Computer Science, Academy of Sciences of the Czech Republic},
-  number       = {1081},
-  year         = {2003},
-  address      = {Prague, Czech Republic},
-  url          = {http://www.cs.cas.cz/matonoha/download/V1081.pdf},
-  }  
+@techreport{Toint1983,
+  author      = {Ph. L. Toint},
+  title       = {Test problems for partially separable optimization and results for the routine PSPMIN},
+  institution = {Department of Mathematics, FUNDP (Namur, Belgium)},
+  number      = {Report 83/4},
+  year        = {1983}
+}  
   """,
 
   :lib => "CUTEst:CRAGGLVY, Luksan:7",

src/Meta/dqrtic.jl

@@ -19,10 +19,6 @@ dqrtic_meta = Dict(
   :url => "http://www.cs.cas.cz/matonoha/download/V1081.pdf, https://bitbucket.org/optrove/sif/src/master/DQRTIC.SIF",
   :notes => raw"""
 Variable dimension diagonal quartic problem.
-
-classification OUR2-AN-V-0
-
-D. Orban, Montreal, 08/2015.
 """,
   :origin_notes => raw"""
 Problem 157 (p. 87) in
@@ -39,27 +35,21 @@ Modified CUTE problems for sparse unconstrained optimization,
 Technical Report 1081,
 Institute of Computer Science,
 Academy of Science of the Czech Republic  
-  ---
-Problem :
-Variable dimension diagonal quartic problem.
-Source: problem 157 (p. 87) in
-A.R. Buckley,
-"Test functions for unconstrained minimization",
-TR 1989CS-3, Mathematics, statistics and computing centre,
-Dalhousie University, Halifax (CDN), 1989.
+
 SIF input: Ph. Toint, Dec 1989.
 classification OUR2-AN-V-0
+
+D. Orban, Montreal, 08/2015.
 """,
   :reference => raw"""
-@techreport{LuksanMatonohaVlcek2003,
-  author       = {Luksan, Ladislav and Matonoha, Cestmir and Vlcek, Jan},
-  title        = {Modified {CUTE} Problems for Sparse Unconstrained Optimization},
-    institution  = {Institute of Computer Science, Academy of Sciences of the Czech Republic},
-  number       = {1081},
-  year         = {2003},
-  address      = {Prague, Czech Republic},
-  url          = {http://www.cs.cas.cz/matonoha/download/V1081.pdf},
-  }  
+@techreport{Buckley1989,
+  author      = {Buckley, A. G.},
+  title       = {Test functions for unconstrained minimization},
+  institution = {Computing Science Division, Dalhousie University},
+  address     = {Dalhousie, Canada},
+  number      = {CS-3},
+  year        = {1989}
+}  
   """,
 
   :lib => "CUTEst:DQRTIC, Luksan:23",