DC approximation approaches for sparse optimization
From MaRDI portal
(Redirected from Publication:319281)
Abstract: Sparse optimization refers to an optimization problem involving the zero-norm in objective or constraints. In this paper, nonconvex approximation approaches for sparse optimization have been studied with a unifying point of view in DC (Difference of Convex functions) programming framework. Considering a common DC approximation of the zero-norm including all standard sparse inducing penalty functions, we studied the consistency between global minimums (resp. local minimums) of approximate and original problems. We showed that, in several cases, some global minimizers (resp. local minimizers) of the approximate problem are also those of the original problem. Using exact penalty techniques in DC programming, we proved stronger results for some particular approximations, namely, the approximate problem, with suitable parameters, is equivalent to the original problem. The efficiency of several sparse inducing penalty functions have been fully analyzed. Four DCA (DC Algorithm) schemes were developed that cover all standard algorithms in nonconvex sparse approximation approaches as special versions. They can be viewed as, an -perturbed algorithm / reweighted- algorithm / reweighted- algorithm. We offer a unifying nonconvex approximation approach, with solid theoretical tools as well as efficient algorithms based on DC programming and DCA, to tackle the zero-norm and sparse optimization. As an application, we implemented our methods for the feature selection in SVM (Support Vector Machine) problem and performed empirical comparative numerical experiments on the proposed algorithms with various approximation functions.
Recommendations
- A successive convex approximation approach for sparse solutions of convex programs
- DC approximation approach for \(\ell_0\)-minimization in compressed sensing
- Feature selection in machine learning: an exact penalty approach using a difference of convex function algorithm
- scientific article; zbMATH DE number 7339434
- Solving nonnegative sparsity-constrained optimization via DC quadratic-piecewise-linear approximations
Cites work
- scientific article; zbMATH DE number 1215260 (Why is no real title available?)
- scientific article; zbMATH DE number 845714 (Why is no real title available?)
- scientific article; zbMATH DE number 3320765 (Why is no real title available?)
- 10.1162/153244303322753751
- A D.C. Optimization Algorithm for Solving the Trust-Region Subproblem
- A DC programming approach for feature selection in support vector machines learning
- A DC programming approach for solving the symmetric eigenvalue complementarity problem
- A Difference of Convex Functions Algorithm for Switched Linear Regression
- A bilinear formulation for vector sparsity optimization
- A continuous DC programming approach to the strategic supply chain design problem from qualified partner set
- A continuous approach for the concave cost supply problem via DC programming and DCA
- A new efficient algorithm based on DC programming and DCA for clustering
- An affine scaling methodology for best basis selection
- An efficient algorithm for globally minimizing a quadratic function under convex quadratic constraints
- An efficient combined DCA and B\&B using DC/SDP relaxation for globally solving binary quadratic programs
- Binary classification via spherical separator by DC programming and DCA
- Block clustering based on difference of convex functions (DC) programming and DC algorithms
- Combination between global and local methods for solving an optimization problem over the efficient set
- Combined SVM-based feature selection and classification
- Concave programming for minimizing the zero-norm over polyhedral sets
- Convex analysis approach to d. c. programming: Theory, algorithms and applications
- DC Programming Approach for a Class of Nonconvex Programs Involving l 0 Norm
- DC programming and DCA for general DC programs
- DC programming approaches for distance geometry problems
- Decoding by Linear Programming
- Enhancing sparsity by reweighted \(\ell _{1}\) minimization
- Exact penalty and error bounds in DC programming
- Feature selection for linear SVMs under uncertain data: robust optimization based on difference of convex functions algorithms
- Feature selection in machine learning: an exact penalty approach using a difference of convex function algorithm
- Gene selection for cancer classification using support vector machines
- Highly Robust Error Correction byConvex Programming
- Large-Scale Molecular Optimization from Distance Matrices by a D.C. Optimization Approach
- Learning sparse classifiers with difference of convex functions algorithms
- Long-short portfolio optimization under cardinality constraints by difference of convex functions algorithm
- Lower bound theory of nonzero entries in solutions of \(\ell_2-\ell_p\) minimization
- Matching pursuits with time-frequency dictionaries
- Multicategory ψ-Learning
- One-step sparse estimates in nonconcave penalized likelihood models
- Optimization based DC programming and DCA for hierarchical clustering
- Parsimonious least norm approximation
- Recovering Sparse Signals With a Certain Family of Nonconvex Penalties and DC Programming
- Self-organizing maps by difference of convex functions optimization
- Solving a class of linearly constrained indefinite quadratic problems by DC algorithms
- Solving the minimum M-dominating set problem by a continuous optimization approach based on DC programming and DCA
- Some sharp performance bounds for least squares regression with L₁ regularization
- Sparse Approximate Solutions to Linear Systems
- Sparse high-dimensional fractional-norm support vector machine via DC programming
- Sparse representations in unions of bases
- Support-vector networks
- The Adaptive Lasso and Its Oracle Properties
- The DC (Difference of convex functions) programming and DCA revisited with DC models of real world nonconvex optimization problems
- Variable Selection via Nonconcave Penalized Likelihood and its Oracle Properties
Cited in
(79)- A necessary and sufficient condition for sparse vector recovery via \(\ell_1-\ell_2\) minimization
- Estimation of \(l_0\) norm penalized models: a statistical treatment
- Proximal variable metric method with spectral diagonal update for large scale sparse optimization
- Convergence rate analysis of an extrapolated proximal difference-of-convex algorithm
- Efficient nonnegative matrix factorization by DC programming and DCA
- Continuous exact relaxation and alternating proximal gradient algorithm for partial sparse and partial group sparse optimization problems
- \(\boldsymbol{L_1-\beta L_q}\) Minimization for Signal and Image Recovery
- Distributed nonconvex constrained optimization over time-varying digraphs
- On the pervasiveness of difference-convexity in optimization and statistics
- Solving an infinite-horizon discounted Markov decision process by DC programming and DCA
- DC Programming Approach for a Class of Nonconvex Programs Involving l 0 Norm
- Regularized distributionally robust optimization with application to the index tracking problem
- Penalty method for the sparse portfolio optimization problem
- A three-operator splitting algorithm with deviations for generalized DC programming
- A successive convex approximation approach for sparse solutions of convex programs
- Algorithmic versatility of SPF-regularization methods
- Difference-of-convex learning: directional stationarity, optimality, and sparsity
- Composite difference-MAX programs for modern statistical estimation problems
- Minimization of transformed L₁ penalty: theory, difference of convex function algorithm, and robust application in compressed sensing
- Cardinality minimization, constraints, and regularization: a survey
- DC formulations and algorithms for sparse optimization problems
- Sparse recovery based on the generalized error function
- A unified view of exact continuous penalties for \(\ell_2\)-\(\ell_0\) minimization
- DC programming and DCA: thirty years of developments
- Novel DCA based algorithms for a special class of nonconvex problems with application in machine learning
- On choosing initial values of iteratively reweighted \(\ell_1\) algorithms for the piece-wise exponential penalty
- Global optimization for sparse solution of least squares problems
- DC approximation approach for \(\ell_0\)-minimization in compressed sensing
- On a DC-optimization-problem from statistical factor analysis
- The smoothing objective penalty function method for two-cardinality sparse constrained optimization problems
- A LogTVSCAD nonconvex regularization model for image deblurring in the presence of impulse noise
- Sparse covariance matrix estimation by DCA-based algorithms
- Consistency bounds and support recovery of d-stationary solutions of sparse sample average approximations
- Solving nonnegative sparsity-constrained optimization via DC quadratic-piecewise-linear approximations
- Neural network for a class of sparse optimization with \(L_0\)-regularization
- Sparsity constrained optimization problems via disjunctive programming
- Difference of convex functions algorithms (DCA) for image restoration via a Markov random field model
- Heuristics for Finding Sparse Solutions of Linear Inequalities
- A variable metric and Nesterov extrapolated proximal DCA with backtracking for a composite DC program
- A global two-stage algorithm for non-convex penalized high-dimensional linear regression problems
- A new sufficient condition for sparse vector recovery via \(\ell_1\)-\( \ell_2\) local minimization
- DC programming and DCA for enhancing physical layer security via cooperative jamming
- A multi-kernel support tensor machine for classification with multitype multiway data and an application to cross-selling recommendations
- Sparse Solutions by a Quadratically Constrained ℓq (0 <q< 1) Minimization Model
- Structural properties of affine sparsity constraints
- DC programming and DCA for a novel resource allocation problem in emerging area of cooperative physical layer security
- DC optimization for constructing discrete Sugeno integrals and learning nonadditive measures
- Sparse estimation via lower-order penalty optimization methods in high-dimensional linear regression
- scientific article; zbMATH DE number 7306909 (Why is no real title available?)
- Stochastic DCA for sparse multiclass logistic regression
- Alternating DCA for reduced-rank multitask linear regression with covariance matrix estimation
- Feature selection in machine learning: an exact penalty approach using a difference of convex function algorithm
- Alternating direction method of multipliers for truss topology optimization with limited number of nodes: a cardinality-constrained second-order cone programming approach
- DCA for Gaussian kernel support vector machines with feature selection
- Solving a centralized dynamic group key management problem by an optimization approach
- DC programming and DCA for enhancing physical layer security via relay beamforming strategies
- Correntropy-based metric for robust twin support vector machine
- Open issues and recent advances in DC programming and DCA
- A unified Bregman alternating minimization algorithm for generalized DC programs with application to imaging
- A robust regression framework with Laplace kernel-induced loss
- Stochastic difference-of-convex-functions algorithms for nonconvex programming
- A unified DC programming framework and efficient DCA based approaches for large scale batch reinforcement learning
- Stochastic DCA for minimizing a large sum of DC functions with application to multi-class logistic regression
- scientific article; zbMATH DE number 7733439 (Why is no real title available?)
- scientific article; zbMATH DE number 7594592 (Why is no real title available?)
- Computation of second-order directional stationary points for group sparse optimization
- Group variable selection via \(\ell_{p,0}\) regularization and application to optimal scoring
- Solving constrained nonsmooth group sparse optimization via group Capped-\(\ell_1\) relaxation and group smoothing proximal gradient algorithm
- Accelerated iterative hard thresholding algorithm for \(l_0\) regularized regression problem
- A smoothing method for sparse optimization over convex sets
- Linear-step solvability of some folded concave and singly-parametric sparse optimization problems
- scientific article; zbMATH DE number 7339434 (Why is no real title available?)
- The modified second APG method for DC optimization problems
- DC programming and DCA for solving Brugnano-Casulli piecewise linear systems
- DCA based algorithms for feature selection in multi-class support vector machine
- Difference-of-Convex Algorithms for a Class of Sparse Group $\ell_0$ Regularized Optimization Problems
- Comparing solution paths of sparse quadratic minimization with a Stieltjes matrix
- Adaptive robust adaboost-based twin support vector machine with universum data
- A new conceptual framework for the therapy by optimized multidimensional pulses of therapeutic activity. The case of multiple myeloma model
This page was built for publication: DC approximation approaches for sparse optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q319281)
