期刊文献+
共找到2篇文章
< 1 >
每页显示 20 50 100
Combination of Nonconvex Penalties and Ridge Regression for High-Dimensional Linear Models
1
作者 Xiuli WANG Mingqiu WANG 《Journal of Mathematical Research with Applications》 CSCD 2014年第6期743-753,共11页
Nonconvex penalties including the smoothly clipped absolute deviation penalty and the minimax concave penalty enjoy the properties of unbiasedness, continuity and sparsity,and the ridge regression can deal with the co... Nonconvex penalties including the smoothly clipped absolute deviation penalty and the minimax concave penalty enjoy the properties of unbiasedness, continuity and sparsity,and the ridge regression can deal with the collinearity problem. Combining the strengths of nonconvex penalties and ridge regression(abbreviated as NPR), we study the oracle property of the NPR estimator in high dimensional settings with highly correlated predictors, where the dimensionality of covariates pn is allowed to increase exponentially with the sample size n. Simulation studies and a real data example are presented to verify the performance of the NPR method. 展开更多
关键词 high dimension nonconvex penalties oracle property ridge regression variable selection
原文传递
Review of Large-Scale Simulation Optimization
2
作者 Wei-Wei Fan L.Jeff Hong +1 位作者 Guang-Xin Jiang Jun Luo 《Journal of the Operations Research Society of China》 2025年第3期688-722,共35页
Large-scale simulation optimization(SO)problems encompass both large-scale ranking-and-selection problems and high-dimensional discrete or continuous SO problems,presenting significant challenges to existing SO theori... Large-scale simulation optimization(SO)problems encompass both large-scale ranking-and-selection problems and high-dimensional discrete or continuous SO problems,presenting significant challenges to existing SO theories and algorithms.This paper begins by providing illustrative examples that highlight the differences between large-scale SO problems and those of a more moderate scale.Subsequently,it reviews several widely employed techniques for addressing large-scale SOproblems,such as divide-and-conquer,dimension reduction,and gradient-based algorithms.Additionally,the paper examines parallelization techniques leveraging widely accessible parallel computing environments to facilitate the resolution of large-scale SO problems. 展开更多
关键词 Simulation optimization Large-scale problems Ranking and selection·Dimension reduction Gradient-based algorithms Parallel algorithms
原文传递
上一页 1 下一页 到第
使用帮助 返回顶部