Doubly majorized algorithm for sparsity-inducing optimization problems with regularizer-compatible constraints
From MaRDI portal
Publication:6051303
DOI10.1007/s10589-023-00503-1arXiv2207.00396OpenAlexW4384206090MaRDI QIDQ6051303
Tianxiang Liu, Akiko Takeda, Ting Kei Pong
Publication date: 19 October 2023
Published in: Computational Optimization and Applications (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2207.00396
Cites Work
- Unnamed Item
- A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
- Enhancing sparsity by reweighted \(\ell _{1}\) minimization
- Asymptotics for Lasso-type estimators.
- Further properties of the forward-backward envelope with applications to difference-of-convex programming
- Iteratively reweighted \(\ell _1\) algorithms with extrapolation
- Nonmetric multidimensional scaling. A numerical method
- Atomic Decomposition by Basis Pursuit
- On the Minimization Over Sparse Symmetric Sets: Projections, Optimality Conditions, and Algorithms
- Sparsity Constrained Nonlinear Optimization: Optimality Conditions and Algorithms
- Lower Bound Theory of Nonzero Entries in Solutions of $\ell_2$-$\ell_p$ Minimization
- Decoding by Linear Programming
- Variational Analysis
- Sparse Reconstruction by Separable Approximation
- <formula formulatype="inline"><tex Notation="TeX">$L_{1/2}$</tex> </formula> Regularization: Convergence of Iterative Half Thresholding Algorithm
- Optimality and Complexity for Constrained Optimization Problems with Nonconvex Regularization
- Stable signal recovery from incomplete and inaccurate measurements
- Penalty Methods for a Class of Non-Lipschitz Optimization Problems
- The elements of statistical learning. Data mining, inference, and prediction
- From the simplex to the sphere: faster constrained optimization using the Hadamard parametrization
This page was built for publication: Doubly majorized algorithm for sparsity-inducing optimization problems with regularizer-compatible constraints
