scientific article; zbMATH DE number 7370569
From MaRDI portal
Publication:4998944
Atamtürk, Alper, Shaoning Han, Andrés Gómez
Publication date: 9 July 2021
Full work available at URL: https://arxiv.org/abs/1811.02655
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items
On the Convexification of Constrained Quadratic Optimization Problems with Indicator Variables, The equivalence of optimal perspective formulation and Shor's SDP for quadratic programs with indicator variables, Grouped variable selection with discrete optimization: computational and statistical perspectives, \(2 \times 2\)-convexifications for convex quadratic optimization with indicator variables, A graph-based decomposition method for convex quadratic optimization with indicators, Comparing solution paths of sparse quadratic minimization with a Stieltjes matrix, On the convex hull of convex quadratic optimization problems with indicators, Supermodularity and valid inequalities for quadratic optimization with indicators, Linear-step solvability of some folded concave and singly-parametric sparse optimization problems, Outlier Detection in Time Series via Mixed-Integer Conic Quadratic Optimization, Ideal formulations for constrained convex optimization problems with indicator variables
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Nearly unbiased variable selection under minimax concave penalty
- Nonlinear total variation based noise removal algorithms
- The Adaptive Lasso and Its Oracle Properties
- Exact Spike Train Inference Via $\ell_0$ Optimization
- Best subset selection via a modern optimization lens
- On constrained and regularized high-dimensional regression
- Mixed-integer nonlinear programs featuring ``on/off constraints
- The solution path of the generalized lasso
- Enhancing sparsity by reweighted \(\ell _{1}\) minimization
- A strong conic quadratic reformulation for machine-job assignment with controllable processing times
- Properties and refinements of the fused Lasso
- Conic mixed-integer rounding cuts
- Applications of second-order cone programming
- Criteria for generalized diagonally dominant matrices and \(M\)-matrices
- On recurring theorems on diagonal dominance
- M-matrix characterizations. I: nonsingular M-matrices
- Locally adaptive regression splines
- Second-order cone programming
- Strong formulations for quadratic optimization with M-matrices and indicator variables
- Extended formulations in mixed integer conic quadratic programming
- Quadratic cone cutting surfaces for quadratic programs with on-off constraints
- A polyhedral branch-and-cut approach to global optimization
- A cut-based algorithm for the nonlinear dual of the minimum cost network flow problem
- The smooth-Lasso and other \(\ell _{1}+\ell _{2}\)-penalized methods
- Sparse high-dimensional regression: exact scalable algorithms and phase transitions
- Rejoinder: ``Best subset, forward stepwise or Lasso? Analysis and recommendations based on extensive comparisons
- Simplex QP-based methods for minimizing a conic quadratic objective over polyhedra
- On integer and MPCC representability of affine sparsity
- Sparse learning via Boolean relaxations
- On mathematical programming with indicator constraints
- Structural properties of affine sparsity constraints
- Adaptive piecewise polynomial estimation via trend filtering
- On factor width and symmetric \(H\)-matrices
- Perspective cuts for a class of convex 0-1 mixed integer programs
- Strong formulations of robust mixed 0-1 programming
- Perspective reformulations of mixed integer nonlinear programs with indicator variables
- Atomic Decomposition by Basis Pursuit
- OR Forum—An Algorithmic Approach to Linear Regression
- Multi-Label Markov Random Fields as an Efficient and Effective Tool for Image Segmentation, Total Variations and Regularization
- SparseNet: Coordinate Descent With Nonconvex Penalties
- Approximation algorithms for classification problems with pairwise relationships
- Stable recovery of sparse overcomplete representations in the presence of noise
- Interior-point methods for optimization
- $\ell_1$ Trend Filtering
- The DFS Fused Lasso: Linear-Time Denoising over General Graphs
- Regression Shrinkage and Selection via The Lasso: A Retrospective
- Minimization of Akaike's information criterion in linear regression analysis via mixed integer nonlinear program
- Sparsity and Smoothness Via the Fused Lasso
- A Statistical View of Some Chemometrics Regression Tools
- Iterative Methods for Total Variation Denoising
- Submodularity in Conic Quadratic Mixed 0–1 Optimization
- Adjacency-Clustering and Its Application for Yield Prediction in Integrated Circuit Manufacturing
- Fast Best Subset Selection: Coordinate Descent and Local Combinatorial Optimization Algorithms
- Scalable Algorithms for the Sparse Ridge Regression
- Regularization and Variable Selection Via the Elastic Net
- Quadratic Convex Reformulations for Semicontinuous Quadratic Programming
- Structured Sparsity via Alternating Direction Methods
- Cuts for Conic Mixed-Integer Programming
- An efficient algorithm for image segmentation, Markov random fields and related problems
- High Dimensional Thresholded Regression and Shrinkage Effect
- Compressed sensing
- The elements of statistical learning. Data mining, inference, and prediction
