The Analysis of Alternating Minimization Method for Double Sparsity Constrained Optimization Problem
From MaRDI portal
Publication:5149516
DOI10.1142/S0217595920400023zbMath1459.90161OpenAlexW3027171399MaRDI QIDQ5149516
Huan Gao, Ying-Yi Li, Hai-Bin Zhang
Publication date: 11 February 2021
Published in: Asia-Pacific Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1142/s0217595920400023
convergence ratesmooth functionalternating minimizationdouble sparsity constrained problempartial gradient mappings
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Error bounds and convergence analysis of feasible descent methods: A general approach
- On the Minimization Over Sparse Symmetric Sets: Projections, Optimality Conditions, and Algorithms
- Sparsity Constrained Nonlinear Optimization: Optimality Conditions and Algorithms
- On the Convergence of Alternating Minimization for Convex Programming with Applications to Iteratively Reweighted Least Squares and Decomposition Schemes
- Globally convergent block-coordinate techniques for unconstrained optimization
- Direction-of-Arrival Estimation Using a Mixed $\ell _{2,0}$ Norm Approximation
- Causal Network Inference Via Group Sparse Regularization
- Regression Shrinkage and Selection via The Lasso: A Retrospective
- De-noising by soft-thresholding
- On the Convergence of Block Coordinate Descent Type Methods
This page was built for publication: The Analysis of Alternating Minimization Method for Double Sparsity Constrained Optimization Problem
