Cardinality-constrained structured data-fitting problems
A memory-efficient solution framework is proposed for the cardinality-constrained structured data-fitting problem. Dual-based atom-identification rules reveal the structure of the optimal primal solution from near-optimal dual solutions, which allows for a simple and computationally efficient algori...
Saved in:
| Main Authors: | Fan, Zhenan, Fang, Huang, Friedlander, Michael P. |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Université de Montpellier
2024-05-01
|
| Series: | Open Journal of Mathematical Optimization |
| Subjects: | |
| Online Access: | https://ojmo.centre-mersenne.org/articles/10.5802/ojmo.27/ |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
Speech Enhancement Based on Constrained Low-rank Sparse Matrix Decomposition Integrated with Temporal Continuity Regularisation
by: Chengli SUN, et al.
Published: (2019-11-01) -
Distributed Sparse Manifold-Constrained Optimization Algorithm in Linear Discriminant Analysis
by: Yuhao Zhang, et al.
Published: (2025-03-01) -
Hierarchical Sampling Representation Detector for Ship Detection in SAR Images
by: Ming Tong, et al.
Published: (2024-01-01) -
A Novel Nonconvex Penalty Method for a Rank Constrained Matrix Optimization Problem and its Applications
by: Zhang Wenjuan, et al.
Published: (2025-03-01) -
CUR matrix approximation through convex optimization for feature selection
by: Kathryn Linehan, et al.
Published: (2025-08-01)