Optimization problems involving group sparsity terms
From MaRDI portal
Recommendations
- Solving constrained nonsmooth group sparse optimization via group Capped-\(\ell_1\) relaxation and group smoothing proximal gradient algorithm
- Sparsity constrained nonlinear optimization: optimality conditions and algorithms
- Group sparse optimization via \(\ell_{p,q}\) regularization
- Proximal mapping for symmetric penalty and sparsity
- scientific article; zbMATH DE number 6253954
Cites work
- scientific article; zbMATH DE number 6118217 (Why is no real title available?)
- scientific article; zbMATH DE number 1818892 (Why is no real title available?)
- Block-Sparse Signals: Uncertainty Relations and Efficient Recovery
- Group-Sparse Model Selection: Hardness and Relaxations
- Introduction to nonlinear optimization: theory, algorithms, and applications with MATLAB
- Iterative hard thresholding for compressed sensing
- Model Selection and Estimation in Regression with Grouped Variables
- Model-Based Compressive Sensing
- On the Reconstruction of Block-Sparse Signals With an Optimal Number of Measurements
- On the asymptotic properties of the group lasso estimator for linear models
- On the minimization over sparse symmetric sets: projections, optimality conditions, and algorithms
- Portfolio Optimization and Performance Analysis
- Proximal alternating linearized minimization for nonconvex and nonsmooth problems
- Proximal mapping for symmetric penalty and sparsity
- Proximité et dualité dans un espace hilbertien
- Robust Recovery of Signals From a Structured Union of Subspaces
- Sampling Theorems for Signals From the Union of Finite-Dimensional Linear Subspaces
- Simulation and the Monte Carlo Method
- Sparse and redundant representations. From theory to applications in signal and image processing.
- Sparsity constrained nonlinear optimization: optimality conditions and algorithms
- Structured Compressed Sensing: From Theory to Applications
- Structured variable selection with sparsity-inducing norms
- The Group Lasso for Logistic Regression
- The sparse principal component analysis problem: optimality conditions and algorithms
- The unconstrained binary quadratic programming problem: a survey
Cited in
(28)- Constrained composite optimization and augmented Lagrangian methods
- Nonconvex flexible sparsity regularization: theory and monotone numerical schemes
- Group sparse optimization for inpainting of random fields on the sphere
- Smoothing accelerated proximal gradient method with fast convergence rate for nonsmooth convex optimization beyond differentiability
- A step function based recursion method for 0/1 deep neural networks
- Cardinality minimization, constraints, and regularization: a survey
- Optimality conditions for non-negative group sparse constrained optimization problems
- A singular value shrinkage thresholding algorithm for folded concave penalized low-rank matrix optimization problems
- A Regularized Newton Method for \({\boldsymbol{\ell}}_{q}\) -Norm Composite Optimization Problems
- High-order evaluation complexity for convexly-constrained optimization with non-Lipschitzian group sparsity terms
- Finding sparse solutions of systems of polynomial equations via group-sparsity optimization
- Local optimality for stationary points of group zero-norm regularized problems and equivalent surrogates
- Sparse projection onto semi-symmetric sets with applications to sparse optimization
- Smoothing proximal gradient block-coordinate algorithms for group sparse _0 regularized nonsmooth convex regression problem
- Optimality conditions for group sparsity constrained optimization problems with equality and inequality constraints
- Subspace quadratic regularization method for group sparse multinomial logistic regression
- Multilevel Objective-Function-Free Optimization with an Application to Neural Networks Training
- Nonconvex regularizer and homotopy-based sparse optimization: convergent algorithms and applications
- A Path-Based Approach to Constrained Sparse Optimization
- scientific article; zbMATH DE number 7594592 (Why is no real title available?)
- Computation of second-order directional stationary points for group sparse optimization
- The greedy simplex algorithm for double sparsity constrained optimization problems
- Solving constrained nonsmooth group sparse optimization via group Capped-\(\ell_1\) relaxation and group smoothing proximal gradient algorithm
- Matrix Optimization Problem Involving Group Sparsity and Nonnegativity Constraints
- Computing one-bit compressive sensing via zero-norm regularized DC loss model and its surrogate
- Group Sparse Optimization for Images Recovery Using Capped Folded Concave Functions
- Computing the proximal operator of the \(q\)-th power of the \(\ell_{1,q} \)-norm for group sparsity
- Difference-of-Convex Algorithms for a Class of Sparse Group \ell₀ Regularized Optimization Problems
This page was built for publication: Optimization problems involving group sparsity terms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2330642)
