Del 89 - Nonconvex Optimization and Its Applications

Conjugate Gradient Algorithms in Nonconvex Optimization

Häftad, Engelska, 2010

Av Radoslaw Pytlak

2 099 kr

Beställningsvara. Skickas inom 10-15 vardagar

Fri frakt för medlemmar vid köp för minst 249 kr.

Finns i fler format (1)

Inbunden

2 099 kr

Skickas inom 10-15 vardagar

Conjugate direction methods were proposed in the early 1950s. When high speed digital computing machines were developed, attempts were made to lay the fo- dations for the mathematical aspects of computations which could take advantage of the ef?ciency of digital computers. The National Bureau of Standards sponsored the Institute for Numerical Analysis, which was established at the University of California in Los Angeles. A seminar held there on numerical methods for linear equationswasattendedbyMagnusHestenes, EduardStiefel andCorneliusLanczos. This led to the ?rst communication between Lanczos and Hestenes (researchers of the NBS) and Stiefel (of the ETH in Zurich) on the conjugate direction algorithm. The method is attributed to Hestenes and Stiefel who published their joint paper in 1952 [101] in which they presented both the method of conjugate gradient and the conjugate direction methods including conjugate Gram-Schmidt processes. A closelyrelatedalgorithmwasproposedbyLanczos[114]whoworkedonalgorithms for determiningeigenvalues of a matrix.His iterative algorithm yields the similarity transformation of a matrix into the tridiagonal form from which eigenvalues can be well approximated.Thethree-termrecurrencerelationofthe Lanczosprocedurecan be obtained by eliminating a vector from the conjugate direction algorithm scheme. Initially the conjugate gradient algorithm was called the Hestenes-Stiefel-Lanczos method [86].

Produktinformation

Utgivningsdatum2010-11-20
Mått155 x 235 x 28 mm
Vikt756 g
FormatHäftad
SpråkEngelska
SerieNonconvex Optimization and Its Applications
Antal sidor478
FörlagSpringer-Verlag Berlin and Heidelberg GmbH & Co. KG
ISBN9783642099250

Tillhör följande kategorier

Conjugate Direction Methods for Quadratic Problems.- Conjugate Gradient Methods for Nonconvex Problems.- Memoryless Quasi-Newton Methods.- Preconditioned Conjugate Gradient Algorithms.- Limited Memory Quasi-Newton Algorithms.- The Method of Shortest Residuals and Nondifferentiable Optimization.- The Method of Shortest Residuals for Differentiable Problems.- The Preconditioned Shortest Residuals Algorithm.- Optimization on a Polyhedron.- Conjugate Gradient Algorithms for Problems with Box Constraints.- Preconditioned Conjugate Gradient Algorithms for Problems with Box Constraints.- Preconditioned Conjugate Gradient Based Reduced-Hessian Methods.

From the reviews:"The book describes important algorithms for the numerical treatment of unconstrained nonlinear optimization problems with many variables. … This monograph is suitable as a text for a graduate course in computational optimization. It is useful to anyone active in this field. … This book is well written and well organized. The argument is clear. Lists of algorithms as well as tables and figures facilitate for the reader the search for desired information in the text. The reference list is comprehensive and contains 214 items." (Sven-Åke Gustafson, Mathematical Reviews, Issue 2009 i)“It is a very nice written book which can be used by researchers in optimization, in the teaching for seminars and by students … . Lists of figures, tables and algorithms make this book to a useful compendium for research and teaching. A lot of bibliographical hints with respect to a large reference list make the reader known with the historical development of CG-methods … . appendices with elements of topology, analysis, linear algebra and numerics of linear algebra make it to a self-contained book.” (Armin Hoffmann, Zentralblatt MATH, Vol. 1171, 2009)