当前位置:
X-MOL 学术
›
Optimization
›
论文详情
Our official English website, www.x-mol.net, welcomes your
feedback! (Note: you will need to create a separate account there.)
An inertial relaxed CQ algorithm with an application to the LASSO and elastic net
Optimization ( IF 1.6 ) Pub Date : 2020-05-18 , DOI: 10.1080/02331934.2020.1763989 Fenghui Wang 1 , Hai Yu 1
Optimization ( IF 1.6 ) Pub Date : 2020-05-18 , DOI: 10.1080/02331934.2020.1763989 Fenghui Wang 1 , Hai Yu 1
Affiliation
The relaxed CQ algorithm is a very efficient algorithm for solving the split feasibility problem (SFP) whenever the convex subsets involved are level subsets of given convex functions. It approxima...
中文翻译:
一种惯性松弛 CQ 算法,适用于 LASSO 和弹性网络
当涉及的凸子集是给定凸函数的级别子集时,宽松的 CQ 算法是一种非常有效的算法,用于解决分裂可行性问题 (SFP)。它近似...
更新日期:2020-05-18
中文翻译:
一种惯性松弛 CQ 算法,适用于 LASSO 和弹性网络
当涉及的凸子集是给定凸函数的级别子集时,宽松的 CQ 算法是一种非常有效的算法,用于解决分裂可行性问题 (SFP)。它近似...