Introduces parallel subproblem evaluation and batch addition of up to K cuts per iteration for a convex vector optimization algorithm, proves the batch variant preserves the O(k^{2/(1-q)}) convergence rate, and reports 62-80% fewer iterations with variable wall-clock gains.
Validity of the single processor approach to achieving large scale computing capabilities,
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
years
2026 2verdicts
UNVERDICTED 2representative citing papers
Empirical benchmark finds hybrid MPI+OpenMP reduces communication overhead and improves efficiency over pure MPI at large node counts for coarse-grained LAMMPS runs.
citing papers explorer
-
On Parallel and Batch-Cutting Strategies for Norm-Minimization-Based Convex Vector Optimization
Introduces parallel subproblem evaluation and batch addition of up to K cuts per iteration for a convex vector optimization algorithm, proves the batch variant preserves the O(k^{2/(1-q)}) convergence rate, and reports 62-80% fewer iterations with variable wall-clock gains.
-
Strategies for Molecular Dynamics using Hybrid Systems: LAMMPS Use Case
Empirical benchmark finds hybrid MPI+OpenMP reduces communication overhead and improves efficiency over pure MPI at large node counts for coarse-grained LAMMPS runs.