DC approximation approaches for sparse optimization

DOI10.1016/j.ejor.2014.11.031zbMath1346.90819arXiv1407.0286OpenAlexW2963769561MaRDI QIDQ319281

Tao Pham Dinh, Hoai An Le Thi, Xuan Thanh Vo, Hoai Minh Le

Publication date: 6 October 2016

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1407.0286

zbMATH Keywords

global optimization sparse optimization DC approximation function DC programming and DCA feature selection in SVM

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Derivative-free methods and methods using generalized derivatives (90C56)

Related Items

Sparsity constrained optimization problems via disjunctive programming, A unified DC programming framework and efficient DCA based approaches for large scale batch reinforcement learning, Global optimization for sparse solution of least squares problems, Difference of convex functions algorithms (DCA) for image restoration via a Markov random field model, A multi-kernel support tensor machine for classification with multitype multiway data and an application to cross-selling recommendations, DC programming and DCA for solving Brugnano-Casulli piecewise linear systems, DC programming and DCA for enhancing physical layer security via cooperative jamming, Composite Difference-Max Programs for Modern Statistical Estimation Problems, Alternating DCA for reduced-rank multitask linear regression with covariance matrix estimation, The smoothing objective penalty function method for two-cardinality sparse constrained optimization problems, A necessary and sufficient condition for sparse vector recovery via $\ell_1-\ell_2$ minimization, Difference-of-Convex Algorithms for a Class of Sparse Group $\ell_0$ Regularized Optimization Problems, Group variable selection via $\ell_{p,0}$ regularization and application to optimal scoring, Difference-of-Convex Learning: Directional Stationarity, Optimality, and Sparsity, Solving constrained nonsmooth group sparse optimization via group Capped-$\ell_1$ relaxation and group smoothing proximal gradient algorithm, Heuristics for Finding Sparse Solutions of Linear Inequalities, Neural network for a class of sparse optimization with $L_0$-regularization, A smoothing method for sparse optimization over convex sets, Solving an Infinite-Horizon Discounted Markov Decision Process by DC Programming and DCA, Proximal variable metric method with spectral diagonal update for large scale sparse optimization, Comparing solution paths of sparse quadratic minimization with a Stieltjes matrix, Adaptive robust adaboost-based twin support vector machine with universum data, Structural properties of affine sparsity constraints, Distributed nonconvex constrained optimization over time-varying digraphs, Convergence rate analysis of an extrapolated proximal difference-of-convex algorithm, $\boldsymbol{L_1-\beta L_q}$ Minimization for Signal and Image Recovery, A Unified View of Exact Continuous Penalties for $\ell_2$-$\ell_0$ Minimization, Sparse estimation via lower-order penalty optimization methods in high-dimensional linear regression, A three-operator splitting algorithm with deviations for generalized DC programming, 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, Open issues and recent advances in DC programming and DCA, Linear-step solvability of some folded concave and singly-parametric sparse optimization problems, A new conceptual framework for the therapy by optimized multidimensional pulses of therapeutic activity. The case of multiple myeloma model, Unnamed Item, Efficient Nonnegative Matrix Factorization by DC Programming and DCA, A Robust Regression Framework with Laplace Kernel-Induced Loss, Sparse Covariance Matrix Estimation by DCA-Based Algorithms, Unnamed Item, DC programming and DCA for enhancing physical layer security via relay beamforming strategies, On the pervasiveness of difference-convexity in optimization and statistics, Novel DCA based algorithms for a special class of nonconvex problems with application in machine learning, A LogTVSCAD nonconvex regularization model for image deblurring in the presence of impulse noise, DCA based algorithms for feature selection in multi-class support vector machine, DC programming and DCA: thirty years of developments, DC formulations and algorithms for sparse optimization problems, Minimization of transformed $L_1$ penalty: theory, difference of convex function algorithm, and robust application in compressed sensing, Consistency bounds and support recovery of d-stationary solutions of sparse sample average approximations, Alternating direction method of multipliers for truss topology optimization with limited number of nodes: a cardinality-constrained second-order cone programming approach, Computation of second-order directional stationary points for group sparse optimization, DC Approximation Approach for ℓ0-minimization in Compressed Sensing, DC Programming and DCA for a Novel Resource Allocation Problem in Emerging Area of Cooperative Physical Layer Security, Stochastic DCA for Sparse Multiclass Logistic Regression, Solving nonnegative sparsity-constrained optimization via DC quadratic-piecewise-linear approximations, Correntropy-based metric for robust twin support vector machine, Stochastic DCA for minimizing a large sum of DC functions with application to multi-class logistic regression, Accelerated iterative hard thresholding algorithm for $l_0$ regularized regression problem, The modified second APG method for DC optimization problems, Sparse Solutions by a Quadratically Constrained ℓq (0 <q< 1) Minimization Model, Unnamed Item, Algorithmic versatility of SPF-regularization methods, A new sufficient condition for sparse vector recovery via ℓ1 − ℓ2 local minimization, Stochastic Difference-of-Convex-Functions Algorithms for Nonconvex Programming

Cites Work