A customized inertial proximal alternating minimization for SVD-free robust principal component analysis

DOI10.1080/02331934.2023.2230975zbMATH Open1548.65142MaRDI QIDQ6606306

Author name not available (Why is that?), Wenxing Zhang, Deren Han

Publication date: 16 September 2024

Published in: Optimization (Search for Journal in Brave)

Nonconvex programming, global optimization (90C26) Numerical optimization and variational techniques (65K10) Computing methodologies for image processing (68U10)

Cites Work

Title not available (Why is that?)
Title not available (Why is that?)
Distributed Optimization and Statistical Learning via the Alternating Direction Method of Multipliers
Nearly unbiased variable selection under minimax concave penalty
Proximal alternating linearized minimization for nonconvex and nonsmooth problems
Enhancing sparsity by reweighted $\ell _{1}$ minimization
Introductory lectures on convex optimization. A basic course.
A survey on some recent developments of alternating direction method of multipliers
The developments of proximal point algorithms
Handbook of robust low-rank and sparse matrix decomposition. Applications in image and video processing
A low patch-rank interpretation of texture
Analysis of multi-stage convex relaxation for sparse regularization
Recovering Low-Rank and Sparse Components of Matrices from Incomplete and Noisy Observations
Robust principal component analysis?
Rank-Sparsity Incoherence for Matrix Decomposition
Inertial Proximal Alternating Linearized Minimization (iPALM) for Nonconvex and Nonsmooth Problems
LAPACK Users' Guide
On the Convergence of the Proximal Point Algorithm for Convex Minimization
Monotone Operators and the Proximal Point Algorithm
Variational Analysis
Variable Selection via Nonconcave Penalized Likelihood and its Oracle Properties
Nonconvex Nonsmooth Low Rank Minimization via Iteratively Reweighted Nuclear Norm
Fast Singular Value Shrinkage With Chebyshev Polynomial Approximation Based on Signal Sparsity
Accelerated Alternating Projections for Robust Principal Component Analysis
An alternating minimization method for robust principal component analysis
A variational approach to sparsity optimization based on Lagrange multiplier theory
Optimal Control with $L^p(\Omega)$, $p\in [0,1)$, Control Cost
Augmented Lagrangian alternating direction method for matrix separation based on low-rank factorization

This page was built for publication: A customized inertial proximal alternating minimization for SVD-free robust principal component analysis

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