Pages that link to "Item:Q319281"

The following pages link to DC approximation approaches for sparse optimization (Q319281):

Displaying 27 items.

• A Robust Regression Framework with Laplace Kernel-Induced Loss (Q5380865) (← links)
• Sparse Covariance Matrix Estimation by DCA-Based Algorithms (Q5380866) (← links)
• Algorithmic versatility of SPF-regularization methods (Q5856262) (← links)
• Stochastic Difference-of-Convex-Functions Algorithms for Nonconvex Programming (Q5869814) (← links)
• Solving constrained nonsmooth group sparse optimization via group Capped-\(\ell_1\) relaxation and group smoothing proximal gradient algorithm (Q6043130) (← links)
• Heuristics for Finding Sparse Solutions of Linear Inequalities (Q6053490) (← links)
• Neural network for a class of sparse optimization with \(L_0\)-regularization (Q6077003) (← links)
• Proximal variable metric method with spectral diagonal update for large scale sparse optimization (Q6099831) (← links)
• Comparing solution paths of sparse quadratic minimization with a Stieltjes matrix (Q6120849) (← links)
• Adaptive robust adaboost-based twin support vector machine with universum data (Q6122252) (← links)
• (Q6137264) (← links)
• Convergence rate analysis of an extrapolated proximal difference-of-convex algorithm (Q6138297) (← links)
• \(\boldsymbol{L_1-\beta L_q}\) Minimization for Signal and Image Recovery (Q6144050) (← links)
• A three-operator splitting algorithm with deviations for generalized DC programming (Q6169253) (← links)
• A variable metric and Nesterov extrapolated proximal DCA with backtracking for a composite DC program (Q6175368) (← links)
• A global two-stage algorithm for non-convex penalized high-dimensional linear regression problems (Q6177008) (← links)
• Open issues and recent advances in DC programming and DCA (Q6200375) (← links)
• Estimation of \(l_0\) norm penalized models: a statistical treatment (Q6554254) (← links)
• Continuous exact relaxation and alternating proximal gradient algorithm for partial sparse and partial group sparse optimization problems (Q6569683) (← links)
• Regularized distributionally robust optimization with application to the index tracking problem (Q6573374) (← links)
• Penalty method for the sparse portfolio optimization problem (Q6574067) (← links)
• Cardinality minimization, constraints, and regularization: a survey (Q6585278) (← links)
• On choosing initial values of iteratively reweighted \(\ell_1\) algorithms for the piece-wise exponential penalty (Q6587598) (← links)
• Sparse recovery based on the generalized error function (Q6616997) (← links)
• DCA for Gaussian kernel support vector machines with feature selection (Q6629042) (← links)
• Solving a centralized dynamic group key management problem by an optimization approach (Q6629060) (← links)
• A unified Bregman alternating minimization algorithm for generalized DC programs with application to imaging (Q6639517) (← links)