Rank-one convexification for sparse regression
From MaRDI portal
Cites work
- \(2 \times 2\)-convexifications for convex quadratic optimization with indicator variables
- A brief history of linear and mixed-integer programming computation
- A general theory of concave regularization for high-dimensional sparse estimation problems
- A graph-based decomposition method for convex quadratic optimization with indicators
- A Mixed-Integer Fractional Optimization Approach to Best Subset Selection
- A new look at the statistical model identification
- A polynomial algorithm for best-subset selection problem
- A practical scheme and fast algorithm to tune the Lasso with optimality guarantees
- A Statistical View of Some Chemometrics Regression Tools
- A strong conic quadratic reformulation for machine-job assignment with controllable processing times
- Best subset selection via a modern optimization lens
- Cardinality minimization, constraints, and regularization: a survey
- Cuts for Conic Mixed-Integer Programming
- Decompositions of semidefinite matrices and the perspective reformulation of nonseparable quadratic programs
- Empirical decision model learning
- Estimating the dimension of a model
- Fast best subset selection: coordinate descent and local combinatorial optimization algorithms
- Grouped variable selection with discrete optimization: computational and statistical perspectives
- scientific article; zbMATH DE number 6378171 (Why is no real title available?)
- scientific article; zbMATH DE number 5957408 (Why is no real title available?)
- scientific article; zbMATH DE number 4070633 (Why is no real title available?)
- scientific article; zbMATH DE number 6982301 (Why is no real title available?)
- scientific article; zbMATH DE number 1906319 (Why is no real title available?)
- scientific article; zbMATH DE number 845714 (Why is no real title available?)
- scientific article; zbMATH DE number 6438182 (Why is no real title available?)
- Ideal formulations for constrained convex optimization problems with indicator variables
- Identifying a minimal class of models for high-dimensional data
- Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
- Interpretable classification models for recidivism prediction
- Learning optimized risk scores
- Least angle regression. (With discussion)
- Matrix minor reformulation and SOCP-based spatial branch-and-cut method for the AC optimal power flow problem
- Mixed integer second-order cone programming formulations for variable selection in linear regression
- Mixed-Projection Conic Optimization: A New Paradigm for Modeling Rank Constraints
- Nearly unbiased variable selection under minimax concave penalty
- On the convex hull of convex quadratic optimization problems with indicators
- One-step sparse estimates in nonconcave penalized likelihood models
- OR forum: An algorithmic approach to linear regression
- Perspective cuts for a class of convex 0-1 mixed integer programs
- Perspective reformulations of mixed integer nonlinear programs with indicator variables
- Quadratic cone cutting surfaces for quadratic programs with on-off constraints
- Regularization and Variable Selection Via the Elastic Net
- Ridge Regression: Biased Estimation for Nonorthogonal Problems
- Scalable algorithms for the sparse ridge regression
- Simultaneous feature selection and outlier detection with optimality guarantees
- Sparse and smooth signal estimation: convexification of \(\ell_0\)-formulations
- Sparse Approximate Solutions to Linear Systems
- Sparse high-dimensional regression: exact scalable algorithms and phase transitions
- Sparse learning via Boolean relaxations
- Sparse regression at scale: branch-and-bound rooted in first-order optimization
- SparseNet: coordinate descent with nonconvex penalties
- Sparsity and Smoothness Via the Fused Lasso
- Strong formulations for conic quadratic optimization with indicator variables
- Strong formulations for quadratic optimization with M-matrices and indicator variables
- Strong SOCP relaxations for the optimal power flow problem
- Subset Selection and the Cone of Factor-Width-k Matrices
- Subset Selection with Shrinkage: Sparse Linear Modeling When the SNR Is Low
- Supersparse linear integer models for optimized medical scoring systems
- The Adaptive Lasso and Its Oracle Properties
- The DFS fused Lasso: linear-time denoising over general graphs
- The elements of statistical learning. Data mining, inference, and prediction
- The equivalence of optimal perspective formulation and Shor's SDP for quadratic programs with indicator variables
- The smooth-Lasso and other \(\ell _{1}+\ell _{2}\)-penalized methods
- The solution path of the generalized lasso
- The sparsity and bias of the LASSO selection in high-dimensional linear regression
- Variable selection using MM algorithms
- Variable Selection via Nonconcave Penalized Likelihood and its Oracle Properties
This page was built for publication: Rank-one convexification for sparse regression
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6982666)
