Sparse PCA, sparse regression, and sparse QCQP are three problems that share a structural property — they seek solutions with few nonzero entries — but are typically solved with different methods. Sparse PCA uses eigenvalue approaches, sparse regression uses LASSO-type penalties, QCQPs use various relaxation hierarchies.
Cifuentes and Li introduce a single geometric object — the spartrahedron, a convex cone — that captures sparsity at the matrix level. All three problems embed naturally into this cone, and a single semidefinite programming relaxation solves them. When the relaxation produces a rank-one solution, it certifies global optimality. When it doesn't, it provides approximation bounds.
The unification is not superficial. The spartrahedron characterizes “sparsity at the matrix level” — meaning the constraint that a matrix has few nonzero entries in its support is captured exactly as membership in a convex set, rather than approximately through penalization. The L1 norm penalizes magnitude to encourage sparsity. The spartrahedron constrains support directly.
The structural insight: three apparently different optimization problems are the same problem viewed from different angles. What looked like separate challenges with separate algorithms was a single geometric structure — a convex cone in matrix space — waiting to be identified. The cone was always there; the three problem communities just didn't know they were standing on the same object.
When a single mathematical object unifies multiple domains, the simplification is real. The approximation bounds, exactness conditions, and perturbation stability derived once for the spartrahedron apply automatically to all three problem families.