An Efficient Asymptotic DC Method for Sparse and Low-Rank Matrix Recovery
- 11 June 2025
- journal article
- research article
- Published by Springer Nature in Journal of Scientific Computing
- Vol. 104 (2) , 1-51
Abstract
No abstract availableKeywords
All Related Versions
Funding Information
- National Key R&D Program of China (2023YFA1011303, 2023YFA1011303)
- National Natural Science Foundation of China (12301479, 12371375)
- Tianchi Talent Program of Xinjiang Uygur Autonomous Regio
- Youth Talent Cultivation Program of Shihezi University (PYZK202402)
- Research Foundation for Talented Scholars of Shihezi University (RCZK202414)
This publication has 37 references indexed in Scilit:
- An Inexact Proximal DC Algorithm with Sieving Strategy for Rank Constrained Least Squares Semidefinite ProgrammingJournal of Scientific Computing, 2022
- A successive difference-of-convex approximation method for a class of nonconvex nonsmooth optimization problemsMathematical Programming, 2018
- Error bounds for rank constrained optimization problems and applicationsOperations Research Letters, 2016
- Global convergence of a proximal linearized algorithm for difference of convex functionsOptimization Letters, 2015
- Proximal alternating linearized minimization for nonconvex and nonsmooth problemsMathematical Programming, 2013
- Painless Reconstruction from Magnitudes of Frame CoefficientsJournal of Fourier Analysis and Applications, 2009
- On the convergence of the proximal algorithm for nonsmooth functions involving analytic featuresMathematical Programming, 2007
- A globally convergent Newton method for convex SC1 minimization problemsJournal of Optimization Theory and Applications, 1995
- Convex Analysis and Minimization Algorithms II1993
- Generalized Hessian matrix and second-order optimality conditions for problems withC 1,1 dataApplied Mathematics & Optimization, 1984