55 citations · 214 across the 36 of their papers we have counts for
6 papers · 1 filter
Simpler flag optimization
Zehua Lai, Lek-Heng Lim, Ke Ye
We study the geometry of flag manifolds under different embeddings into a product of Grassmannians. We show that differential geometric objects and operations -- tangent vector, me…
Complex matrix inversion via real matrix inversions
Zhen Dai, Lek-Heng Lim, Ke Ye
We study the inversion analog of the well-known Gauss algorithm for multiplying complex matrices. A simple version is $(A + iB)^{-1} = (A + BA^{-1}B)^{-1} - i A^{-1}B(A+BA^{-1} B)^…
Sparse sum of Hermitian squares in group algebras of finite groups
Jianting Yang, Ke Ye, Lihong Zhi
Nonnegative elements in group algebras play a central role in harmonic analysis, operator algebras, and computational optimization. This paper investigates sparse sum-of-Hermitian-…
Skew-sparse matrix multiplication
Qiao-Long Huang, Ke Ye, Xiao-Shan Gao
Based on the observation that is isomorphic to a quotient skew polynomial ring, we propose a new method for matrix multiplicat…
When geometry meets optimization theory: partially orthogonal tensors
Ke Ye, Shenglong Hu
Due to the multi-linearity of tensors, most algorithms for tensor optimization problems are designed based on the block coordinate descent method. Such algorithms are widely employ…
Computing sparse Fourier sum of squares on finite abelian groups in quasi-linear time
Jianting Yang, Ke Ye, Lihong Zhi
The problem of verifying the nonnegativity of a function on a finite abelian group is a long-standing challenging problem. The basic theory of representation theory of finite group…