The minimum-rank Gram matrix completion via a fixed point continuation method

MaRDI QIDQ3110296zbMATH OpenFDO

Authors Yue Ma

Publication date 27 January 2012

zbMATH Keywords

Barzilai-Borwein techniqueconvergenceconvex relaxationfixed point iterative algorithmlow rank Gram matrixmatrix rank minimizationminimum-rank Gram matrix completionnuclear norm minimizationsemidefinite programmingsum of squares

Mathematics Subject Classification ID

Vector spaces, linear dependence, rank, lineability (15A03) Matrix completion problems (15A83) Numerical mathematical programming methods (65K05) Semidefinite programming (90C22)

Recommendations

• Fixed point and Bregman iterative methods for matrix rank minimization
• Rank optimization of a matrix via a splitting technique
• Convergence of fixed-point continuation algorithms for matrix rank minimization
• An accelerated proximal gradient algorithm for nuclear norm regularized linear least squares problems
• The minimum-rank Gram matrix completion via modified fixed point continuation method

Cited in

(5)

• Low-rank matrix completion using nuclear norm minimization and facial reduction
• Rank optimization of a matrix via a splitting technique
• The minimum-rank Gram matrix completion via modified fixed point continuation method
• Convergence of fixed-point continuation algorithms for matrix rank minimization
• Fixed point and Bregman iterative methods for matrix rank minimization

This page was built for publication: The minimum-rank Gram matrix completion via a fixed point continuation method

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