Mixed integer second-order cone programming formulations for variable selection in linear regression

From MaRDI portal
Revision as of 03:28, 30 January 2024 by Import240129110155 (talk | contribs) (Created automatically from import240129110155)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:320071


DOI10.1016/j.ejor.2015.06.081zbMath1346.90616MaRDI QIDQ320071

Ryuhei Miyashiro, Yuichi Takano

Publication date: 6 October 2016

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejor.2015.06.081


62J05: Linear regression; mixed models

90C10: Integer programming


Related Items

Minimization of Akaike's information criterion in linear regression analysis via mixed integer nonlinear program, Unnamed Item, A Mixed-Integer Fractional Optimization Approach to Best Subset Selection, Features Selection as a Nash-Bargaining Solution: Applications in Online Advertising and Information Systems, Convexification of Queueing Formulas by Mixed-Integer Second-Order Cone Programming: An Application to a Discrete Location Problem with Congestion, MIP-BOOST: Efficient and Effective L0 Feature Selection for Linear Regression, Scalable Algorithms for the Sparse Ridge Regression, Approximation hierarchies for copositive cone over symmetric cone and their comparison, On computing medians of marked point process data under edit distance, Subset Selection and the Cone of Factor-Width-k Matrices, Mixed-integer quadratic programming reformulations of multi-task learning models, Feature subset selection for logistic regression via mixed integer optimization, Discrete optimization methods to fit piecewise affine models to data points, Predicting online invitation responses with a competing risk model using privacy-friendly social event data, Locating hyperplanes to fitting set of points: a general framework, DC formulations and algorithms for sparse optimization problems, Alternating direction method of multipliers for truss topology optimization with limited number of nodes: a cardinality-constrained second-order cone programming approach, Feature scaling via second-order cone programming, Optimization problems for machine learning: a survey, Convergent inexact penalty decomposition methods for cardinality-constrained problems, Strong formulations for conic quadratic optimization with indicator variables, An effective procedure for feature subset selection in logistic regression based on information criteria, New bounds for subset selection from conic relaxations, Subset selection for multiple linear regression via optimization, Best subset selection via cross-validation criterion, A cutting plane method for risk-constrained traveling salesman problem with random arc costs, An efficient optimization approach for best subset selection in linear regression, with application to model selection and fitting in autoregressive time-series, Maximum relevance minimum common redundancy feature selection for nonlinear data, Investigating consumers' store-choice behavior via hierarchical variable selection, Mixed integer quadratic optimization formulations for eliminating multicollinearity based on variance inflation factor, Graph structured sparse subset selection, Mixed Integer Nonlinear Program for Minimization of Akaike’s Information Criterion, A NEW APPROACH TO SELECT THE BEST SUBSET OF PREDICTORS IN LINEAR REGRESSION MODELLING: BI-OBJECTIVE MIXED INTEGER LINEAR PROGRAMMING


Uses Software


Cites Work