Optimization problems involving group sparsity terms
From MaRDI portal
Publication:2330642
DOI10.1007/s10107-018-1277-1zbMath1430.90465OpenAlexW2799615326MaRDI QIDQ2330642
Publication date: 22 October 2019
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10107-018-1277-1
Related Items
Nonconvex flexible sparsity regularization: theory and monotone numerical schemes, Difference-of-Convex Algorithms for a Class of Sparse Group $\ell_0$ Regularized Optimization Problems, Solving constrained nonsmooth group sparse optimization via group Capped-\(\ell_1\) relaxation and group smoothing proximal gradient algorithm, Local optimality for stationary points of group zero-norm regularized problems and equivalent surrogates, Multilevel Objective-Function-Free Optimization with an Application to Neural Networks Training, Constrained composite optimization and augmented Lagrangian methods, A Regularized Newton Method for \({\boldsymbol{\ell}}_{q}\) -Norm Composite Optimization Problems, A singular value shrinkage thresholding algorithm for folded concave penalized low-rank matrix optimization problems, Smoothing accelerated proximal gradient method with fast convergence rate for nonsmooth convex optimization beyond differentiability, A Path-Based Approach to Constrained Sparse Optimization, Unnamed Item, High-order evaluation complexity for convexly-constrained optimization with non-Lipschitzian group sparsity terms, Subspace quadratic regularization method for group sparse multinomial logistic regression, Group Sparse Optimization for Images Recovery Using Capped Folded Concave Functions
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The sparse principal component analysis problem: optimality conditions and algorithms
- Proximal alternating linearized minimization for nonconvex and nonsmooth problems
- The unconstrained binary quadratic programming problem: a survey
- Iterative hard thresholding for compressed sensing
- On the asymptotic properties of the group lasso estimator for linear models
- On the Minimization Over Sparse Symmetric Sets: Projections, Optimality Conditions, and Algorithms
- Sparsity Constrained Nonlinear Optimization: Optimality Conditions and Algorithms
- Introduction to Nonlinear Optimization
- Group-Sparse Model Selection: Hardness and Relaxations
- Portfolio Optimization and Performance Analysis
- Sparse and Redundant Representations
- The Group Lasso for Logistic Regression
- On the Reconstruction of Block-Sparse Signals With an Optimal Number of Measurements
- Block-Sparse Signals: Uncertainty Relations and Efficient Recovery
- Structured Compressed Sensing: From Theory to Applications
- Proximal Mapping for Symmetric Penalty and Sparsity
- Robust Recovery of Signals From a Structured Union of Subspaces
- Sampling Theorems for Signals From the Union of Finite-Dimensional Linear Subspaces
- Model-Based Compressive Sensing
- Simulation and the Monte Carlo Method
- Model Selection and Estimation in Regression with Grouped Variables
- Proximité et dualité dans un espace hilbertien
