Sciweavers

393 search results - page 29 / 79
» On the Convergence of Boosting Procedures
Sort
View
WSC
2007
13 years 11 months ago
Subset selection and optimization for selecting binomial systems applied to supersaturated design generation
The problem of finding the binomial population with the highest success probability is considered when the number of binomial populations is large. A new rigorous indifference zo...
Ning Zheng, Theodore Allen
EOR
2010
116views more  EOR 2010»
13 years 8 months ago
Speeding up continuous GRASP
Continuous GRASP (C-GRASP) is a stochastic local search metaheuristic for finding cost-efficient solutions to continuous global optimization problems subject to box constraints (Hi...
Michael J. Hirsch, Panos M. Pardalos, Mauricio G. ...
CSDA
2007
114views more  CSDA 2007»
13 years 8 months ago
Relaxed Lasso
The Lasso is an attractive regularisation method for high dimensional regression. It combines variable selection with an efficient computational procedure. However, the rate of co...
Nicolai Meinshausen
CORR
2010
Springer
188views Education» more  CORR 2010»
13 years 8 months ago
A unified framework for high-dimensional analysis of $M$-estimators with decomposable regularizers
High-dimensional statistical inference deals with models in which the the number of parameters p is comparable to or larger than the sample size n. Since it is usually impossible ...
Sahand Negahban, Pradeep Ravikumar, Martin J. Wain...
SIAMJO
2000
108views more  SIAMJO 2000»
13 years 8 months ago
Smooth SQP Methods for Mathematical Programs with Nonlinear Complementarity Constraints
Mathematical programs with nonlinear complementarity constraints are reformulated using better-posed but nonsmooth constraints. We introduce a class of functions, parameterized by...
Houyuan Jiang, Daniel Ralph