Pages that link to "Item:Q5221263"

The following pages link to The Boosted Difference of Convex Functions Algorithm for Nonsmooth Functions (Q5221263):

Displaying 26 items.

• The ABC of DC programming (Q829493) (← links)
• Accelerating the DC algorithm for smooth functions (Q1749446) (← links)
• A unified Douglas-Rachford algorithm for generalized DC programming (Q2114583) (← links)
• Alternating DC algorithm for partial DC programming problems (Q2124808) (← links)
• DC semidefinite programming and cone constrained DC optimization. I: Theory (Q2149953) (← links)
• Using positive spanning sets to achieve d-stationarity with the boosted DC algorithm (Q2189634) (← links)
• Incremental DC optimization algorithm for large-scale clusterwise linear regression (Q2226259) (← links)
• An augmented subgradient method for minimizing nonsmooth DC functions (Q2231043) (← links)
• Solving \(k\)-center problems involving sets based on optimization techniques (Q2301186) (← links)
• The boosted DC algorithm for linearly constrained DC programming (Q2677660) (← links)
• An inertial proximal point method for difference of maximal monotone vector fields in Hadamard manifolds (Q2694523) (← 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)
• (Q5074079) (← 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)
• Finding robust minimizer for non-convex phase retrieval (Q6087986) (← links)
• The descent algorithm for solving the symmetric eigenvalue complementarity problem (Q6097703) (← links)
• A bundle-type method for nonsmooth DC programs (Q6154409) (← links)
• A refined inertial DC algorithm for DC programming (Q6159465) (← 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)
• Non-monotone boosted DC and Caputo fractional tailored finite point algorithm for Rician denoising and deblurring (Q6538520) (← links)
• A boosted DC algorithm for non-differentiable DC components with non-monotone line search (Q6568924) (← links)
• A unified Bregman alternating minimization algorithm for generalized DC programs with application to imaging (Q6639517) (← links)