TE
TechEcho
Home24h TopNewestBestAskShowJobs
GitHubTwitter
Home

TechEcho

A tech news platform built with Next.js, providing global tech news and discussions.

GitHubTwitter

Home

HomeNewestBestAskShowJobs

Resources

HackerNews APIOriginal HackerNewsNext.js

© 2025 TechEcho. All rights reserved.

MJD Powell FRS in "Oral History of SIAM" [pdf]

4 pointsby zaikunzhangabout 1 year ago

5 comments

zaikunzhangabout 1 year ago
The obituary of Powell published by the Royal Society:<p><a href="https:&#x2F;&#x2F;royalsocietypublishing.org&#x2F;doi&#x2F;full&#x2F;10.1098&#x2F;rsbm.2017.0023" rel="nofollow">https:&#x2F;&#x2F;royalsocietypublishing.org&#x2F;doi&#x2F;full&#x2F;10.1098&#x2F;rsbm.201...</a><p><a href="https:&#x2F;&#x2F;www.damtp.cam.ac.uk&#x2F;user&#x2F;na&#x2F;NA_papers&#x2F;NA2017_04.pdf" rel="nofollow">https:&#x2F;&#x2F;www.damtp.cam.ac.uk&#x2F;user&#x2F;na&#x2F;NA_papers&#x2F;NA2017_04.pdf</a><p>by Optimization Methods and Software:<p><a href="https:&#x2F;&#x2F;www.tandfonline.com&#x2F;doi&#x2F;full&#x2F;10.1080&#x2F;10556788.2015.1051808" rel="nofollow">https:&#x2F;&#x2F;www.tandfonline.com&#x2F;doi&#x2F;full&#x2F;10.1080&#x2F;10556788.2015.1...</a><p><a href="https:&#x2F;&#x2F;www.mathopt.org&#x2F;Optima-Issues&#x2F;optima99.pdf" rel="nofollow">https:&#x2F;&#x2F;www.mathopt.org&#x2F;Optima-Issues&#x2F;optima99.pdf</a><p>and by the SIAM Activity Group on Optimization:<p><a href="http:&#x2F;&#x2F;wiki.siam.org&#x2F;siag-op&#x2F;images&#x2F;siag-op&#x2F;6&#x2F;64&#x2F;ViewsAndNews-23%281%29.pdf" rel="nofollow">http:&#x2F;&#x2F;wiki.siam.org&#x2F;siag-op&#x2F;images&#x2F;siag-op&#x2F;6&#x2F;64&#x2F;ViewsAndNew...</a>
zaikunzhangabout 1 year ago
ABSTRACT<p>Michael Powell discusses his career and research. Powell was born in London and lived in Sussex and Surrey. He had a governess in mathematics when he was very young, and because he enjoyed looking at mathematics books, often just doing the exercises, he was ahead of his classes in mathematics. He became an undergraduate at Cambridge, finishing in three years, two years for part 2 of the Mathematical Tripos and then taking a diploma in numerical analysis and computing in his third year. He joined the Atomic Energy Research Establishment at Harwell, and stayed for seventeen years. At Harwell, he started the Harwell Subroutine Library, one of the first libraries of numerical algorithms, and began his research career. He discusses the origin of the DFP [Davidon-Fletcher-Powell] method and subsequent methods that overtook it. After leaving Harwell, he returned to Cambridge in 1976 as a Professor and continued his research career. He received a Doctor of Science degree in 1979 at Cambridge. He discusses his subsequent work in optimization and approximation, the differences between research at Harwell and Cambridge, and his preferences in conducting research, including his tendency to publish by himself. Powell retired from Cambridge in 1996.
zaikunzhangabout 1 year ago
Who was Powell? (from <a href="https:&#x2F;&#x2F;github.com&#x2F;libprima&#x2F;prima#who-was-powell">https:&#x2F;&#x2F;github.com&#x2F;libprima&#x2F;prima#who-was-powell</a>)<p>Michael James David Powell FRS [1] was &quot;a British numerical analyst who was among the pioneers of computational mathematics&quot; [2]. He was the inventor&#x2F;early contributor of quasi-Newton method [3], trust region method [4], augmented Lagrangian method [5], and SQP method [6]. Each of them is a pillar of modern numerical optimization. He also made significant contributions to approximation theory and methods [7].<p>Among numerous honors, Powell was one of the two recipients of the first Dantzig Prize [8] from the Mathematical Programming Society (MOS) and Society for Industrial and Applied Mathematics (SIAM). This is considered the highest award in optimization.<p>[1] <a href="https:&#x2F;&#x2F;en.wikipedia.org&#x2F;wiki&#x2F;Michael_J._D._Powell" rel="nofollow">https:&#x2F;&#x2F;en.wikipedia.org&#x2F;wiki&#x2F;Michael_J._D._Powell</a><p>[2] <a href="https:&#x2F;&#x2F;royalsocietypublishing.org&#x2F;doi&#x2F;full&#x2F;10.1098&#x2F;rsbm.2017.0023" rel="nofollow">https:&#x2F;&#x2F;royalsocietypublishing.org&#x2F;doi&#x2F;full&#x2F;10.1098&#x2F;rsbm.201...</a><p>[3] <a href="https:&#x2F;&#x2F;en.wikipedia.org&#x2F;wiki&#x2F;Quasi-Newton_method" rel="nofollow">https:&#x2F;&#x2F;en.wikipedia.org&#x2F;wiki&#x2F;Quasi-Newton_method</a><p>[4] <a href="https:&#x2F;&#x2F;en.wikipedia.org&#x2F;wiki&#x2F;Trust_region" rel="nofollow">https:&#x2F;&#x2F;en.wikipedia.org&#x2F;wiki&#x2F;Trust_region</a><p>[5] <a href="https:&#x2F;&#x2F;en.wikipedia.org&#x2F;wiki&#x2F;Augmented_Lagrangian_method" rel="nofollow">https:&#x2F;&#x2F;en.wikipedia.org&#x2F;wiki&#x2F;Augmented_Lagrangian_method</a><p>[6] <a href="https:&#x2F;&#x2F;en.wikipedia.org&#x2F;wiki&#x2F;Sequential_quadratic_programming" rel="nofollow">https:&#x2F;&#x2F;en.wikipedia.org&#x2F;wiki&#x2F;Sequential_quadratic_programmi...</a><p>[7] <a href="https:&#x2F;&#x2F;www.cambridge.org&#x2F;highereducation&#x2F;books&#x2F;approximation-theory-and-methods&#x2F;66FD8CD6F18FE1ED499A8CA9A05F2A5A#overview" rel="nofollow">https:&#x2F;&#x2F;www.cambridge.org&#x2F;highereducation&#x2F;books&#x2F;approximatio...</a><p>[8] <a href="https:&#x2F;&#x2F;en.wikipedia.org&#x2F;wiki&#x2F;Dantzig_Prize" rel="nofollow">https:&#x2F;&#x2F;en.wikipedia.org&#x2F;wiki&#x2F;Dantzig_Prize</a>
genphy1976about 1 year ago
Here is another interview:<p><a href="http:&#x2F;&#x2F;www-optima.amp.i.kyoto-u.ac.jp&#x2F;ORB&#x2F;issue21&#x2F;interview_mike.html" rel="nofollow">http:&#x2F;&#x2F;www-optima.amp.i.kyoto-u.ac.jp&#x2F;ORB&#x2F;issue21&#x2F;interview_...</a>
ggraphiliaabout 1 year ago
Also <a href="https:&#x2F;&#x2F;www.mat.uc.pt&#x2F;~lnv&#x2F;papers&#x2F;mjdp.pdf" rel="nofollow">https:&#x2F;&#x2F;www.mat.uc.pt&#x2F;~lnv&#x2F;papers&#x2F;mjdp.pdf</a>