arXiv cs.LG
· Papers
Optimization on the Oblique Manifold for Sparse Simplex Constraints via Multiplicative Updates
arXiv:2503.24075v4 Announce Type: replace-cross Abstract: Low-rank optimization problems with sparse simplex constraints involve variables that must satisfy nonnegativity, sparsity, and sum-to-1 conditions, making their optimization particularly challenging due to the interplay between low-rank structures and constrain