Pages that link to "Item:Q486726"
From MaRDI portal
The following pages link to Solving DC programs using the cutting angle method (Q486726):
Displaying 11 items.
- Global convergence of a proximal linearized algorithm for difference of convex functions (Q331993) (← links)
- A novel differential evolution algorithm using local abstract convex underestimate strategy for global optimization (Q342520) (← links)
- Solving DC programs with a polyhedral component utilizing a multiple objective linear programming solver (Q1679488) (← links)
- A vector linear programming approach for certain global optimization problems (Q1756780) (← links)
- A modified proximal point method for DC functions on Hadamard manifolds (Q2191784) (← links)
- Solving polyhedral d.c. optimization problems via concave minimization (Q2200081) (← links)
- A proximal point method for difference of convex functions in multi-objective optimization with application to group dynamic problems (Q2301136) (← links)
- A modified version of Tuy's method for solving d.c. programing problem (Q3813618) (← links)
- Approximation by Delta-Convex Mappings in Certain Spaces (Q5073868) (← links)
- Generalized cutting plane method for solving nonlinear stochastic programming problems (Q5131826) (← links)
- DC optimization for constructing discrete Sugeno integrals and learning nonadditive measures (Q5151517) (← links)