Copositive matrices with nondecreasing off-diagonal entries admit a PSD plus nonnegative decomposition, which implies exactness of a natural relaxation for separable quadratic optimization over the simplex.
Polynomialsystems,homotopycontinuation,andapplications
3 Pith papers cite this work. Polarity classification is still indexing.
3
Pith papers citing it
verdicts
UNVERDICTED 3representative citing papers
Algebraic characterization of runtime pgfs for GCP programs via kernel polynomial roots yields dominant singularities and exact asymptotics for single-state cases.
An algebraic approach defines semi-algebraic parameter sets from underlying polynomial structures in evolutionary processes before likelihood maximization, showing compatibility with existing statistical EvAM models while adding parameter-space information.
citing papers explorer
-
Copositive Matrices with Ordered Off-Diagonal Entries
Copositive matrices with nondecreasing off-diagonal entries admit a PSD plus nonnegative decomposition, which implies exactness of a natural relaxation for separable quadratic optimization over the simplex.
-
On the algebraic analysis of runtime distribution of probabilistic programs
Algebraic characterization of runtime pgfs for GCP programs via kernel polynomial roots yields dominant singularities and exact asymptotics for single-state cases.
-
An Algebraic Approach to Evolutionary Accumulation Models
An algebraic approach defines semi-algebraic parameter sets from underlying polynomial structures in evolutionary processes before likelihood maximization, showing compatibility with existing statistical EvAM models while adding parameter-space information.