Copositive matrices with nondecreasing off-diagonal entries admit a PSD plus nonnegative decomposition, which implies exactness of a natural relaxation for separable quadratic optimization over the simplex.
New understandings and computation on augmented lagrangian methods for low-rank semidefinite programming
3 Pith papers cite this work. Polarity classification is still indexing.
3
Pith papers citing it
fields
math.OC 3years
2026 3verdicts
UNVERDICTED 3representative citing papers
DSPDHG extends PDHG and SPDHG with doubly stochastic block updates and proves O(1/K) ergodic convergence for the expected restricted primal-dual gap plus linear convergence for a restarted variant under quadratic growth.
D-PDLP is the first distributed multi-GPU framework for PDLP that uses 2D grid partitioning of the constraint matrix plus nonzero-aware and random-permutation strategies to scale PDHG iterations with low overhead and full FP64 accuracy.
citing papers explorer
-
Copositive Matrices with Ordered Off-Diagonal Entries
Copositive matrices with nondecreasing off-diagonal entries admit a PSD plus nonnegative decomposition, which implies exactness of a natural relaxation for separable quadratic optimization over the simplex.
-
On the convergence of doubly stochastic Primal-Dual Hybrid Gradient Method
DSPDHG extends PDHG and SPDHG with doubly stochastic block updates and proves O(1/K) ergodic convergence for the expected restricted primal-dual gap plus linear convergence for a restarted variant under quadratic growth.
-
D-PDLP: Scaling PDLP to Distributed Multi-GPU Systems
D-PDLP is the first distributed multi-GPU framework for PDLP that uses 2D grid partitioning of the constraint matrix plus nonzero-aware and random-permutation strategies to scale PDHG iterations with low overhead and full FP64 accuracy.