Solution sets of three sparse optimization problems for multivariate regression

DOI10.1007/S10898-021-01124-WMaRDI QIDQ6064025

Xiaojun Chen, Nai-Hua Xiu, Li-Li Pan

Publication date: 8 November 2023

Published in: Journal of Global Optimization (Search for Journal in Brave)

zbMATH Keywords

stationary pointmultivariate regressionlocal minimizerglobal minimizersparse optimizationrow selection problem

Mathematics Subject Classification ID

Computational methods for sparse matrices (65F50) Nonconvex programming, global optimization (90C26) Optimality conditions and duality in mathematical programming (90C46) Combinatorial optimization (90C27)

Related Items (4)

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

Cites Work

• Best subset selection via a modern optimization lens
• Wavelet inpainting with the \(\ell_{0}\) sparse regularization
• Relationship between the optimal solutions of least squares regularized with \(\ell_{0}\)-norm and constrained by \(k\)-sparsity
• Constraint qualifications and optimality conditions for optimization problems with cardinality constraints
• Restricted normal cones and sparsity optimization with affine constraints
• 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
• A Frank--Wolfe type theorem for convex polynomial programs
• Generalized subdifferentials of the rank function
• On rank awareness, thresholding, and MUSIC for joint sparse recovery
• Sharp sufficient conditions for stable recovery of block sparse signals by block orthogonal matching pursuit
• Optimality conditions for sparse nonlinear programming
• On the number of iterations for convergence of CoSaMP and subspace pursuit algorithms
• Support union recovery in high-dimensional multivariate regression
• On the Minimization Over Sparse Symmetric Sets: Projections, Optimality Conditions, and Algorithms
• Sparsity Constrained Nonlinear Optimization: Optimality Conditions and Algorithms
• Description of the Minimizers of Least Squares Regularized with $\ell_0$-norm. Uniqueness of the Global Minimizer
• On optimal solutions of the constrained ℓ ₀ regularization and its penalty problem
• Probing the Pareto Frontier for Basis Pursuit Solutions
• Variational Analysis
• Theoretical Results on Sparse Representations of Multiple-Measurement Vectors
• Group Sparse Recovery via the $\ell ^0(\ell ^2)$ Penalty: Theory and Algorithm
• Sparse Approximate Solutions to Linear Systems
• Subspace Methods for Joint Sparse Recovery
• A Convex Model for Nonnegative Matrix Factorization and Dimensionality Reduction on Physical Space
• Visual Classification With Multitask Joint Sparse Representation
• Sparse Approximation via Penalty Decomposition Methods
• Penalty Methods for a Class of Non-Lipschitz Optimization Problems
• Group Sparse Optimization for Images Recovery Using Capped Folded Concave Functions

This page was built for publication: Solution sets of three sparse optimization problems for multivariate regression