Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Calculation of bounds on the coefficients in the MIO method #15

Open
vtshen opened this issue Sep 3, 2018 · 0 comments
Open

Calculation of bounds on the coefficients in the MIO method #15

vtshen opened this issue Sep 3, 2018 · 0 comments

Comments

@vtshen
Copy link

vtshen commented Sep 3, 2018

in the paper, Best Subset Selection via a Modern Optimization Lens, it mentioned that adding additional bounds on the coefficients leads to improved performance of the MIO in Equation (9).

In the code file (master/bestsubset/R/bs.R) it shows the bound on the beta is calculated by this:

bigm = 2*max(abs(best.beta))

where best.beta is from the projected gradient method. But I felt that this is not exactly the same to the description in the Section 2.3.1 in the paper,

@vtshen vtshen changed the title The argument time.limit in the function bs is equal to 1800? The default value of the argument time.limit in the function bs is equal to 1800? Sep 3, 2018
@vtshen vtshen changed the title The default value of the argument time.limit in the function bs is equal to 1800? Calculation of bounds on the coefficients in the MIO method Oct 11, 2018
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Labels
None yet
Projects
None yet
Development

No branches or pull requests

1 participant