Completely positive factorization by a Riemannian smoothing method

• Published in: Computational optimization and applications 2022-12, Vol.83 (3), p.933-966
• Main Authors: Lai, Zhijian, Yoshise, Akiko
• Format: Article
• Language: English
• Subjects: Combinatorial analysis; Convex and Discrete Geometry; Factorization; Linear functions; Management Science; Mathematical analysis; Mathematics; Mathematics and Statistics; Matrices (mathematics); Operations Research; Operations Research/Decision Theory; Optimization; Riemann manifold; Smoothing; Statistics
• ISSN: 0926-6003; 1573-2894
• DOI: 10.1007/s10589-022-00417-4

Copositive optimization is a special case of convex conic programming, and it consists of optimizing a linear function over the cone of all completely positive matrices under linear constraints. Copositive optimization provides powerful relaxations of NP-hard quadratic problems or combinatorial problems, but there are still many open problems regarding copositive or completely positive matrices. In this paper, we focus on one such problem; finding a completely positive (CP) factorization for a given completely positive matrix. We treat it as a nonsmooth Riemannian optimization problem, i.e., a minimization problem of a nonsmooth function over a Riemannian manifold. To solve this problem, we present a general smoothing framework for solving nonsmooth Riemannian optimization problems and show convergence to a stationary point of the original problem. An advantage is that we can implement it quickly with minimal effort by directly using the existing standard smooth Riemannian solvers, such as Manopt. Numerical experiments show the efficiency of our method especially for large-scale CP factorizations.