Convergence and numerical results for a parallel asynchronous quasi- Newton method

DOI10.1007/BF02192116zbMath0823.90112WikidataQ62635495 ScholiaQ62635495MaRDI QIDQ1893309

Roberto Musmanno, Domenico Conforti

Publication date: 13 November 1995

Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)

zbMATH Keywords

unconstrained optimizationquasi-Newton methodhierarchical parallelismparallel asynchronous version

Mathematics Subject Classification ID

Nonlinear programming (90C30) Parallel numerical computation (65Y05)

Related Items

Some theoretical properties of Feng-Schnabel algorithm for block bordered nonlinear systems

Uses Software

• L-BFGS
• minpack

Cites Work

• Unnamed Item
• Unnamed Item
• A truncated Newton method with non-monotone line search for unconstrained optimization
• An asynchronous parallel Newton method
• A model of efficient asynchronous parallel algorithms on multicomputer systems
• A parallel asynchronous Newton algorithm for unconstrained optimization
• QN-like variable storage conjugate gradients
• Global Convergence of a Cass of Quasi-Newton Methods on Convex Problems
• A Tool for the Analysis of Quasi-Newton Methods with Application to Unconstrained Minimization
• Testing Unconstrained Optimization Software