Subset Selection and the Cone of Factor-Width-k Matrices

Semidefinite programming (90C22) Quadratic programming (90C20) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)

Cites Work

Unnamed Item
Unnamed Item
Nearly unbiased variable selection under minimax concave penalty
Best subset selection via a modern optimization lens
Mixed integer second-order cone programming formulations for variable selection in linear regression
On constrained and regularized high-dimensional regression
Partial facial reduction: simplified, equivalent SDPs via approximations of the PSD cone
Least angle regression. (With discussion)
Convex programming for disjunctive convex optimization
On sums of squares of \(K\)-nomials
New bounds for subset selection from conic relaxations
Sparse regression at scale: branch-and-bound rooted in first-order optimization
Sparse PSD approximation of the PSD cone
Ideal formulations for constrained convex optimization problems with indicator variables
Sparse high-dimensional regression: exact scalable algorithms and phase transitions
Best subset, forward stepwise or Lasso? Analysis and recommendations based on extensive comparisons
Sparse learning via Boolean relaxations
On factor width and symmetric \(H\)-matrices
Perspective cuts for a class of convex 0-1 mixed integer programs
Perspective reformulations of mixed integer nonlinear programs with indicator variables
Global Optimization with Polynomials and the Problem of Moments
Linear Programming Relaxations of Quadratically Constrained Quadratic Programs
Strong SOCP Relaxations for the Optimal Power Flow Problem
SparseNet: Coordinate Descent With Nonconvex Penalties
Just relax: convex programming methods for identifying sparse signals in noise
Learning Multiscale Sparse Representations for Image and Video Restoration
Regressions by Leaps and Bounds
A Branch and Bound Algorithm for Feature Subset Selection
Variable Selection via Nonconcave Penalized Likelihood and its Oracle Properties
Sparse Approximate Solutions to Linear Systems
On the Convexification of Constrained Quadratic Optimization Problems with Indicator Variables
Fast Best Subset Selection: Coordinate Descent and Local Combinatorial Optimization Algorithms
Scalable Algorithms for the Sparse Ridge Regression
Exactness of Semidefinite Relaxations for Nonlinear Optimization Problems with Underlying Graph Structure
Harmonic decomposition of audio signals with matching pursuit

This page was built for publication: Subset Selection and the Cone of Factor-Width-k Matrices