A smoothing majorization method for matrix minimization

DOI10.1080/10556788.2014.967235zbMath1328.90113OpenAlexW1991576414MaRDI QIDQ3458812

Jia Wu, Yue Lu, Li-wei Zhang

Publication date: 28 December 2015

Published in: Optimization Methods and Software (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/10556788.2014.967235

zbMATH Keywords

smoothing methodmajorization method\(l^2_2-l^p_p\) minimizationlow-rank problemlower bound analysis

Mathematics Subject Classification ID

Nonconvex programming, global optimization (90C26) Matrix completion problems (15A83)

Related Items

A global exact penalty for rank-constrained optimization problem and applications

Cites Work

• Unnamed Item
• Fixed point and Bregman iterative methods for matrix rank minimization
• Smoothing methods for nonsmooth, nonconvex minimization
• Enhancing sparsity by reweighted \(\ell _{1}\) minimization
• A dual algorithm for the solution of nonlinear variational problems via finite element approximation
• The geometry of graphs and some of its algorithmic applications
• Complexity of unconstrained \(L_2 - L_p\) minimization
• Twice Differentiable Spectral Functions
• Lower Bound Theory of Nonzero Entries in Solutions of $\ell_2$-$\ell_p$ Minimization
• A Singular Value Thresholding Algorithm for Matrix Completion
• Restricted isometry properties and nonconvex compressive sensing
• Iteratively reweighted least squares minimization for sparse recovery
• Derivatives of Spectral Functions