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
-
Trading off 1-norm and sparsity against rank for linear models using mathematical optimization: 1-norm minimizing partially reflexive ah-symmetric generalized inverses
by: Fampa, Marcia, et al.
Published: (2021-06-01) -
Sparse Regularization With Reverse Sorted Sum of Squares via an Unrolled Difference-of-Convex Approach
by: Takayuki Sasaki, et al.
Published: (2025-01-01) -
An adjoint feature-selection-based evolutionary algorithm for sparse large-scale multiobjective optimization
by: Panpan Zhang, et al.
Published: (2025-01-01) -
Inertial-relaxed splitting for composite monotone inclusions
by: Oré, Ernesto, et al.
Published: (2023-02-01) -
Accelerated dynamic light sheet microscopy: unifying time-varying patterned illumination and low-rank and sparsity constrained reconstruction
by: Marco Tobia Vitali, et al.
Published: (2025-01-01)