Pages that link to "Item:Q320071"
From MaRDI portal
The following pages link to Mixed integer second-order cone programming formulations for variable selection in linear regression (Q320071):
Displayed 33 items.
- Feature subset selection for logistic regression via mixed integer optimization (Q301699) (← links)
- Discrete optimization methods to fit piecewise affine models to data points (Q342537) (← links)
- Predicting online invitation responses with a competing risk model using privacy-friendly social event data (Q1651729) (← links)
- Locating hyperplanes to fitting set of points: a general framework (Q1652646) (← links)
- DC formulations and algorithms for sparse optimization problems (Q1749449) (← links)
- Alternating direction method of multipliers for truss topology optimization with limited number of nodes: a cardinality-constrained second-order cone programming approach (Q1787322) (← links)
- Feature scaling via second-order cone programming (Q1793515) (← links)
- Optimization problems for machine learning: a survey (Q2029894) (← links)
- Convergent inexact penalty decomposition methods for cardinality-constrained problems (Q2031962) (← links)
- Strong formulations for conic quadratic optimization with indicator variables (Q2039236) (← links)
- An effective procedure for feature subset selection in logistic regression based on information criteria (Q2044566) (← links)
- New bounds for subset selection from conic relaxations (Q2076815) (← links)
- Subset selection for multiple linear regression via optimization (Q2182858) (← links)
- Best subset selection via cross-validation criterion (Q2192029) (← links)
- A cutting plane method for risk-constrained traveling salesman problem with random arc costs (Q2274859) (← links)
- An efficient optimization approach for best subset selection in linear regression, with application to model selection and fitting in autoregressive time-series (Q2282827) (← links)
- Maximum relevance minimum common redundancy feature selection for nonlinear data (Q2293268) (← links)
- Investigating consumers' store-choice behavior via hierarchical variable selection (Q2324251) (← links)
- Mixed integer quadratic optimization formulations for eliminating multicollinearity based on variance inflation factor (Q2633546) (← links)
- Graph structured sparse subset selection (Q2662712) (← links)
- Mixed Integer Nonlinear Program for Minimization of Akaike’s Information Criterion (Q2819233) (← links)
- A NEW APPROACH TO SELECT THE BEST SUBSET OF PREDICTORS IN LINEAR REGRESSION MODELLING: BI-OBJECTIVE MIXED INTEGER LINEAR PROGRAMMING (Q3122035) (← links)
- Minimization of Akaike's information criterion in linear regression analysis via mixed integer nonlinear program (Q4637833) (← links)
- A Mixed-Integer Fractional Optimization Approach to Best Subset Selection (Q4995087) (← links)
- (Q5011563) (← links)
- Features Selection as a Nash-Bargaining Solution: Applications in Online Advertising and Information Systems (Q5057996) (← links)
- Convexification of Queueing Formulas by Mixed-Integer Second-Order Cone Programming: An Application to a Discrete Location Problem with Congestion (Q5058005) (← links)
- MIP-BOOST: Efficient and Effective <i>L</i><sub>0</sub> Feature Selection for Linear Regression (Q5066443) (← links)
- Scalable Algorithms for the Sparse Ridge Regression (Q5148400) (← links)
- Approximation hierarchies for copositive cone over symmetric cone and their comparison (Q6122328) (← links)
- On computing medians of marked point process data under edit distance (Q6142065) (← links)
- Subset Selection and the Cone of Factor-Width-<i>k</i> Matrices (Q6195312) (← links)
- Mixed-integer quadratic programming reformulations of multi-task learning models (Q6195559) (← links)