Abstract
In this paper, we consider the problem of computing the distance between the linear matrix pencil and the completely positive cone. We formulate it as a linear optimization problem with the cone of moments and the second order cone. A semidefinite relaxation algorithm is presented and the convergence is studied. We also propose a new model for checking the membership in the completely positive cone.
Similar content being viewed by others
References
Ben-Tal, A., Nemirovski, A.: Lectures on Modern Convex Optimization: Analysis, Algorithms, and Engineering Applications. MPS-SIAM Series on Optimization. SIAM, Philadelphia (2001)
Berman, A., Shaked-Monderer, N.: Completely Positive Matrices. World Scientific, Singapore (2003)
Bomze, I.M., de Klerk, E.: Solving standard quadratic optimization problems via linear, semidefinite and copositive programming. J. Global Optim. 24, 163–185 (2002)
Bomze, I.M.: Copositive optimization-recent developments and applications. Eur. J. Oper. Res. 216, 509–520 (2012)
Burer, S.: On the copositive representation of binary and continuous nonconvex quadratic programs. Math. Program. Ser. A 120, 479–495 (2009)
Curto, R., Fialkow, L.: Truncated K-moment problems in several variables. J. Oper. Theory 54, 189–226 (2005)
de Klerk, E., Pasechnik, D.V.: Approximation of the stability number of a graph via copositive programming. SIAM J. Optim. 12, 875–892 (2002)
Dickinson, P.J.: The copositive cone, the completely positive cone and their generalisations. PhD thesis, Aniversity of Groningen, Groningen, The Netherlands (2013)
Dickinson, P.J., Gijben, L.: On the computational complexity of membership problems for the completely positive cone and its dual. Comput. Optim. Appl. 57, 403–415 (2014)
Dür, M.: Copositive programming—a survey. In: Diehl, M., Glineur, F., Jarlebring, E., Michiels, W. (eds.) Recent Advances in Optimization and Its Applications in Engineering, pp. 3–20. Springer, Berlin (2010)
Gvozdenović, N., Laurent, M.: Semidefinite bounds for the stability number of a graph via sums of squares of polynomials. Math. Program. Ser. B 110, 145–173 (2007)
Fialkow, L., Nie, J.: The truncated moment problem via homogenization and flat extensions. J. Funct. Anal. 263, 1682–1700 (2012)
Helton, J.W., Nie, J.: A semidefinite approach for truncated K-moment problems. Found. Comput. Math. 12, 851–881 (2012)
Henrion, D., Lasserre, J.: Detecting Global Optimality and Extracting Solutions in GloptiPoly, Positive Polynomials in Control. Lecture Notes in Control and Information Science, pp. 293–310. Springer, Berlin (2005)
Henrion, D., Lasserre, J., Loefberg, J.: GloptiPoly 3: moments, optimization and semidefinite programming. Optim. Methods Softw. 24, 761–779 (2009)
Lasserre, J.B.: Moments, Positive Polynomials and Their Applications. Imperial College Press, London (2009)
Lasserre, J.B.: New approximations for the cone of copositive matrices and its dual. Math. Program. Ser. A 144, 265–276 (2014)
Laurent, M.: Sums of Squares, Moment Matrices and Optimization Over Polynomials, Emerging Applications of Algebraic Geometry. IMA Volumes in Mathematics and Its Applications, vol. 149, pp. 157–270. Springer, New York (2009)
Murty, K.G., Kabadi, S.N.: Some NP-complete problems in quadratic and nonlinear programming. Math. Program. 39, 117–129 (1987)
Nie, J., Schweighofer, M.: On the complexity of Putinar’s Positivstellensatz. J. Complex. 23, 135–150 (2007)
Nie, J.: The \(A\)-truncated K-moment problem. Found. Comput. Math. 14, 1243–1276 (2014)
Nie, J.: Linear optimization with cones of moments and nonnegative polynomials. Math. Program. Ser. B 153, 247–274 (2015)
Nie, J.: Optimality conditions and finite convergence of Lasserre’s hierarchy. Math. Program. Ser. A 146, 97–121 (2014)
Nie, J., Ranestad, K.: Algebraic degree of polynomial optimization. SIAM J. Optim. 20, 485–502 (2009)
Papachristodoulou, A., Anderson, J., Valmorbida, G., Prajna, S., Seiler, P., Parrilo, P.A.: SOSTOOLS: sum of squares optimization toolbox for MATLAB (2013). Available from http://www.eng.ox.ac.uk/control/sostools
Parrilo, P. A.: Structured semidefinite programs and semialgebraic geometry methods in robustness and optimization. Ph.D. Dissertation, California Institute of Technology (2000)
Peña, J., Vera, J., Zuluaga, L.: Computing the stability number of a graph via linear and semidenite programming. SIAM J. Optim. 18, 87–105 (2007)
Putinar, M.: Positive polynomials on compact semi-algebraic sets. Ind. Aniv. Math. J. 42, 969–984 (1993)
Putinar, M., Vasilescu, F.-H.: Positive polynomials on semialgebraic sets. C. R. Acad. Sci. Ser. I 328, 585–589 (1999)
Shapiro, A., Scheinberg, K.: Duality and optimality conditions. In: Wolkowicz, H., Saigal, R., Vandenberghe, L. (eds.) Handbook of Semidefinite Programming, vol. 27, pp. 67–110. Springer, New York (2000)
Sturm, J.F.: SeDuMi 1.02: a MATLAB toolbox for optimization over symmetric cones. Optim. Methods Softw. 11 & 12, 625–653 (1999)
Zhou, A., Fan, J.: Interiors of completely positive cones. J. Global Optim. 63, 653–675 (2015)
Acknowledgments
The first author is partially supported by NSFC 11171217 and 11571234.
Author information
Authors and Affiliations
Corresponding author
Appendix: Proof of Theorem 3.2
Appendix: Proof of Theorem 3.2
Proof
(i) Let \((p^0,z^0)\) be a relative interior point of (D). Then
\(\Vert z^0\Vert <1\), and \(p^0(x) > 0\) on \(\Delta \) due to [22, Lemma 3.1]. Since \(\Delta \) is compact, there exist \(\epsilon _0 > 0\) and \(\delta > 0\) such that
By Nie [20, Theorem 6], there exists \(k_0 > 0\) such that
Thus, (\(D^k\)) has a relative interior point for all \(k \ge k_0\). So, the strong duality holds between (\(P^k\)) and (\(D^k\)). Since (P) is feasible, the relaxation (\(P^k\)) is also feasible, and it has a minimizer \(({\mathbf {x}}^{*,k}, w^{*,k}, y^{*,k}, \gamma ^{*,k},{\tilde{\mathbf {x}}}^{*,k})\) (cf. [1, Theorem 2.4.I]).
(ii) Firstly, we prove that the sequence \(\{({\mathbf {x}}^{*,k}, w^{*,k}, y^{*,k}, \gamma ^{*,k})\}\) is bounded. Since (\(P^k\)) is feasible and \((w^{*,k}, \gamma ^{*,k})\in {\mathcal {L}}_{{\bar{n}}+1}\), we have that \(\{(w^{*,k}, \gamma ^{*,k})\}\) is bounded. Note that \(A_i (i=1, \ldots , m)\) are linearly independent and \(({\mathbf {x}}^{*,k}, w^{*,k}, y^{*,k})\) satisfies
we know that \(\{y^{*,k}\}\) is bounded if \(\{{\mathbf {x}}^{*,k}\}\) is bounded. Thus, it suffices to prove that \(\{{\mathbf {x}}^{*,k}\}\) is bounded.
Let \((p^0,z^0)\) and \(\epsilon _0\) be as in the proof of (i). Because \(I_{2k_0} (h) + Q_{k_0} (g)\) is dual to \(\Gamma _{k_0}\), for all \(k \ge k_0\), we have
It follows from \(\langle z^0, w^{*,k}\rangle +\langle 1, \gamma ^{*,k}\rangle \ge 0\), \(\gamma ^{*,k}\le \vartheta _P\), (6.1) and (6.2) that
Denote by \({\mathbf {0}}\) the zero vector in \({\mathbb {N}}^n\). By (6.3), we obtain
i.e.,
For \(\Delta \) given in (2.10), since \(I (h) + Q(g)\) is archimedean, there exist \(\varrho >0\) and \(k_1 \in {\mathbb {N}}\) such that
So, for all \(k \ge k_1\), we have
which, together with (6.5), gives
Note that for each \(t = 1, \ldots , k -k_1\), we have
The membership \({\tilde{\mathbf {x}}}^{*,k}\in \Gamma _{k}\) implies that
Combining (6.6) and (6.7), we obtain
Let \({\mathbf {x}}^k := {\tilde{\mathbf {x}}}^{*,k}|_{2k-2k_1}\). Then the moment matrix \(M_{k-k_1} ({\mathbf {x}}^k) \succeq 0\) and
Since
we have
Fix \(k_2 > k_1\) such that \({\mathbf {x}}^{*,k}\) is a subvector of \({\mathbf {x}}^k|_{k_2-k_1}\). It follows from \({\mathbf {x}}^{*,k} = {\mathbf {x}}^k|_{{\mathcal {E}}}\) that
The above inequality shows that \(\{{\mathbf {x}}^{*,k}\}\) is bounded. Therefore, \(\{({\mathbf {x}}^{*,k}, w^{*,k}, y^{*,k}, \gamma ^{*,k})\}\) is bounded.
Secondly, we prove that every accumulation point of \(\{({\mathbf {x}}^{*,k}, w^{*,k}, y^{*,k}, \gamma ^{*,k})\}\) is a minimizer of (P). Without loss of generality, we assume \(({\mathbf {x}}^{*,k}, w^{*,k}, y^{*,k}, \gamma ^{*,k})\rightarrow ({\mathbf {x}}^{*}, w^{*}, y^{*}, \gamma ^{*})\) as \(k\rightarrow +\infty \). We first show that \({\mathbf {x}}^*\in {\mathcal {R}}\). Note that \(\Delta \) is compact. Up to a scaling, we can assume \(\Delta \subseteq B(0, \varrho )\) with \(\varrho < 1\). By (6.8), we have
which implies that \(\{{\mathbf {x}}^{k}\}\) is bounded. By adding zero entries to the tailing, each tms \({\mathbf {x}}^k\) can be extended to a vector in \({\mathbb {R}}^{{\mathbb {N}}^n_{\infty }}\), which is a Hilbert space equipped with the inner product
So, \(\{{\mathbf {x}}^{k}\}\) is also bounded in \({\mathbb {R}}^{{\mathbb {N}}^n_{\infty }}\). By Alaoglu’s Theorem (cf. [16, Theorem C.18]), there exist a subsequence \(\{{\mathbf {x}}^{k_j}\}\) that is convergent in the weak-\(*\) topology, i.e., there exists \({\bar{\mathbf {x}}}^* \in {\mathbb {R}}^{{\mathbb {N}}^n_{\infty }}\) such that
for all \(f\in {\mathbb {R}}^{{\mathbb {N}}^n_{\infty }}\). So, for each \(\alpha \in {\mathbb {N}}^n\),
Since \({\mathbf {x}}^k|_{{\mathcal {E}}} = {\mathbf {x}}^{*,k} \rightarrow {\mathbf {x}}^{*}\), we have \({\bar{\mathbf {x}}}^{*}|_{{\mathcal {E}}} = {\mathbf {x}}^*\). By the feasibility of \({\tilde{\mathbf {x}}}^{*,k_j}\) and the definition of \({\mathbf {x}}^{k_j}\), it is easy to check that \({\bar{\mathbf {x}}}^{*}\in {\mathbb {R}}^{{\mathbb {N}}^n_{\infty }}\) is a full moment sequence whose localizing matrices of all orders are positive semidefinite. Thus, \({\bar{\mathbf {x}}}^*\) admits a \(\Delta \)-measure (cf. [28, Lemma 3.2]). This implies that \({\mathbf {x}}^*={\bar{\mathbf {x}}}^{*}|_{{\mathcal {E}}}\in {\mathcal {R}}\).
Since \(({\mathbf {x}}^{*,k}, w^{*,k}, y^{*,k}, \gamma ^{*,k})\) satisfies (6.2) and \((w^{*,k},\gamma ^{*,k}) \in {\mathcal {L}}_{{\bar{n}}+1}\), we know that \(({\mathbf {x}}^{*}, w^{*}, y^{*}, \gamma ^{*})\) satisfies
In view of \({\mathbf {x}}^*\in {\mathcal {R}}\), we see that \(({\mathbf {x}}^{*}, w^{*}, y^{*}, \gamma ^{*})\) is feasible for (P) and \(\vartheta _P \le \gamma ^{*}\). Because (\(P^k\)) is a relaxation of (P) and \(({\mathbf {x}}^{*,k}, w^{*,k}, y^{*,k}, \gamma ^{*,k})\) is a minimizer of (\(P^k\)), it holds that
Hence, we get
Therefore, \(\vartheta _P= \gamma ^{*}\) and \(({\mathbf {x}}^{*}, w^{*}, y^{*}, \gamma ^{*})\) is a minimizer of (P). Since \(\{\gamma ^{*,k}\}\) is monotonically increasing, it converges to the minimum of (1.4). \(\square \)
Rights and permissions
About this article
Cite this article
Fan, J., Zhou, A. Computing the distance between the linear matrix pencil and the completely positive cone. Comput Optim Appl 64, 647–670 (2016). https://doi.org/10.1007/s10589-016-9825-1
Received:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10589-016-9825-1
Keywords
- Completely positive matrices
- CP projection
- Linear matrix pencil
- Linear optimization with moments
- Semidefinite algorithm