A refined convergence analysis of \(\mathrm{pDCA}_{e}\) with applications to simultaneous sparse recovery and outlier detection
From MaRDI portal
Publication:2419541
DOI10.1007/s10589-019-00067-zzbMath1420.90048arXiv1804.07213OpenAlexW2963965252MaRDI QIDQ2419541
Tianxiang Liu, Ting Kei Pong, Akiko Takeda
Publication date: 13 June 2019
Published in: Computational Optimization and Applications (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1804.07213
Related Items (21)
An inexact successive quadratic approximation method for a class of difference-of-convex optimization problems ⋮ An inexact proximal DC algorithm with sieving strategy for rank constrained least squares semidefinite programming ⋮ Kurdyka-Łojasiewicz exponent via inf-projection ⋮ Column $\ell_{2,0}$-Norm Regularized Factorization Model of Low-Rank Matrix Recovery and Its Computation ⋮ A proximal algorithm with backtracked extrapolation for a class of structured fractional programming ⋮ Difference-of-Convex Algorithms for a Class of Sparse Group $\ell_0$ Regularized Optimization Problems ⋮ Convergence rate analysis of an extrapolated proximal difference-of-convex algorithm ⋮ A refined inertial DC algorithm for DC programming ⋮ A three-operator splitting algorithm with deviations for generalized DC programming ⋮ A difference-of-convex approach for split feasibility with applications to matrix factorizations and outlier detection ⋮ A global exact penalty for rank-constrained optimization problem and applications ⋮ A matrix nonconvex relaxation approach to unconstrained binary polynomial programs ⋮ Error bound and isocost imply linear convergence of DCA-based algorithms to D-stationarity ⋮ On the superiority of PGMs to PDCAs in nonsmooth nonconvex sparse regression ⋮ A proximal DC approach for quadratic assignment problem ⋮ A hybrid Bregman alternating direction method of multipliers for the linearly constrained difference-of-convex problems ⋮ Analysis and Algorithms for Some Compressed Sensing Models Based on L1/L2 Minimization ⋮ Convergence Rate Analysis of a Sequential Convex Programming Method with Line Search for a Class of Constrained Difference-of-Convex Optimization Problems ⋮ Penalty and Augmented Lagrangian Methods for Constrained DC Programming ⋮ The Exact Modulus of the Generalized Concave Kurdyka-Łojasiewicz Property ⋮ A unified Douglas-Rachford algorithm for generalized DC programming
Cites Work
- Unnamed Item
- Nearly unbiased variable selection under minimax concave penalty
- Proximal alternating linearized minimization for nonconvex and nonsmooth problems
- On the convergence of the iterates of the ``fast iterative shrinkage/thresholding algorithm
- The solution path of the generalized lasso
- Iterative hard thresholding for compressed sensing
- Enhancing sparsity by reweighted \(\ell _{1}\) minimization
- On the convergence of the proximal algorithm for nonsmooth functions involving analytic features
- Sparsest solutions of underdetermined linear systems via \( \ell _q\)-minimization for \(0<q\leqslant 1\)
- A method for simultaneous variable selection and outlier identification in linear regression
- Convex analysis approach to d. c. programming: Theory, algorithms and applications
- Robust and sparse estimators for linear regression models
- A proximal difference-of-convex algorithm with extrapolation
- DC formulations and algorithms for sparse optimization problems
- Calculus of the exponent of Kurdyka-Łojasiewicz inequality and its applications to linear convergence of first-order methods
- Least trimmed squares regression, least median squares regression, and mathematical program\-ming
- Convergence of descent methods for semi-algebraic and tame problems: proximal algorithms, forward-backward splitting, and regularized Gauss-Seidel methods
- Sparse least trimmed squares regression for analyzing high-dimensional large data sets
- Statistical consistency and asymptotic normality for high-dimensional robust \(M\)-estimators
- A successive difference-of-convex approximation method for a class of nonconvex nonsmooth optimization problems
- A diagnostic method for simultaneous feature selection and outlier identification in linear regression
- Linear Convergence of Proximal Gradient Algorithm with Extrapolation for a Class of Nonconvex Nonsmooth Minimization Problems
- Outlier Detection Using Nonconvex Penalized Regression
- Proximal Alternating Minimization and Projection Methods for Nonconvex Problems: An Approach Based on the Kurdyka-Łojasiewicz Inequality
- Decoding by Linear Programming
- Variational Analysis
- A D.C. Optimization Algorithm for Solving the Trust-Region Subproblem
- Variable Selection via Nonconcave Penalized Likelihood and its Oracle Properties
- Sparse Approximate Solutions to Linear Systems
- Minimization of $\ell_{1-2}$ for Compressed Sensing
- Sparse Approximation via Penalty Decomposition Methods
- Stable signal recovery from incomplete and inaccurate measurements
- Convex analysis and global optimization
- Compressed sensing
This page was built for publication: A refined convergence analysis of \(\mathrm{pDCA}_{e}\) with applications to simultaneous sparse recovery and outlier detection
