arXiv stat.ML
· Papers
A Support-Set Algorithm for Optimization Problems with Nonnegative and Orthogonal Constraints
arXiv:2511.03443v2 Announce Type: replace-cross Abstract: In this paper, we investigate optimization problems with nonnegative and orthogonal constraints, where any feasible matrix of size $n times p$ exhibits a sparsity pattern such that each row accommodates at most one nonzero entry. Our analysis demonstrates that,