The following pages link to (Q4470269):
Displaying 32 items.
- Proximal point algorithms for multi-criteria optimization with the difference of convex objective functions (Q289089) (← links)
- Global convergence of a proximal linearized algorithm for difference of convex functions (Q331993) (← links)
- Characterization of d.c. Functions in terms of quasidifferentials (Q640206) (← links)
- Global optimization from concave minimization to concave mixed variational inequality (Q778156) (← links)
- Hybrid proximal linearized algorithm for the split DC program in infinite-dimensional real Hilbert spaces (Q824790) (← links)
- A proximal point algorithm for DC functions on Hadamard manifolds (Q897056) (← links)
- Bundle-based descent method for nonsmooth multiobjective DC optimization with inequality constraints (Q1630269) (← links)
- DC programming and DCA: thirty years of developments (Q1749443) (← links)
- A general nonconvex multiduality principle (Q1752635) (← links)
- Proximal point algorithms for vector DC programming with applications to probabilistic lot sizing with service levels (Q1784885) (← links)
- Conditions for the existence, identification and calculus rules of the threshold of prox-boundedness (Q1996734) (← links)
- On 1-Laplacian elliptic equations modeling magnetic resonance image Rician denoising (Q2014480) (← links)
- Split proximal linearized algorithm and convergence theorems for the split DC program (Q2067889) (← links)
- Copositivity meets D. C. optimization (Q2068809) (← links)
- A generalized proximal linearized algorithm for DC functions with application to the optimal size of the firm problem (Q2158622) (← links)
- A modified proximal point method for DC functions on Hadamard manifolds (Q2191784) (← links)
- An augmented subgradient method for minimizing nonsmooth DC functions (Q2231043) (← links)
- A proximal point method for difference of convex functions in multi-objective optimization with application to group dynamic problems (Q2301136) (← links)
- A general double-proximal gradient algorithm for d.c. programming (Q2330650) (← links)
- A proximal bundle method for nonsmooth DC optimization utilizing nonconvex cutting planes (Q2399479) (← links)
- Computing proximal points of convex functions with inexact subgradients (Q2413568) (← links)
- Characterization and recognition of d.c. functions (Q2434628) (← links)
- On critical points of the difference of two maximal monotone operators (Q2516936) (← links)
- A New Boosted Proximal Point Algorithm for Minimizing Nonsmooth DC Functions (Q5099775) (← links)
- An interior proximal linearized method for DC programming based on Bregman distance or second-order homogeneous kernels (Q5228821) (← links)
- A forward-backward algorithm for the DC programming in Hilbert spaces (Q5244142) (← links)
- Efficient Boosted DC Algorithm for Nonconvex Image Restoration with Rician Noise (Q5863519) (← links)
- On Algorithms for Difference of Monotone Operators (Q5896074) (← links)
- On Algorithms for Difference of Monotone Operators (Q5896140) (← links)
- Open issues and recent advances in DC programming and DCA (Q6200375) (← 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)
