Please note: In order to keep Hive up to date and provide users with the best features, we are no longer able to fully support Internet Explorer. The site is still available to you, however some sections of the site may appear broken. We would encourage you to move to a more modern browser like Firefox, Edge or Chrome in order to experience the site fully.

Conjugate Gradient Algorithms in Nonconvex Optimization, Hardback Book

Conjugate Gradient Algorithms in Nonconvex Optimization Hardback

Part of the Nonconvex Optimization and Its Applications series

Hardback

Description

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].

Information

  • Format:Hardback
  • Pages:478 pages, 26 Tables, black and white; XXVI, 478 p.
  • Publisher:Springer-Verlag Berlin and Heidelberg GmbH & Co. K
  • Publication Date:
  • Category:
  • ISBN:9783540856337

Other Formats

Save 13%

£149.99

£129.45

Item not Available
 
Free Home Delivery

on all orders

 
Pick up orders

from local bookshops

Information

  • Format:Hardback
  • Pages:478 pages, 26 Tables, black and white; XXVI, 478 p.
  • Publisher:Springer-Verlag Berlin and Heidelberg GmbH & Co. K
  • Publication Date:
  • Category:
  • ISBN:9783540856337

Also in the Nonconvex Optimization and Its Applications series  |  View all