1 citations · 1 across the 1 of their papers we have counts for
4 papers
Efficient -Laplacian Solvers for Well-Shaped Simplicial Complexes: Beyond Betti Numbers and Collapsing Sequences
Ming Ding, Peng Zhang
We present efficient algorithms for approximately solving systems of linear equations in -Laplacians of well-shaped simplicial complexes up to high precision. -Laplacians, or…
Hardness Results for Laplacians of Simplicial Complexes via Sparse-Linear Equation Complete Gadgets
Ming Ding, Rasmus Kyng, Maximilian Probst Gutenberg +1
We study linear equations in combinatorial Laplacians of -dimensional simplicial complexes (-complexes), a natural generalization of graph Laplacians. Combinatorial Laplacian…
Two-Commodity Flow is Equivalent to Linear Programming under Nearly-Linear Time Reductions
Ming Ding, Rasmus Kyng, Peng Zhang
We give a nearly-linear time reduction that encodes any linear program as a 2-commodity flow problem with only a small blow-up in size. Under mild assumptions similar to those empl…
An inexact proximal DC algorithm with sieving strategy for rank constrained least squares semidefinite programming
Mingcai Ding, Xiaoliang Song, Bo Yu
In this paper, the optimization problem of the supervised distance preserving projection (SDPP) for data dimension reduction (DR) is considered, which is equivalent to a rank const…