Parallel dynamic programming variant of Riccati recursion inside ADMM enables up to 5x speedup for conic LQ control problems on multi-core CPUs.
Title resolution pending
4 Pith papers cite this work, alongside 604 external citations. Polarity classification is still indexing.
4
Pith papers citing it
604
external citations · OpenAlex
years
2026 4verdicts
UNVERDICTED 4representative citing papers
Presents a distributionally robust optimization method for sound probabilistic verification of Datalog policies in AI agents that bounds violation risk regardless of predicate correlations.
The Quad-C5 graph, built from four overlapping KCBS pentagons, is the maximum-gap contextuality witness on eight vertices and is already contextual for a single qutrit.
Asymmetry PRISM-CPU achieves 4.5x-24.1x speedups over reference solvers on N=100-2000 problems and GPU completes all 500 accounts in 109.5s where OSQP completes 4.
citing papers explorer
-
Parallel Dynamic Programming for Conic Linear Quadratic Control
Parallel dynamic programming variant of Riccati recursion inside ADMM enables up to 5x speedup for conic LQ control problems on multi-core CPUs.
-
Efficient and Sound Probabilistic Verification for AI Agents
Presents a distributionally robust optimization method for sound probabilistic verification of Datalog policies in AI agents that bounds violation risk regardless of predicate correlations.
-
The Quad-$C_5$ Graph: Maximum Contextuality Gap on Eight Vertices
The Quad-C5 graph, built from four overlapping KCBS pentagons, is the maximum-gap contextuality witness on eight vertices and is already contextual for a single qutrit.
-
Asymmetry PRISM: A CPU/GPU Portfolio Optimization Engine for Deadline-Bounded Institutional Rebalancing
Asymmetry PRISM-CPU achieves 4.5x-24.1x speedups over reference solvers on N=100-2000 problems and GPU completes all 500 accounts in 109.5s where OSQP completes 4.