A new algorithm for positive semidefinite matrix completion

DOI10.1155/2016/1659019MaRDI QIDQ670219zbMATH OpenOpenAlexDBLPWikidataFDO

Authors Peng Pan, Fang Fang Xu

Publication date 18 March 2019

Published in Journal of Applied Mathematics (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1155/2016/1659019

Mathematics Subject Classification ID

Convex programming (90C25) Matrix completion problems (15A83) Positive matrices and their generalizations; cones of matrices (15B48) Numerical methods for low-rank matrix approximation; matrix compression (65F55)

Recommendations

• Fast implementation for semidefinite programs with positive matrix completion
• Algorithms for positive semidefinite factorization
• Complexity of the positive semidefinite matrix completion problem with a rank constraint
• Exploiting sparsity in linear and nonlinear matrix inequalities via positive semidefinite matrix completion
• A semidefinite algorithm for completely positive tensor decomposition
• The complexity of positive semidefinite matrix factorization
• A connection between positive semidefinite and Euclidean distance matrix completion problems
• The positive \(Q\)-matrix completion problem
• A semidefinite relaxation algorithm for checking completely positive separable matrices
• A new graph parameter related to bounded rank positive semidefinite matrix completions

Cites work

• scientific article; zbMATH DE number 3833218 (Why is no real title available?)
• scientific article; zbMATH DE number 6508500 (Why is no real title available?)
• scientific article; zbMATH DE number 45081 (Why is no real title available?)
• A Singular Value Thresholding Algorithm for Matrix Completion
• A monotone+skew splitting model for composite monotone inclusions in duality
• Alternating direction augmented Lagrangian methods for semidefinite programming
• Alternating direction method with self-adaptive penalty parameters for monotone variational inequalities
• An accelerated proximal gradient algorithm for nuclear norm regularized linear least squares problems
• An alternating direction algorithm for matrix completion with nonnegative factors
• Exact matrix completion via convex optimization
• Fixed point and Bregman iterative methods for matrix rank minimization
• Guaranteed minimum-rank solutions of linear matrix equations via nuclear norm minimization
• Linearized alternating direction method of multipliers with Gaussian back substitution for separable convex programming
• Matrix completion via an alternating direction method
• Solving a low-rank factorization model for matrix completion by a nonlinear successive over-relaxation algorithm
• The Power of Convex Relaxation: Near-Optimal Matrix Completion

Cited in

(7)

• Positive semidefinite matrix completion, universal rigidity and the strong Arnold property
• scientific article; zbMATH DE number 1265013 (Why is no real title available?)
• The positive \(Q\)-matrix completion problem
• A modified method based on the augmented Lagrange multiplier method for the real symmetric positive semidefinite matrix recovery
• A decomposition method for positive semidefinite matrices and its application to recursive parameter estimation
• Half thresholding eigenvalue algorithm for semidefinite matrix completion
• Sparse quasi-Newton updates with positive definite matrix completion

This page was built for publication: A new algorithm for positive semidefinite matrix completion

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q670219)