.png){kind=icon}
Return
Selective linearization for multi-block statistical learning
.png){kind=icon}
PRE
AI
DOI：10.1016/j.ejor.2020.12.010.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
We consider the problem of minimizing a sum of several convex non-smooth functions and discuss the selective linearization method (SLIN), which iteratively linearizes all but one of the functions and employs simple proximal steps. The algorithm is a form of multiple operator splitting in which the order of processing partial functions is not fixed, but rather determined in the course of calculations. SLIN is globally convergent for an arbitrary number of component functions without artificial duplication of variables. We report results from extensive numerical experiments in two statistical learning settings such as large-scale overlapping group Lasso and doubly regularized support vector machine. In each setting, we introduce novel and efficient solutions for solving sub-problems. The numerical results demonstrate the efficacy and accuracy of SLIN. Published by Elsevier B.V.
Keywords:
Nonlinear programming
Statistical learning
Penalized regression
Regularized support vector machine
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
6
Papers:
2.2W
Citations:
6.4W
Organization
View more organizations
Cited Papers
Small Silencing RNAs in Plants Are Mobile and Direct Epigenetic Modification in Recipient Cells.png)
Science
ScienceIF0
PREAI
ShareSaveShareSaveArsenic removal from aqueous solutions by adsorption using novel MIL-53(Fe) as a highly efficient adsorbentRSC Advances
RSC AdvancesIF0
PREAI
ShareSave
A computational avenue towards understanding and design of zwitterionic anti-biofouling materials
PREAI
ShareSave
View more