Pages that link to "Item:Q1749443"

The following pages link to DC programming and DCA: thirty years of developments (Q1749443):

Displaying 50 items.

• Difference of convex algorithms for bilevel programs with applications in hyperparameter selection (Q2693651) (← links)
• Calmness of partial perturbation to composite rank constraint systems and its applications (Q2694518) (← links)
• A matrix nonconvex relaxation approach to unconstrained binary polynomial programs (Q2696928) (← links)
• Error bound and isocost imply linear convergence of DCA-based algorithms to D-stationarity (Q2697002) (← links)
• New regularity conditions and Fenchel dualities for DC optimization problems involving composite functions (Q4986403) (← links)
• (Q4999088) (← links)
• Convergence Rate Analysis of a Sequential Convex Programming Method with Line Search for a Class of Constrained Difference-of-Convex Optimization Problems (Q5010048) (← links)
• A new sufficient condition for sparse vector recovery via ℓ1 − ℓ2 local minimization (Q5016825) (← links)
• An Algorithm for Maximizing a Convex Function Based on Its Minimum (Q5060795) (← links)
• Robust projection twin support vector machine via DC programming (Q5077170) (← links)
• Difference-of-Convex Algorithms for a Class of Sparse Group $\ell_0$ Regularized Optimization Problems (Q5093646) (← links)
• A New Boosted Proximal Point Algorithm for Minimizing Nonsmooth DC Functions (Q5099775) (← links)
• Learning Markov Models Via Low-Rank Optimization (Q5106374) (← links)
• Convex Maximization via Adjustable Robust Optimization (Q5106408) (← links)
• Theory and Algorithms for Shapelet-Based Multiple-Instance Learning (Q5131159) (← links)
• Online Learning Based on Online DCA and Application to Online Classification (Q5131197) (← links)
• Smoothing techniques and difference of convex functions algorithms for image reconstructions (Q5131820) (← links)
• The Boosted Difference of Convex Functions Algorithm for Nonsmooth Functions (Q5221263) (← links)
• Nonmonotone Enhanced Proximal DC Algorithms for a Class of Structured Nonsmooth DC Programming (Q5242930) (← links)
• Algorithmic versatility of SPF-regularization methods (Q5856262) (← links)
• A Weighted Difference of Anisotropic and Isotropic Total Variation for Relaxed Mumford--Shah Color and Multiphase Image Segmentation (Q5860354) (← links)
• Efficient Boosted DC Algorithm for Nonconvex Image Restoration with Rician Noise (Q5863519) (← links)
• (Q5866396) (← links)
• Penalty and Augmented Lagrangian Methods for Constrained DC Programming (Q5868956) (← links)
• Stochastic Difference-of-Convex-Functions Algorithms for Nonconvex Programming (Q5869814) (← links)
• Asymptotic regularity for Lipschitzian nonlinear optimization problems with applications to complementarity constrained and bilevel programming (Q5879577) (← links)
• New Bregman proximal type algoritms for solving DC optimization problems (Q6043133) (← links)
• Optimality conditions in DC-constrained mathematical programming problems (Q6050158) (← links)
• Zero-norm regularized problems: equivalent surrogates, proximal MM method and statistical error bound (Q6051308) (← links)
• Heuristics for Finding Sparse Solutions of Linear Inequalities (Q6053490) (← links)
• Adaptively weighted difference model of anisotropic and isotropic total variation for image denoising (Q6085634) (← links)
• A Sequential Quadratic Programming Algorithm for Nonsmooth Problems with Upper- \({\boldsymbol{\mathcal{C}^2}}\) Objective (Q6093282) (← links)
• MAP inference algorithms without approximation for collective graphical models on path graphs via discrete difference of convex algorithm (Q6097141) (← links)
• Doubly iteratively reweighted algorithm for constrained compressed sensing models (Q6097766) (← links)
• Steering exact penalty DCA for nonsmooth DC optimisation problems with equality and inequality constraints (Q6113525) (← links)
• Conic optimization-based algorithms for nonnegative matrix factorization (Q6113533) (← links)
• Unified SVM algorithm based on LS-DC loss (Q6134358) (← links)
• Convergence rate analysis of an extrapolated proximal difference-of-convex algorithm (Q6138297) (← links)
• A proximal subgradient algorithm with extrapolation for structured nonconvex nonsmooth problems (Q6141533) (← links)
• Markov chain stochastic DCA and applications in deep learning with PDEs regularization (Q6143666) (← links)
• A bundle-type method for nonsmooth DC programs (Q6154409) (← links)
• DCACO: an algorithm for designing incoherent redundant matrices (Q6157452) (← links)
• DCA approaches for simultaneous wireless information power transfer in MISO secrecy channel (Q6159462) (← links)
• A refined inertial DC algorithm for DC programming (Q6159465) (← links)
• On solving difference of convex functions programs with linear complementarity constraints (Q6166653) (← links)
• A Nonlocal Graph-PDE and Higher-Order Geometric Integration for Image Labeling (Q6173532) (← links)
• A variable metric and Nesterov extrapolated proximal DCA with backtracking for a composite DC program (Q6175368) (← links)
• Open issues and recent advances in DC programming and DCA (Q6200375) (← links)
• A proximal alternating direction method of multipliers for DC programming with structured constraints (Q6536834) (← links)
• A boosted-DCA with power-sum-DC decomposition for linearly constrained polynomial programs (Q6536842) (← links)