A General-Purpose Parallel Algorithm for Unconstrained Optimization

DOI10.1137/0801032zbMath0754.90054OpenAlexW2021271374MaRDI QIDQ4012434

Stephen G. Nash, Ariela Sofer

Publication date: 27 September 1992

Published in: SIAM Journal on Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/0801032

zbMATH Keywords

unconstrained optimizationblock truncated-Newton method

Mathematics Subject Classification ID

Nonlinear programming (90C30) Parallel numerical computation (65Y05) Computational methods for problems pertaining to operations research and mathematical programming (90-08)

Related Items (4)

An H-form variant of the partitioned QN method ⋮ An adaptive truncation criterion, for linesearch-based truncated Newton methods in large scale nonconvex optimization ⋮ A survey of truncated-Newton methods ⋮ A parallel asynchronous Newton algorithm for unconstrained optimization

This page was built for publication: A General-Purpose Parallel Algorithm for Unconstrained Optimization