13 citations · 44 across the 26 of their papers we have counts for
27 papers
A Curved-Path Refinement of the Kalai--Kleitman Diameter Bound
Tianhao Liu, Dongdong Ge, Yinyu Ye
Let be the maximum graph diameter of a pointed -dimensional polyhedron with facets. Using a curved-path encoding of the iterated Kalai--Kleitman recurrence, we pr…
Beyond Regret: Decoupling Learning and Decision-making in Online Linear Programming
Wenzhi Gao, Dongdong Ge, Chenyu Xue +2
Online linear programming plays an important role in both revenue management and resource allocation, and recent research has focused on developing efficient first-order online lea…
A Robust Anchor-based Method for Multi-Camera Pedestrian Localization
Wanyu Zhang, Jiaqi Zhang, Dongdong Ge +4
This paper addresses the problem of vision-based pedestrian localization, which estimates a pedestrian's location using images and camera parameters. In practice, however, calibrat…
Accelerating Low-Rank Factorization-Based Semidefinite Programming Algorithms on GPU
Qiushi Han, Zhenwei Lin, Hanwen Liu +4
In this paper, we address a long-standing challenge: how to achieve both efficiency and scalability in solving semidefinite programming problems. We propose breakthrough accelerati…
Restarted Primal-Dual Hybrid Conjugate Gradient Method for Large-Scale Quadratic Programming
Yicheng Huang, Wanyu Zhang, Hongpei Li +3
Convex quadratic programming (QP) is an essential class of optimization problems with broad applications across various fields. Traditional QP solvers, typically based on simplex o…
A Low-Rank ADMM Splitting Approach for Semidefinite Programming
Qiushi Han, Chenxi Li, Zhenwei Lin +5
We introduce a new first-order method for solving general semidefinite programming problems, based on the alternating direction method of multipliers (ADMM) and a matrix-splitting…