Screening for a Reweighted Penalized Conditional Gradient Method
The conditional gradient method (CGM) is widely used in large-scale sparse convex optimization, having a low per iteration computational cost for structured sparse regularizers and a greedy approach for collecting nonzeros. We explore the sparsity acquiring properties of a general penalized CGM (P-C...
Saved in:
Main Authors: | Sun, Yifan, Bach, Francis |
---|---|
Format: | Article |
Language: | English |
Published: |
Université de Montpellier
2022-06-01
|
Series: | Open Journal of Mathematical Optimization |
Subjects: | |
Online Access: | https://ojmo.centre-mersenne.org/articles/10.5802/ojmo.14/ |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
Unveiling user identity across social media: a novel unsupervised gradient semantic model for accurate and efficient user alignment
by: Yongqiang Peng, et al.
Published: (2024-11-01) -
Deep weighted survival neural networks to survival risk prediction
by: Hui Yu, et al.
Published: (2024-11-01) -
Spatial analysis of hyperspectral images for detecting adulteration levels in bon-sorkh (Allium jesdianum L.) seeds: Application of voting classifiers
by: Golshid Fathi, et al.
Published: (2025-03-01) -
An interior proximal gradient method for nonconvex optimization
by: De Marchi, Alberto, et al.
Published: (2024-07-01) -
A Low-Power General Matrix Multiplication Accelerator with Sparse Weight-and-Output Stationary Dataflow
by: Peng Liu, et al.
Published: (2025-01-01)