𝔖 Scriptorium
✦   LIBER   ✦

📁

Conjugate Direction Methods in Optimization

✍ Scribed by Magnus Rudolph Hestenes (auth.)


Publisher
Springer-Verlag New York
Year
1980
Tongue
English
Leaves
333
Series
Applications of Mathematics 12
Edition
1
Category
Library

⬇  Acquire This Volume

No coin nor oath required. For personal study only.

✦ Synopsis


Shortly after the end of World War II high-speed digital computing machines were being developed. It was clear that the mathematical aspects of com­ putation needed to be reexamined in order to make efficient use of high-speed digital computers for mathematical computations. Accordingly, under the leadership of Min a Rees, John Curtiss, and others, an Institute for Numerical Analysis was set up at the University of California at Los Angeles under the sponsorship of the National Bureau of Standards. A similar institute was formed at the National Bureau of Standards in Washington, D. C. In 1949 J. Barkeley Rosser became Director of the group at UCLA for a period of two years. During this period we organized a seminar on the study of solu­ tions of simultaneous linear equations and on the determination of eigen­ values. G. Forsythe, W. Karush, C. Lanczos, T. Motzkin, L. J. Paige, and others attended this seminar. We discovered, for example, that even Gaus­ sian elimination was not well understood from a machine point of view and that no effective machine oriented elimination algorithm had been developed. During this period Lanczos developed his three-term relationship and I had the good fortune of suggesting the method of conjugate gradients. We dis­ covered afterward that the basic ideas underlying the two procedures are essentially the same. The concept of conjugacy was not new to me. In a joint paper with G. D.

✦ Table of Contents


Front Matter....Pages i-x
Newton’s Method and the Gradient Method....Pages 1-80
Conjugate Direction Methods....Pages 81-149
Conjugate Gram-Schmidt Processes....Pages 150-230
Conjugate Gradient Algorithms....Pages 231-318
Back Matter....Pages 319-325

✦ Subjects


Systems Theory, Control; Calculus of Variations and Optimal Control; Optimization


📜 SIMILAR VOLUMES


Conjugate Direction Methods in Optimizat
✍ Magnus Rudolph Hestenes (auth.) 📂 Library 📅 1980 🏛 Springer-Verlag New York 🌐 English

<p>Shortly after the end of World War II high-speed digital computing machines were being developed. It was clear that the mathematical aspects of com­ putation needed to be reexamined in order to make efficient use of high-speed digital computers for mathematical computations. Accordingly, under th

Conjugate duality in convex optimization
✍ Radu Ioan Bot 📂 Library 📅 2010 🏛 Springer 🌐 English

<P>This book presents new achievements and results in the theory of conjugate duality for convex optimization problems. The perturbation approach for attaching a dual problem to a primal one makes the object of a preliminary chapter, where also an overview of the classical generalized interior point

Nonlinear Conjugate Gradient Methods for
✍ Neculai Andrei 📂 Library 📅 2020 🏛 Springer 🌐 English

<p></p><p>Two approaches are known for solving <i>large-scale</i> unconstrained optimization problems―the limited-memory quasi-Newton method (truncated Newton method) and the conjugate gradient method. This is the first book to detail conjugate gradient methods, showing their properties and converge

Conjugate Gradient Algorithms in Nonconv
✍ Radosław Pytlak (auth.) 📂 Library 📅 2009 🏛 Springer-Verlag Berlin Heidelberg 🌐 English

<p><P>This up-to-date book is on algorithms for large-scale unconstrained and bound constrained optimization. Optimization techniques are shown from a conjugate gradient algorithm perspective. </P><P>Large part of the book is devoted to preconditioned conjugate gradient algorithms. In particular mem