Cardinality-constrained structured data-fitting problems
Open Journal of Mathematical Optimization · 2024
DOI: 10.5802/ojmo.27 ↗Kurz gefasst
Fachartikel in der Zeitschrift Open Journal of Mathematical Optimization, 2024. Verfasst von Zhenan Fan und 2 weiteren Autor:innen. Die Arbeit nennt 63 Literaturangaben.
Abstract (Originalsprache)
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 algorithm that translates any feasible dual solution into a primal solution satisfying the cardinality constraint. Rigorous guarantees bound the quality of a near-optimal primal solution given any dual-based method that generates dual iterates converging to an optimal dual solution. Numerical experiments on real-world datasets support the analysis and demonstrate the efficiency of the proposed approach.
Zitieren
APA
Fan, Z., Fang, H., & Friedlander, M. P. (2024). Cardinality-constrained structured data-fitting problems. Open Journal of Mathematical Optimization. https://doi.org/10.5802/ojmo.27
Vancouver
Fan Z, Fang H, Friedlander MP. Cardinality-constrained structured data-fitting problems. Open Journal of Mathematical Optimization. 2024. doi:10.5802/ojmo.27
BibTeX
@article{Fan2024,
author = {Fan, Zhenan and Fang, Huang and Friedlander, Michael P.},
title = {Cardinality-constrained structured data-fitting problems},
journal = {Open Journal of Mathematical Optimization},
year = {2024},
doi = {10.5802/ojmo.27}
}
EUVIMED