A non-convex algorithm framework based on DC programming and DCA for matrix completion
Authors:
- 29 May 2014
- journal article
- Published by Springer Nature in Numerical Algorithms
- Vol. 68 (4) , 903-921
Abstract
No abstract availableKeywords
This publication has 31 references indexed in Scilit:
- A Singular Value Thresholding Algorithm for Matrix CompletionSIAM Journal on Optimization, 2010
- Sparsest solutions of underdetermined linear systems via -minimization forApplied and Computational Harmonic Analysis, 2009
- Exact Matrix Completion via Convex OptimizationFoundations of Computational Mathematics, 2009
- Semidefinite programming based algorithms for sensor network localizationACM Transactions on Sensor Networks, 2006
- Complexity of quantifier elimination in the theory of algebraically closed fields2005
- The DC (Difference of Convex Functions) Programming and DCA Revisited with DC Models of Real World Nonconvex Optimization ProblemsAnnals of Operations Research, 2005
- Recovering the missing components in a large noisy low-rank matrix: application to SFMIEEE Transactions on Pattern Analysis and Machine Intelligence, 2004
- Solving semidefinite-quadratic-linear programs using SDPT3Mathematical Programming, 2003
- Using SeDuMi 1.02, A Matlab toolbox for optimization over symmetric conesOptimization Methods and Software, 1999
- A D.C. Optimization Algorithm for Solving the Trust-Region SubproblemSIAM Journal on Optimization, 1998