Parallel algorithm for unconstrained optimization based on decomposition techniques

DOI10.1023/A:1022665620666zbMath0902.90145OpenAlexW142014418MaRDI QIDQ1379930

Domenico Conforti, Roberto Musmanno

Publication date: 16 December 1998

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

Full work available at URL: https://doi.org/10.1023/a:1022665620666

zbMATH Keywords

parallel algorithmlarge-scale unconstrained optimizationlimited-memory quasi-Newton methodsparallel gradient distribution

Mathematics Subject Classification ID

Large-scale problems in mathematical programming (90C06) Nonlinear programming (90C30) Parallel numerical computation (65Y05)

Related Items (1)

Parallel Uzawa method for large-scale minimization of partially separable functions

Uses Software

• L-BFGS
• minpack

Cites Work

• Unnamed Item
• Unnamed Item
• On the limited memory BFGS method for large scale optimization
• A truncated Newton method with non-monotone line search for unconstrained optimization
• The PVM concurrent computing system: Evolution, experiences, and trends
• Testing Unconstrained Optimization Software
• Parallel Variable Distribution
• Parallel Gradient Distribution in Unconstrained Optimization

This page was built for publication: Parallel algorithm for unconstrained optimization based on decomposition techniques