Comonotonicity of the feasible region makes fixed-rank convex maximization polynomially solvable through a unified enumerative framework that recovers known results for matroid maximization and SPCA.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.OC 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
A Geometric Perspective on Polynomially Solvable Convex Maximization
Comonotonicity of the feasible region makes fixed-rank convex maximization polynomially solvable through a unified enumerative framework that recovers known results for matroid maximization and SPCA.