A new algorithm for positive semidefinite matrix completion

DOI10.1155/2016/1659019zbMath1435.65069DBLPjournals/jam/XuP16OpenAlexW2533173761WikidataQ59125175 ScholiaQ59125175MaRDI QIDQ670219

Peng Pan, Fang Fang Xu

Publication date: 18 March 2019

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

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

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Fixed point and Bregman iterative methods for matrix rank minimization
• Alternating direction augmented Lagrangian methods for semidefinite programming
• An alternating direction algorithm for matrix completion with nonnegative factors
• Alternating direction method with self-adaptive penalty parameters for monotone variational inequalities
• Solving a low-rank factorization model for matrix completion by a nonlinear successive over-relaxation algorithm
• Linearized alternating direction method of multipliers with Gaussian back substitution for separable convex programming
• Exact matrix completion via convex optimization
• A Singular Value Thresholding Algorithm for Matrix Completion
• Matrix completion via an alternating direction method
• A Monotone+Skew Splitting Model for Composite Monotone Inclusions in Duality
• Guaranteed Minimum-Rank Solutions of Linear Matrix Equations via Nuclear Norm Minimization
• The Power of Convex Relaxation: Near-Optimal Matrix Completion

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