Pages that link to "Item:Q2751334"
From MaRDI portal
The following pages link to Representation of a polynomial function as a difference of convex polynomials, with an application (Q2751334):
Displaying 8 items.
- Solving DC programs using the cutting angle method (Q486726) (← links)
- A method for converting a class of univariate functions into d. c. functions (Q1304397) (← links)
- Improving the efficiency of DC global optimization methods by improving the DC representation of the objective function (Q2271151) (← links)
- A proximal bundle method for nonsmooth DC optimization utilizing nonconvex cutting planes (Q2399479) (← links)
- On difference convexity of locally Lipschitz functions (Q3112496) (← links)
- Double Bundle Method for finding Clarke Stationary Points in Nonsmooth DC Programming (Q4571882) (← links)
- A boosted-DCA with power-sum-DC decomposition for linearly constrained polynomial programs (Q6536842) (← links)
- On difference-of-SOS and difference-of-convex-SOS decompositions for polynomials (Q6550977) (← links)