Chunyan Wang

In this paper, we propose an efficient numerical approach for solving a specific type of quartic inhomogeneous polynomial optimization problem inspired by practical applications. The primary contribution of this work lies in establishing an inherent equivalence between the quartic inhomogeneous polynomial optimization problem and a multilinear optimization problem (MOP). This result extends the equivalence between fourth-order homogeneous polynomial optimization and multilinear optimization in the existing literature to the equivalence between fourth-order inhomogeneous polynomial optimization and multilinear optimization. By leveraging the multi-block structure embedded within the MOP, a tensor-based proximal alternating minimization algorithm is proposed to approximate the optimal value of the quartic problem. Under mild assumptions, the convergence of the algorithm is rigorously proven. Finally, the effectiveness of the proposed algorithm is demonstrated through preliminary computational results obtained using synthetic datasets.

In this paper, we consider the copositive optimization problem with high-order copositive tensors, which can be used to estimate the coclique number of uniform hypergraphs. Firstly, we present a checkable equivalent condition for the Slater constraint qualification. Then, based on the standard simplex, we focus on solving a new kind of CTOP from hypergraph theory. To do that, two approximation problems are established and a linear approximation algorithm is proposed for the original CTOP. It is proven that the optimal value of the original problem lies between the optimal values of the two approximation problems. Furthermore, relationships between the optimal solutions are considered. Finally, the proposed algorithm is applied to estimate the coclique number of uniform hypergraphs, and numerical results show its efficiency.