Block truncated-Newton methods for parallel optimization (Q582212)

From MaRDI portal

!

This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:

scientific article; zbMATH DE number 4130193
Language Label Description Also known as
default for all languages
No label defined
    English
    Block truncated-Newton methods for parallel optimization
    scientific article; zbMATH DE number 4130193

      Statements

      Block truncated-Newton methods for parallel optimization (English)
      0 references
      0 references
      0 references
      1989
      0 references
      The authors present a truncated Newton method for the minimization of a nonlinear function suitable for a parallel computer. In such a method a search direction is computed by approximately solving Newton equations using an iterative scheme. In order to make this method more suitable for parallel computation, the authors propose the use of a block iterative method based on the conjugate-gradient method. The authors claim that the advantage of such an approach is that a degree of parallelism is introduced in both the linear algebra and derivative calculations. Computational experience on an Intel hypercube computer is also reported.
      0 references
      truncated Newton method
      0 references
      parallel computer
      0 references
      block iterative method
      0 references
      conjugate-gradient method
      0 references
      derivative calculations
      0 references
      Computational experience
      0 references
      hypercube computer
      0 references
      0 references

      Identifiers

      0 references
      0 references
      0 references
      0 references
      0 references
      0 references
      0 references
      0 references