Parallel algorithm for unconstrained optimization based on decomposition techniques
DOI10.1023/A:1022665620666zbMATH Open0902.90145OpenAlexW142014418MaRDI QIDQ1379930FDOQ1379930
Authors: 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
Recommendations
parallel algorithmlarge-scale unconstrained optimizationlimited-memory quasi-Newton methodsparallel gradient distribution
Parallel numerical computation (65Y05) Large-scale problems in mathematical programming (90C06) Nonlinear programming (90C30)
Cites Work
- Testing Unconstrained Optimization Software
- On the limited memory BFGS method for large scale optimization
- Title not available (Why is that?)
- Title not available (Why is that?)
- A truncated Newton method with non-monotone line search for unconstrained optimization
- Parallel Gradient Distribution in Unconstrained Optimization
- Parallel Variable Distribution
- The PVM concurrent computing system: Evolution, experiences, and trends
Cited In (7)
- A sequential approach for unconstrained optimization via a partitioning technique
- Two parallel distribution algorithms for convex constrained minimization problems
- Algorithm 711: BTN: software for parallel unconstrained optimization
- An optimal parallel algorithm to construct a deap
- Parallel Gradient Distribution in Unconstrained Optimization
- A unified approach to parallel space decomposition methods
- Parallel Uzawa method for large-scale minimization of partially separable functions
Uses Software
This page was built for publication: Parallel algorithm for unconstrained optimization based on decomposition techniques
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1379930)
