We describe an algorithm, based on the simplex method of linear programming, for solving the discrete l 1 approximation problem with any type of linear constraints. The numerical results reported here ...
This is a preview. Log in through your library . Abstract For the problem of variable selection in generalized linear models, we develop various adaptive Bayesian criteria. Using a hierarchical ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results
Feedback