𝔖 Bobbio Scriptorium
✦   LIBER   ✦

On the Communication Complexity of Lipschitzian Optimization for the Coordinated Model of Computation

✍ Scribed by Mehran Mesbahi; George P. Papavassilopoulos

Publisher
Elsevier Science
Year
2000
Tongue
English
Weight
140 KB
Volume
16
Category
Article
ISSN
0885-064X

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

On the Complexity of Exclusion Algorithm
On the Complexity of Exclusion Algorithms for Optimization
✍ Eugene Allgower; Melissa Erdmann; Kurt Georg πŸ“‚ Article πŸ“… 2002 πŸ› Elsevier Science 🌐 English βš– 133 KB

Exclusion algorithms are a well-known tool in the area of interval analysis for finding all solutions of a system of nonlinear equations or for finding the global minimum of a function over a compact domain. The present paper discusses a new class of tests for such algorithms in the context of globa

On the computation of complex equilibria
On the computation of complex equilibria
✍ Y. H. Ma; C. W. Shipman πŸ“‚ Article πŸ“… 1972 πŸ› American Institute of Chemical Engineers 🌐 English βš– 577 KB
On the Utility of Communication–Computat
On the Utility of Communication–Computation Overlap in Data-Parallel Programs
✍ Michael J. Quinn; Philip J. Hatcher πŸ“‚ Article πŸ“… 1996 πŸ› Elsevier Science 🌐 English βš– 260 KB

However, the speedup achieved through parallelism is often lower in modern systems. It is no surprise, then, that developers of compilers for data-parallel languages have hypothesized the importance of optimizations that overlap communications with computations in order to reduce execution times and