A refined convergence analysis of \(\mathrm{pDCA}_{e}\) with applications to simultaneous sparse recovery and outlier detection
type: Item
instance of: scholarly article
title: A refined convergence analysis of \(\mathrm{pDCA}_{e}\) with applications to simultaneous sparse recovery and outlier detection
zbMATH Open document ID: 1420.90048
author: Tianxiang Liu
author: Ting Kei Pong
author: Akiko Takeda
published in: Computational Optimization and Applications
publication date: 2019-06-13T00:00:00Z
full work available at URL: https://arxiv.org/abs/1804.07213
Mathematics Subject Classification ID: 90C26
zbMATH DE Number: 7066008
zbMATH Keywords: difference-of-convex optimization
zbMATH Keywords: Kurdyka-Lojasiewicz property
zbMATH Keywords: sparse recovery
zbMATH Keywords: outlier detection
MaRDI profile type: MaRDI publication profile
OpenAlex ID: W2963965252
arXiv ID: 1804.07213
cites work: Sparse least trimmed squares regression for analyzing high-dimensional large data sets
cites work: On the convergence of the proximal algorithm for nonsmooth functions involving analytic features
cites work: Proximal Alternating Minimization and Projection Methods for Nonconvex Problems: An Approach Based on the Kurdyka-Łojasiewicz Inequality
cites work: Convergence of descent methods for semi-algebraic and tame problems: proximal algorithms, forward-backward splitting, and regularized Gauss-Seidel methods
cites work: Iterative hard thresholding for compressed sensing
cites work: Proximal alternating linearized minimization for nonconvex and nonsmooth problems
cites work: Decoding by Linear Programming
cites work: Stable signal recovery from incomplete and inaccurate measurements
cites work: Enhancing sparsity by reweighted \(\ell _{1}\) minimization
cites work: On the convergence of the iterates of the ``fast iterative shrinkage/thresholding algorithm''
cites work: Compressed sensing
cites work: Variable Selection via Nonconcave Penalized Likelihood and its Oracle Properties
cites work: Sparsest solutions of underdetermined linear systems via \( \ell _q\)-minimization for \(0<q\leqslant 1\)
cites work: Least trimmed squares regression, least median squares regression, and mathematical program\-ming
cites work: DC formulations and algorithms for sparse optimization problems
cites work: A method for simultaneous variable selection and outlier identification in linear regression
cites work: Calculus of the exponent of Kurdyka-Łojasiewicz inequality and its applications to linear convergence of first-order methods
cites work: A successive difference-of-convex approximation method for a class of nonconvex nonsmooth optimization problems
cites work: Statistical consistency and asymptotic normality for high-dimensional robust \(M\)-estimators
cites work: Sparse Approximation via Penalty Decomposition Methods
cites work: A diagnostic method for simultaneous feature selection and outlier identification in linear regression
cites work: Sparse Approximate Solutions to Linear Systems
cites work: Convex analysis approach to d. c. programming: Theory, algorithms and applications
cites work: A D.C. Optimization Algorithm for Solving the Trust-Region Subproblem
cites work: Variational Analysis
cites work: Q4692741
cites work: Outlier Detection Using Nonconvex Penalized Regression
cites work: Robust and sparse estimators for linear regression models
cites work: The solution path of the generalized lasso
cites work: Convex analysis and global optimization
cites work: Linear Convergence of Proximal Gradient Algorithm with Extrapolation for a Class of Nonconvex Nonsmooth Minimization Problems
cites work: A proximal difference-of-convex algorithm with extrapolation
cites work: Minimization of $\ell_{1-2}$ for Compressed Sensing
cites work: Nearly unbiased variable selection under minimax concave penalty
DOI: 10.1007/S10589-019-00067-Z
Recommended article: A proximal difference-of-convex algorithm with extrapolation
Recommended article: New Bregman proximal type algoritms for solving DC optimization problems
Recommended article: Error bound and isocost imply linear convergence of DCA-based algorithms to D-stationarity
Recommended article: Alternating DC algorithm for partial DC programming problems
Recommended article: A general double-proximal gradient algorithm for d.c. programming
description: scientific article