Iteration grain sized asynchronous parallel algorithms in optimization

DOI10.1080/00207169908804802zbMath0922.65046OpenAlexW2012929693MaRDI QIDQ4243253

István Deák

Publication date: 17 May 1999

Published in: International Journal of Computer Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/00207169908804802

zbMATH Keywords

optimizationfixed point iterationasynchronous parallel algorithmslarge-grained parallelizationpoint to set mapping

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Abstract computational complexity for mathematical programming problems (90C60) Nonlinear programming (90C30) Parallel numerical computation (65Y05)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Mathematical modeling of a parallel global optimization algorithm
• Parallel successive overrelaxation methods for symmetric linear complementarity problems and linear programs
• State-of-the-art in parallel nonlinear optimization
• Three digit accurate multiple normal probabilities
• Partially and totally asynchronous algorithms for linear complementarity problems
• Parallel Numerical Optimization: Current Status and an Annotated Bibliography
• On the average communication complexity of asynchronous distributed algorithms

This page was built for publication: Iteration grain sized asynchronous parallel algorithms in optimization