Continuous exact relaxation and alternating proximal gradient algorithm for partial sparse and partial group sparse optimization problems

DOI10.1007/S10915-024-02584-4MaRDI QIDQ6569683FDOQ6569683

Authors: Qingqing Wu, Dingtao Peng, Xian Zhang 

Publication date: 9 July 2024

Published in: Journal of Scientific Computing (Search for Journal in Brave)

Recommendations

• Solving constrained nonsmooth group sparse optimization via group Capped-\(\ell_1\) relaxation and group smoothing proximal gradient algorithm
• Difference-of-Convex Algorithms for a Class of Sparse Group $\ell_0$ Regularized Optimization Problems
• scientific article; zbMATH DE number 7594592
• Partial gradient optimal thresholding algorithms for a class of sparse optimization problems
• A smoothing proximal gradient algorithm with extrapolation for the relaxation of \({\ell_0}\) regularization problem

zbMATH Keywords

stationary pointwhole sequence convergencealternating proximal gradient algorithmcontinuous exact relaxationpartial sparse and partial group sparse optimization problem

Mathematics Subject Classification ID

Optimality conditions and duality in mathematical programming (90C46) Nonconvex programming, global optimization (90C26)

Cites Work

• Probing the Pareto frontier for basis pursuit solutions
• Nearly unbiased variable selection under minimax concave penalty
• Variable Selection via Nonconcave Penalized Likelihood and its Oracle Properties
• Analysis of multi-stage convex relaxation for sparse regularization
• Model Selection and Estimation in Regression with Grouped Variables
• The composite absolute penalties family for grouped and hierarchical variable selection
• A group bridge approach for variable selection
• Title not available (Why is that?)
• Statistical challenges with high dimensionality: feature selection in knowledge discovery
• The benefit of group sparsity
• Proximal Alternating Minimization and Projection Methods for Nonconvex Problems: An Approach Based on the Kurdyka-Łojasiewicz Inequality
• Proximal alternating linearized minimization for nonconvex and nonsmooth problems
• Lower bound theory of nonzero entries in solutions of \(\ell_2-\ell_p\) minimization
• Compressed Sensing With Nonlinear Observations and Related Nonlinear Optimization Problems
• The Łojasiewicz Inequality for Nonsmooth Subanalytic Functions with Applications to Subgradient Dynamical Systems
• A continuous exact \(\ell_0\) penalty (CEL0) for least squares regularized problem
• On the convergence of the proximal algorithm for nonsmooth functions involving analytic features
• Learning sparse classifiers with difference of convex functions algorithms
• DC approximation approaches for sparse optimization
• Computing B-stationary points of nonsmooth DC programs
• Group sparse optimization via \(\ell_{p,q}\) regularization
• The \(\ell_{2,q}\) regularized group sparse optimization: lower bound theory, recovery bound and algorithms
• A unified view of exact continuous penalties for \(\ell_2\)-\(\ell_0\) minimization
• Group descent algorithms for nonconvex penalized linear and logistic regression models with grouped predictors
• Group Sparse Recovery via the $\ell ^0(\ell ^2)$ Penalty: Theory and Algorithm
• Optimality and complexity for constrained optimization problems with nonconvex regularization
• Alternating structure-adapted proximal gradient descent for nonconvex nonsmooth block-regularized problems
• Difference-of-Convex Algorithms for a Class of Sparse Group $\ell_0$ Regularized Optimization Problems
• An efficient Hessian based algorithm for solving large-scale sparse group Lasso problems
• Group variable selection via \(\ell_{p,0}\) regularization and application to optimal scoring
• Group Sparse Optimization for Images Recovery Using Capped Folded Concave Functions
• Solving constrained nonsmooth group sparse optimization via group Capped-\(\ell_1\) relaxation and group smoothing proximal gradient algorithm
• Computation of second-order directional stationary points for group sparse optimization
• Solution sets of three sparse optimization problems for multivariate regression
• A singular value shrinkage thresholding algorithm for folded concave penalized low-rank matrix optimization problems
• Smoothing composite proximal gradient algorithm for sparse group Lasso problems with nonsmooth loss functions

This page was built for publication: Continuous exact relaxation and alternating proximal gradient algorithm for partial sparse and partial group sparse optimization problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6569683)