RA-DCA applies randomized vertex screening inside DCA iterations for max-structured DC programs and proves that safeguarded accumulation points are directionally stationary with probability one under regularity, active-set consistency, and random-embedding assumptions.
The exact residual is computed using the exact active set, not the initial ε0-active set
3 Pith papers cite this work. Polarity classification is still indexing.
3
Pith papers citing it
representative citing papers
The authors integrate quantum annealing and QAOA as subroutines for pricing and separation in a branch-price-and-cut algorithm for vehicle routing problems.
citing papers explorer
-
RA-DCA: A Randomized Active-Set DCA for Directional Stationarity in Max-Structured DC Programs
RA-DCA applies randomized vertex screening inside DCA iterations for max-structured DC programs and proves that safeguarded accumulation points are directionally stationary with probability one under regularity, active-set consistency, and random-embedding assumptions.
-
Quantum Subroutines in Branch-Price-and-Cut for Vehicle Routing
The authors integrate quantum annealing and QAOA as subroutines for pricing and separation in a branch-price-and-cut algorithm for vehicle routing problems.
- ABI: A tightly integrated, unified, sparsity-aware, reconfigurable, compute near-register file/cache GPU architecture with light-weight softmax for deep learning, linear algebra, and Ising compute