Mixed-integer quadratic programming reformulations of multi-task learning models
From MaRDI portal
Recommendations
- Learning a classification of mixed-integer quadratic programming problems
- Trace norm regularization: reformulations, algorithms, and multi-task learning
- Multi-standard quadratic optimization: Interior point methods and cone programming reformulation
- A Classifier to Decide on the Linearization of Mixed-Integer Quadratic Problems in CPLEX
- Multi-task learning regression via convex clustering
Cites work
- scientific article; zbMATH DE number 5957307 (Why is no real title available?)
- scientific article; zbMATH DE number 51132 (Why is no real title available?)
- A Limited Memory Algorithm for Bound Constrained Optimization
- A Mixed-Integer Fractional Optimization Approach to Best Subset Selection
- An effective procedure for feature subset selection in logistic regression based on information criteria
- An efficient optimization approach for best subset selection in linear regression, with application to model selection and fitting in autoregressive time-series
- Best subset selection via a modern optimization lens
- Convex multi-task feature learning
- Distributed optimization and statistical learning via the alternating direction method of multipliers
- Feature subset selection for logistic regression via mixed integer optimization
- Learning multiple tasks with kernel methods
- Logistic regression: from art to science
- Mixed integer second-order cone programming formulations for variable selection in linear regression
This page was built for publication: Mixed-integer quadratic programming reformulations of multi-task learning models
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6195559)
