Iteration grain sized asynchronous parallel algorithms in optimization
From MaRDI portal
Recommendations
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)