[lmi-commits] [lmi] master fcc1f671 1/2: Use only current PURLs

[Greg Chicares]

branch: master
commit fcc1f6714aec5e25dddbaa1fe3e74eaa06d3bd78
Author: Gregory W. Chicares <gchicares@sbcglobal.net>
Commit: Gregory W. Chicares <gchicares@sbcglobal.net>

    Use only current PURLs
    
    Some took a long time to archive yesterday, but all ultimately finished.
---
 toms_748.html | 6 +++---
 1 file changed, 3 insertions(+), 3 deletions(-)

diff --git a/toms_748.html b/toms_748.html
index efff961c..08135e4f 100644
--- a/toms_748.html
+++ b/toms_748.html
@@ -1357,9 +1357,9 @@ the roots computed for all 154 test cases, by Algorithm 
4.2 only.
 Brent, R. P.: &ldquo;Algorithms for Minimization without Derivatives&rdquo;,
 Prentice-Hall, Englewood Cliffs, New Jersey, 1973.
 <a href="https://maths-people.anu.edu.au/~brent/pub/pub011.html";>Online copy 
provided by Brent</a>
-<a 
href="https://web.archive.org/web/20220320155343/https://maths-people.anu.edu.au/~brent/pub/pub011.html";>[PURL]</a>;
+<a 
href="https://web.archive.org/web/20220412114927/https://maths-people.anu.edu.au/~brent/pub/pub011.html";>[PURL]</a>;
 <a href="https://maths-people.anu.edu.au/~brent/pd/rpb011i.pdf";>PDF</a>
-<a 
href="https://web.archive.org/web/20220323225414/https://maths-people.anu.edu.au/~brent/pd/rpb011i.pdf";>[PURL]</a>.
+<a 
href="https://web.archive.org/web/20220412114936/https://maths-people.anu.edu.au/~brent/pd/rpb011i.pdf";>[PURL]</a>.
 </p>
 
 <p>
@@ -1377,7 +1377,7 @@ Equations&rdquo;, ACM Trans. Math. Softw., Vol. 11, No. 
3, September 1985,
 Pages 250&minus;262. Available online:
 <a href="https://dl.acm.org/doi/pdf/10.1145/214408.214416";>citation</a>;
 <a href="http://www.dsc.ufcg.edu.br/~rangel/msn/downloads/p250-le.pdf";>PDF</a>.
-<a 
href="https://web.archive.org/web/20170829071314/http://www.dsc.ufcg.edu.br/~rangel/msn/downloads/p250-le.pdf";>[PURL]</a>.
+<a 
href="https://web.archive.org/web/20220412123443/http://www.dsc.ufcg.edu.br/~rangel/msn/downloads/p250-le.pdf";>[PURL]</a>.
 Le uses a third-order Newton method with numerical approximations of
 derivatives, and achieves a tight upper bound of no more than four
 times the number of evaluations required by pure bisection.