Sparse Approximation via Penalty Decomposition Methods
From MaRDI portal
Abstract: In this paper we consider sparse approximation problems, that is, general minimization problems with the -"norm" of a vector being a part of constraints or objective function. In particular, we first study the first-order optimality conditions for these problems. We then propose penalty decomposition (PD) methods for solving them in which a sequence of penalty subproblems are solved by a block coordinate descent (BCD) method. Under some suitable assumptions, we establish that any accumulation point of the sequence generated by the PD methods satisfies the first-order optimality conditions of the problems. Furthermore, for the problems in which the part is the only nonconvex part, we show that such an accumulation point is a local minimizer of the problems. In addition, we show that any accumulation point of the sequence generated by the BCD method is a saddle point of the penalty subproblem. Moreover, for the problems in which the part is the only nonconvex part, we establish that such an accumulation point is a local minimizer of the penalty subproblem. Finally, we test the performance of our PD methods by applying them to sparse logistic regression, sparse inverse covariance selection, and compressed sensing problems. The computational results demonstrate that our methods generally outperform the existing methods in terms of solution quality and/or speed.
Recommendations
- Optimization with sparsity-inducing penalties
- Sparse representations and approximation theory
- Penalty decomposition methods for rank minimization
- Computational approaches to non-convex, sparsity-inducing multi-penalty regularization
- Sparse approximations with interior point methods
- Sparsity in penalized empirical risk minimization
- Sparse approximation by greedy algorithms
- Sparse Regularization via Convex Analysis
- scientific article; zbMATH DE number 7750674
- Sparse Approximate Solutions to Linear Systems
Cited in
(only showing first 100 items - show all)- Restricted Robinson constraint qualification and optimality for cardinality-constrained cone programming
- Minimization of transformed L₁ penalty: theory, difference of convex function algorithm, and robust application in compressed sensing
- Optimality conditions for locally Lipschitz optimization with l₀-regularization
- Sparse approximate reconstruction decomposed by two optimization problems
- Lagrangian duality and saddle points for sparse linear programming
- Efficient regularized regression with \(L_0\) penalty for variable selection and network construction
- Linear convergence of inexact descent method and inexact proximal gradient algorithms for lower-order regularization problems
- Tractable ADMM schemes for computing KKT points and local minimizers for \(\ell_0\)-minimization problems
- Convergent inexact penalty decomposition methods for cardinality-constrained problems
- An extended Newton-type algorithm for \(\ell_2\)-regularized sparse logistic regression and its efficiency for classifying large-scale datasets
- A continuous relaxation of the constrained \(\ell_2-\ell_0\) problem
- Iterative Potts minimization for the recovery of signals with discontinuities from indirect measurements: the multivariate case
- An effective procedure for feature subset selection in logistic regression based on information criteria
- Weighted thresholding homotopy method for sparsity constrained optimization
- A Lagrange-Newton algorithm for sparse nonlinear programming
- Tucker-3 decomposition with sparse core array using a penalty function based on Gini-index
- On nondegenerate M-stationary points for sparsity constrained nonlinear optimization
- Alternating DC algorithm for partial DC programming problems
- Sparse solutions to an underdetermined system of linear equations via penalized Huber loss
- Malitsky-Tam forward-reflected-backward splitting method for nonconvex minimization problems
- An inexact proximal DC algorithm with sieving strategy for rank constrained least squares semidefinite programming
- Penalized least square in sparse setting with convex penalty and non Gaussian errors
- Proximal algorithm for minimization problems in \(l_0\)-regularization for nonlinear inverse problems
- A difference-of-convex approach for split feasibility with applications to matrix factorizations and outlier detection
- A parameterized Douglas-Rachford splitting algorithm for nonconvex optimization
- Solving \(\ell_0\)-penalized problems with simple constraints via the Frank-Wolfe reduced dimension method
- A penalty decomposition method for rank minimization problem with affine constraints
- An augmented Lagrangian proximal alternating method for sparse discrete optimization problems
- An active set Barzilar-Borwein algorithm for \(l_0\) regularized optimization
- Accelerated iterative hard thresholding algorithm for \(l_0\) regularized regression problem
- Nonsmooth sparsity constrained optimization problems: optimality conditions
- Alternating direction method of multipliers for solving dictionary learning models
- Optimality conditions for sparse nonlinear programming
- Generalized sparse recovery model and its neural dynamical optimization method for compressed sensing
- A refined convergence analysis of \(\mathrm{pDCA}_{e}\) with applications to simultaneous sparse recovery and outlier detection
- Perturbed proximal primal-dual algorithm for nonconvex nonsmooth optimization
- A successive difference-of-convex approximation method for a class of nonconvex nonsmooth optimization problems
- On solutions of sparsity constrained optimization
- The first-order necessary conditions for sparsity constrained optimization
- Newton method for \(\ell_0\)-regularized optimization
- On the minimization over sparse symmetric sets: projections, optimality conditions, and algorithms
- An efficient optimization approach for a cardinality-constrained index tracking problem
- A penalty decomposition method for the optimization problem with two 0-norm constraints
- Splitting augmented Lagrangian method for optimization problems with a cardinality constraint and semicontinuous variables
- Exact penalty decomposition method for zero-norm minimization based on MPEC formulation
- Penalty decomposition methods for rank minimization
- Douglas-Rachford splitting for nonconvex optimization with application to nonconvex feasibility problems
- The non-convex sparse problem with nonnegative constraint for signal reconstruction
- Sparse approximation based on a random overcomplete basis
- Testing Sparsity-Inducing Penalties
- Proximal mapping for symmetric penalty and sparsity
- Iterative hard thresholding methods for \(l_0\) regularized convex cone programming
- Iterative reweighted minimization methods for \(l_p\) regularized unconstrained nonlinear programming
- Selection and Fusion of Categorical Predictors with L0-Type Penalties
- Sparse inverse covariance matrix estimation via the _0-norm with Tikhonov regularization
- On the Solution of ℓ0-Constrained Sparse Inverse Covariance Estimation Problems
- Global and quadratic convergence of Newton hard-thresholding pursuit
- Sparsity constrained optimization problems via disjunctive programming
- Global optimization for sparse solution of least squares problems
- A penalty decomposition approach for multi-objective cardinality-constrained optimization problems
- Column \(\ell_{2,0}\)-norm regularized factorization model of low-rank matrix recovery and its computation
- A subgradient-based approach for finding the maximum feasible subsystem with respect to a set
- Sparse Recovery via Partial Regularization: Models, Theory, and Algorithms
- Minimization of \(\ell_{1-2}\) for compressed sensing
- A penalty PALM method for sparse portfolio selection problems
- A unified view of exact continuous penalties for _2-_0 minimization
- _0-minimization methods for image restoration problems based on wavelet frames
- A successive convex approximation approach for sparse solutions of convex programs
- Weakly decomposable regularization penalties and structured sparsity
- scientific article; zbMATH DE number 5259795 (Why is no real title available?)
- Dynamic string‐averaging CQ‐methods for the split feasibility problem with percentage violation constraints arising in radiation therapy treatment planning
- Solution sets of three sparse optimization problems for multivariate regression
- Complex portfolio selection via convex mixed‐integer quadratic programming: a survey
- A penalty decomposition algorithm with greedy improvement for mean‐reverting portfolios with sparsity and volatility constraints
- A unifying framework for sparsity-constrained optimization
- Accelerated smoothing hard thresholding algorithms for \(\ell_0\) regularized nonsmooth convex regression problem
- Inexact penalty decomposition methods for optimization problems with geometric constraints
- Sparse representations and approximation theory
- Second-Order Conditions for the Existence of Augmented Lagrange Multipliers for Sparse Optimization
- Cardinality-Constrained Multi-objective Optimization: Novel Optimality Conditions and Algorithms
- Efficient Convex Optimization for Non-convex Non-smooth Image Restoration
- On the convergence of inexact alternate minimization in problems with \(\ell_0\) penalties
- Cardinality minimization, constraints, and regularization: a survey
- A quadratic penalty method for hypergraph matching
- Sparse extended mean-variance-CVaR portfolios with short-selling
- An exact penalty approach for general ℓ 0 -sparse optimization problems
- Nonconvex regularizer and homotopy-based sparse optimization: convergent algorithms and applications
- Extrapolated hard thresholding algorithms with finite length for composite _0 penalized problems
- Probabilistic iterative hard thresholding for sparse learning
- A two-level simultaneous orthogonal matching pursuit algorithm for simultaneous sparse approximation problems
- An efficient asymptotic DC method for sparse and low-rank matrix recovery
- Sparsity penalized mean-variance portfolio selection: analysis and computation
- Iterative mix thresholding algorithm with continuation technique for mix sparse optimization and application
- An inexact proximal DC algorithm for the large-scale cardinality constrained mean-variance model in sparse portfolio selection
- Poisson image deblurring with frame-based nonconvex regularization
- An inexact projected regularized Newton method for fused zero-norms regularization problems
- Simultaneous factors selection and fusion of their levels in penalized logistic regression
- Sparse projection onto semi-symmetric sets with applications to sparse optimization
- Second-order optimality conditions for sparse optimization via Fréchet second-order subdifferential
- Optimality conditions for group sparsity constrained optimization problems with equality and inequality constraints
This page was built for publication: Sparse Approximation via Penalty Decomposition Methods
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5408227)
