A parallel asynchronous Newton algorithm for unconstrained optimization

DOI10.1007/BF00940714zbMath0796.90053OpenAlexW2062098476WikidataQ62635501 ScholiaQ62635501MaRDI QIDQ1321336

Roberto Musmanno, Domenico Conforti

Publication date: 27 April 1994

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

Full work available at URL: https://doi.org/10.1007/bf00940714

zbMATH Keywords

unconstrained optimizationparallel computationNewton methodasynchronous communication

Mathematics Subject Classification ID

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

Related Items (1)

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

Uses Software

• minpack

Cites Work

• A truncated Newton method with non-monotone line search for unconstrained optimization
• State-of-the-art in parallel nonlinear optimization
• An asynchronous parallel Newton method
• A model of efficient asynchronous parallel algorithms on multicomputer systems
• Testing Unconstrained Optimization Software
• A General-Purpose Parallel Algorithm for Unconstrained Optimization
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A parallel asynchronous Newton algorithm for unconstrained optimization