5 papers
Factorization-free Orthogonal Projection onto the Positive Semidefinite Cone with Composite Polynomial Filtering
Shucheng Kang, Haoyu Han, Antoine Groudiev +1
We propose a factorization-free method for orthogonal projection onto the positive semidefinite (PSD) cone, leveraging composite polynomial filtering. Inspired by recent advances i…
Local Linear Convergence of the Alternating Direction Method of Multipliers for Semidefinite Programming under Strict Complementarity
Shucheng Kang, Xin Jiang, Heng Yang
We investigate the local linear convergence properties of the Alternating Direction Method of Multipliers (ADMM) when applied to Semidefinite Programming (SDP). A longstanding beli…
Simplicial Regularizability of the Pseudo-Moment Cone and Carathéodory-Type Atomic Decomposition of Moment Matrices
Shucheng Kang, Heng Yang
We study the facial geometry of the homogeneous pseudo-moment cone \(Σ_{n,2d}^*\) and its implications for atomic decomposition of moment matrices. For fixed \(d \ge 2\), we show…
Local Second-Order Limit Dynamics of the Alternating Direction Method of Multipliers for Semidefinite Programming
Shucheng Kang, Heng Yang
The alternating direction method of multipliers (ADMM) is widely used for solving large-scale semidefinite programs (SDPs), yet on instances with multiple primal-dual optimal solut…
Global Contact-Rich Planning with Sparsity-Rich Semidefinite Relaxations
Shucheng Kang, Guorui Liu, Heng Yang
We show that contact-rich motion planning is also sparsity-rich when viewed as polynomial optimization (POP). We can exploit not only the correlative and term sparsity patterns tha…