Solution sets of three sparse optimization problems for multivariate regression
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 7594592
- Relationship between the optimal solutions of least squares regularized with \(\ell_{0}\)-norm and constrained by \(k\)-sparsity
- On optimal solutions of the constrained \({\ell}_{0}\) regularization and its penalty problem
- Sparse solutions of a class of constrained optimization problems
- Global optimization for sparse solution of least squares problems
Cites work
- A Convex Model for Nonnegative Matrix Factorization and Dimensionality Reduction on Physical Space
- A Frank--Wolfe type theorem for convex polynomial programs
- A primal dual active set with continuation algorithm for the \(\ell^0\)-regularized optimization problem
- Algorithms for simultaneous sparse approximation. I: Greedy pursuit
- Algorithms for simultaneous sparse approximation. II: Convex relaxation
- Best subset selection via a modern optimization lens
- Constraint qualifications and optimality conditions for optimization problems with cardinality constraints
- Description of the minimizers of least squares regularized with _0-norm. Uniqueness of the global minimizer
- Generalized subdifferentials of the rank function
- Group Sparse Optimization for Images Recovery Using Capped Folded Concave Functions
- Group Sparse Recovery via the \ell ^0(\ell ^2) Penalty: Theory and Algorithm
- On optimal solutions of the constrained \({\ell}_{0}\) regularization and its penalty problem
- On rank awareness, thresholding, and MUSIC for joint sparse recovery
- On the minimization over sparse symmetric sets: projections, optimality conditions, and algorithms
- On the number of iterations for convergence of CoSaMP and subspace pursuit algorithms
- Optimality conditions for sparse nonlinear programming
- Penalty methods for a class of non-Lipschitz optimization problems
- Probing the Pareto frontier for basis pursuit solutions
- Relationship between the optimal solutions of least squares regularized with \(\ell_{0}\)-norm and constrained by \(k\)-sparsity
- Restricted normal cones and sparsity optimization with affine constraints
- Sharp sufficient conditions for stable recovery of block sparse signals by block orthogonal matching pursuit
- Sparse Approximate Solutions to Linear Systems
- Sparse Approximation via Penalty Decomposition Methods
- Sparsity constrained nonlinear optimization: optimality conditions and algorithms
- Subspace Methods for Joint Sparse Recovery
- Support union recovery in high-dimensional multivariate regression
- Theoretical Results on Sparse Representations of Multiple-Measurement Vectors
- Variational Analysis
- Visual Classification With Multitask Joint Sparse Representation
- Wavelet inpainting with the \(\ell_{0}\) sparse regularization
Cited in
(5)- Exact penalization for cardinality and rank-constrained optimization problems via partial regularization
- Optimality conditions for Tucker low-rank tensor optimization
- Matrix Optimization Problem Involving Group Sparsity and Nonnegativity Constraints
- Continuous exact relaxation and alternating proximal gradient algorithm for partial sparse and partial group sparse optimization problems
- Newton method for the composite row sparsity regularized optimization
This page was built for publication: Solution sets of three sparse optimization problems for multivariate regression
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6064025)
