Iteration grain sized asynchronous parallel algorithms in optimization

DOI10.1080/00207169908804802MaRDI QIDQ4243253zbMATH OpenOpenAlexFDO

Authors I. 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

asynchronous parallel algorithmsfixed point iterationlarge-grained parallelizationoptimizationpoint to set mapping

Mathematics Subject Classification ID

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

Review text

``Iteration grain sized means that an iteration is the ``natural base for parallelization. General discussion of parallelization principles, based on fixed point iteration or on point to set mapping. General theorems for convergence proof are given.

Recommendations

• On asynchronous iterations
• scientific article; zbMATH DE number 12532
• Some aspects of parallel and distributed iterative algorithms - a survey
• Parallel asynchronous iterations of least fixed points
• Parallel Gradient Distribution in Unconstrained Optimization

Cites work

• scientific article; zbMATH DE number 3912096 (Why is no real title available?)
• scientific article; zbMATH DE number 4033059 (Why is no real title available?)
• scientific article; zbMATH DE number 51132 (Why is no real title available?)
• scientific article; zbMATH DE number 3310599 (Why is no real title available?)
• Mathematical modeling of a parallel global optimization algorithm
• On the average communication complexity of asynchronous distributed algorithms
• Parallel Numerical Optimization: Current Status and an Annotated Bibliography
• Parallel successive overrelaxation methods for symmetric linear complementarity problems and linear programs
• Partially and totally asynchronous algorithms for linear complementarity problems
• State-of-the-art in parallel nonlinear optimization
• Three digit accurate multiple normal probabilities

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4243253)