Sparse Copositive Polynomial Optimization
Optimization and Control
2026-04-02 v1
Abstract
This paper studies the copositive optimization problem whose objective is a sparse polynomial, with linear constraints over the nonnegative orthant. We propose sparse Moment-SOS relaxations to solve it. Necessary and sufficient conditions are shown for these relaxations to be tight. In particular, we prove they are tight under the cop-SOS convexity assumption. Compared to the traditional dense ones, the sparse Moment-SOS relaxations are more computationally efficient. Numerical experiments are given to show the efficiency.
Cite
@article{arxiv.2604.00180,
title = {Sparse Copositive Polynomial Optimization},
author = {Suhan Zhong and Jinling Zhou and Jiawang Nie and Xindong Tang},
journal= {arXiv preprint arXiv:2604.00180},
year = {2026}
}
Comments
21 pages