\(S_{1/2}\) regularization methods and fixed point algorithms for affine rank minimization problems

DOI10.1007/s10589-017-9898-5zbMath1400.90223OpenAlexW2588599464MaRDI QIDQ2364127

Nai-Hua Xiu, Ding-Tao Peng, Jian Yu

Publication date: 18 July 2017

Published in: Computational Optimization and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10589-017-9898-5

zbMATH Keywords

matrix completion problemfixed point algorithmaffine rank minimization problem\(S_{1/2}\) regularization problemsingular value half thresholding operator

Mathematics Subject Classification ID

Ill-posedness and regularization problems in numerical linear algebra (65F22) Large-scale problems in mathematical programming (90C06) Nonconvex programming, global optimization (90C26) Approximation methods and heuristics in mathematical programming (90C59)

Related Items

Iterative thresholding algorithm based on non-convex method for modified \(l_p\)-norm regularization minimization ⋮ On phaseless compressed sensing with partially known support ⋮ Accelerated matrix completion algorithm using continuation strategy and randomized SVD ⋮ A singular value shrinkage thresholding algorithm for folded concave penalized low-rank matrix optimization problems ⋮ Robust Euclidean embedding via EDM optimization ⋮ A half thresholding projection algorithm for sparse solutions of LCPs ⋮ Sparse principal component analysis via fractional function regularity

Uses Software

• SDPT3
• RTRMC

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Solving semidefinite-quadratic-linear programs using SDPT3
• An implementable proximal point algorithmic framework for nuclear norm minimization
• Fixed point and Bregman iterative methods for matrix rank minimization
• Estimation of high-dimensional low-rank matrices
• Least angle regression. (With discussion)
• Solving a low-rank factorization model for matrix completion by a nonlinear successive over-relaxation algorithm
• Trust-region methods on Riemannian manifolds
• Complexity of unconstrained \(L_2 - L_p\) minimization
• An introduction to a class of matrix cone programming
• Exact matrix completion via convex optimization
• Improved Iteratively Reweighted Least Squares for Unconstrained Smoothed $\ell_q$ Minimization
• Worst-Case Complexity of Smoothing Quadratic Regularization Methods for Non-Lipschitzian Optimization
• Penalty decomposition methods for rank minimization
• Recovering Low-Rank and Sparse Components of Matrices from Incomplete and Noisy Observations
• Lower Bound Theory of Nonzero Entries in Solutions of $\ell_2$-$\ell_p$ Minimization
• A Singular Value Thresholding Algorithm for Matrix Completion
• Fixed-Point Continuation for $\ell_1$-Minimization: Methodology and Convergence
• Restricted isometry properties and nonconvex compressive sensing
• Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency information
• Interior-Point Method for Nuclear Norm Approximation with Application to System Identification
• Guaranteed Minimum-Rank Solutions of Linear Matrix Equations via Nuclear Norm Minimization
• Monotone Operators and the Proximal Point Algorithm
• The Power of Convex Relaxation: Near-Optimal Matrix Completion
• Fast Monte Carlo Algorithms for Matrices II: Computing a Low-Rank Approximation to a Matrix
• Compressed sensing