The following pages link to (Q3410053):
Displaying 16 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)
- On difference of two monotone operators (Q839795) (← links)
- A proximal point algorithm for DC functions on Hadamard manifolds (Q897056) (← links)
- On the difference of two maximal monotone operators: Regularization and algorithmic approaches (Q942362) (← links)
- Accelerating the DC algorithm for smooth functions (Q1749446) (← links)
- Proximal point algorithms for vector DC programming with applications to probabilistic lot sizing with service levels (Q1784885) (← 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)
- General variational inclusions involving difference of operators (Q2405588) (← links)
- Characterization and recognition of d.c. functions (Q2434628) (← links)
- On critical points of the difference of two maximal monotone operators (Q2516936) (← links)
- Computing B-Stationary Points of Nonsmooth DC Programs (Q2976143) (← links)
- The Boosted Difference of Convex Functions Algorithm for Nonsmooth Functions (Q5221263) (← links)
- An interior proximal linearized method for DC programming based on Bregman distance or second-order homogeneous kernels (Q5228821) (← links)
