Adaptive Sieving with Semismooth Newton Proximal Augmented Lagrangian Algorithm for Multi-Task Lasso Problems
- 19 May 2026
- journal article
- research article
- Published by Springer Nature in Journal of Scientific Computing
- Vol. 108 (1) , 7
Abstract
No abstract availableKeywords
Funding Information
- National Natural Science Foundation of China (12271097)
- National Natural Science Foundation of China (12371301)
- Key Program of National Science Foundation of Fujian Province of China (2023J02007)
- Science Fund for Distinguished Young Scholars of Jiangsu Province (22JR5RA223)
This publication has 30 references indexed in Scilit:
- Support matrix machine: exploring sample sparsity, low rank, and adaptive sieving in high-performance computingMathematical Programming Computation, 2026
- Adaptive sieving: a dimension reduction technique for sparse optimization problemsMathematical Programming Computation, 2025
- On the efficient computation of a generalized Jacobian of the projector over the Birkhoff polytopeMathematical Programming, 2018
- Convex multi-task feature learningMachine Learning, 2008
- On the LASSO and its DualJournal of Computational and Graphical Statistics, 2000
- Variational Analysis1998
- Newton and Quasi-Newton Methods for Normal Maps with Polyhedral SetsJournal of Optimization Theory and Applications, 1997
- Multitask LearningMachine Learning, 1997
- Minimization of SC1 functions and the Maratos effectOperations Research Letters, 1995
- A dual algorithm for the solution of nonlinear variational problems via finite element approximationComputers & Mathematics with Applications, 1976