Sparse and smooth signal estimation: convexification of _0-formulations
From MaRDI portal
Publication:4998944
Recommendations
- A smoothing method for sparse optimization over convex sets
- Complementarity formulations of \(\ell_0\)-norm optimization
- A convex relaxation framework consisting of a primal-dual alternative algorithm for solving \(\ell_0\) sparsity-induced optimization problems with application to signal recovery based image restoration
- Relaxation approaches for nonlinear sparse optimization problems
- Sparse approximate reconstruction decomposed by two optimization problems
Cites work
- scientific article; zbMATH DE number 6378171 (Why is no real title available?)
- scientific article; zbMATH DE number 439380 (Why is no real title available?)
- scientific article; zbMATH DE number 734901 (Why is no real title available?)
- scientific article; zbMATH DE number 2062604 (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?)
- $\ell_1$ Trend Filtering
- A Statistical View of Some Chemometrics Regression Tools
- A cut-based algorithm for the nonlinear dual of the minimum cost network flow problem
- A polyhedral branch-and-cut approach to global optimization
- A strong conic quadratic reformulation for machine-job assignment with controllable processing times
- Adaptive Lasso for sparse high-dimensional regression models
- Adaptive piecewise polynomial estimation via trend filtering
- Adjacency-clustering and its application for yield prediction in integrated circuit manufacturing
- An efficient algorithm for image segmentation, Markov random fields and related problems
- Applications of second-order cone programming
- Approximation algorithms for classification problems with pairwise relationships, metric labeling and Markov random fields
- Atomic decomposition by basis pursuit
- Best subset selection via a modern optimization lens
- Compressed sensing
- Conic mixed-integer rounding cuts
- Consistency of the group Lasso and multiple kernel learning
- Criteria for generalized diagonally dominant matrices and \(M\)-matrices
- Cuts for Conic Mixed-Integer Programming
- Enhancing sparsity by reweighted \(\ell _{1}\) minimization
- Exact spike train inference via \(\ell_{0}\) optimization
- Extended formulations in mixed integer conic quadratic programming
- Fast best subset selection: coordinate descent and local combinatorial optimization algorithms
- High dimensional thresholded regression and shrinkage effect
- Identifying a minimal class of models for high-dimensional data
- Interior-point methods for optimization
- Iterative Methods for Total Variation Denoising
- Locally adaptive regression splines
- M-matrix characterizations. I: nonsingular M-matrices
- Minimization of Akaike's information criterion in linear regression analysis via mixed integer nonlinear program
- Mixed-integer nonlinear programs featuring ``on/off constraints
- Multi-label Markov random fields as an efficient and effective tool for image segmentation, total variations and regularization
- Nearly unbiased variable selection under minimax concave penalty
- Nonlinear total variation based noise removal algorithms
- OR forum: An algorithmic approach to linear regression
- On constrained and regularized high-dimensional regression
- On factor width and symmetric \(H\)-matrices
- On integer and MPCC representability of affine sparsity
- On mathematical programming with indicator constraints
- On recurring theorems on diagonal dominance
- Perspective cuts for a class of convex 0-1 mixed integer programs
- Perspective reformulations of mixed integer nonlinear programs with indicator variables
- Properties and refinements of the fused Lasso
- Quadratic cone cutting surfaces for quadratic programs with on-off constraints
- Quadratic convex reformulations for semicontinuous quadratic programming
- Regression shrinkage and selection via the Lasso: a retrospective
- Regularization and Variable Selection Via the Elastic Net
- Rejoinder: ``Best subset, forward stepwise or Lasso? Analysis and recommendations based on extensive comparisons
- Scalable algorithms for the sparse ridge regression
- Second-order cone programming
- Simplex QP-based methods for minimizing a conic quadratic objective over polyhedra
- Sparse high-dimensional regression: exact scalable algorithms and phase transitions
- Sparse learning via Boolean relaxations
- SparseNet: coordinate descent with nonconvex penalties
- Sparsity and Smoothness Via the Fused Lasso
- Stable recovery of sparse overcomplete representations in the presence of noise
- Strong formulations for quadratic optimization with M-matrices and indicator variables
- Strong formulations of robust mixed 0-1 programming
- Structural properties of affine sparsity constraints
- Structured sparsity via alternating direction methods
- Submodularity in Conic Quadratic Mixed 0–1 Optimization
- 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 smooth-Lasso and other \(\ell _{1}+\ell _{2}\)-penalized methods
- The solution path of the generalized lasso
Cited in
(18)- Group sparse structural smoothing recovery: model, statistical properties and algorithm
- Cardinality minimization, constraints, and regularization: a survey
- 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
- An Improved Smoothed $\ell^0$ Approximation Algorithm for Sparse Representation
- Outlier detection in time series via mixed-integer conic quadratic optimization
- On the _1-norm invariant convex k-sparse decomposition of signals
- A Unitarily Constrained Total Least Squares Problem in Signal Processing
- Constrained optimization of rank-one functions with indicator variables
- The equivalence of optimal perspective formulation and Shor's SDP for quadratic programs with indicator variables
- Supermodularity and valid inequalities for quadratic optimization with indicators
- BranchHull: convex bilinear inversion from the entrywise product of signals with known signs
- On the convexification of constrained quadratic optimization problems with indicator variables
- Ideal formulations for constrained convex optimization problems with indicator variables
- Linear-step solvability of some folded concave and singly-parametric sparse optimization problems
- Comparing solution paths of sparse quadratic minimization with a Stieltjes matrix
- On the convex hull of convex quadratic optimization problems with indicators
Describes a project that uses
Uses Software
This page was built for publication: Sparse and smooth signal estimation: convexification of \(\ell_0\)-formulations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4998944)
