Abstract
A real n × n symmetric matrix P is partially positive (PP) for a given index set I ⊆ {1, ..., n} if there exists a matrix V such that V (I,:) ⩾ 0 and P = V V T. We give a characterization of PP-matrices. A semidefinite algorithm is presented for checking whether a matrix is partially positive or not. Its properties are studied. A PP-decomposition of a matrix can also be obtained if it is partially positive.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Berman A, Shaked-Monderer N. Completely Positive Matrices. Singapore: World Scientific, 2003
Bomze IM, Dür M, de Klerk E, et al. On copositive programming and standard quadratic optimization problems. J Global Optim, 2000, 18: 301–320
Curto R, Fialkow L. Truncated K-moment problems in several variables. J Operator Theory, 2005, 54: 189–226
Dickinson P J, Gijben L. On the computational complexity of membership problems for the completely positive cone and its dual. Comput Optim Appl, 2014, 57: 403–415
Golub G H, Van Loan C F. Matrix Computations, 3rd ed. Baltimore, MD: The Johns Hopkins University Press, 1996
Gowda M. S, Sznajder R, Tao J. The automorphism group of a completely positive cone and its Lie algebra. Linear Algebra Appl, 2013, 438: 3862–3871
Fialkow L, Nie J. The truncated moment problem via homogenization and flat extensions. J Funct Anal, 2012, 263: 1682–1700
Helton J W, Nie J. A semidefinite approach for truncated K-moment problems. Found Comput Math, 2012, 12: 851–881
Henrion D, Lasserre J. Detecting global optimality and extracting solutions in GloptiPoly. Lect Notes Control Inform Sci, 2005, 312: 293–310
Henrion D, Lasserre J, Löfberg J. GloptiPoly 3: Moments, optimization and semidefinite programming. Optim Methods Softw, 2009, 24: 761–779
Huang Y, Zhang S. Approximation algorithms for indefinite complex quadratic maximization problems. Sci China Math, 2010, 53: 2697–2708
Lasserre J B. Moments, Positive Polynomials and Their Applications. London: Imperial College Press, 2009
Nie J. Certifying convergence of Lasserre’s hierarchy via flat truncation. Math Program Ser A, 2013, 142: 485–510
Nie J. The A-truncated K-moment problem. Found Comput Math, 2014, 14: 1243–1276
Nie J. Optimality conditions and finite convergence of Lasserre’s hierarchy. Math Program Ser A, 2014, 146: 97–121
Nie J. Linear optimization with cones of moments and nonnegative polynomials. Math Program Ser B, doi: 10.1007/s10107-014-0797-6, 2014
Sturm J F. SeDuMi 1.02: A MATLAB toolbox for optimization over symmetric cones. Optim Methods Softw, 1999, 11: 625–653
Xia Y. New semidefinite programming relaxations for box constrained quadratic program. Sci China Math, 2013, 56: 877–886
Zhou A, Fan J. The CP-matrix completion problem. SIAM J Matrix Anal Appl, 2014, 35: 127–142
Zhou A, Fan J. Interiors of completely positive cones. ArXiv:1401.1255, 2014
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Zhou, A., Fan, J. Partially positive matrices. Sci. China Math. 58, 1–10 (2015). https://doi.org/10.1007/s11425-014-4959-z
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s11425-014-4959-z
Keywords
- partially positive matrices
- completely positive matrices
- A-truncated K-moment problem, semidefinite algorithm