Skip to Main content Skip to Navigation
Journal articles

Improving the Robustness of Difference of Convex Algorithm in the Research of a Global Optimum of a Nonconvex Differentiable Function Defined on a Bounded Closed Interval

Abstract : In this paper we present an algorithm for solving a DC problem non convex on an interval [a, b] of R. We use the DCA (Difference of Convex Algorithm) and the minimum of the average of two approximations of the function from a and b.This strategy has the advantage of giving in general a minimum to be situated in the attraction zone of the global minimum searched. After applying the DCA from this minimum we certainly arrive at the global minimum searched.
Complete list of metadatas

Cited literature [12 references]  Display  Hide  Download

https://hal.archives-ouvertes.fr/hal-01137376
Contributor : Open Archive Toulouse Archive Ouverte (oatao) <>
Submitted on : Tuesday, March 31, 2015 - 1:22:14 PM
Last modification on : Saturday, June 20, 2020 - 3:37:55 AM
Long-term archiving on: : Tuesday, April 18, 2017 - 6:00:15 AM

File

Fadila_12886.pdf
Files produced by the author(s)

Identifiers

Citation

Leslous Fadila, Philippe Marthon, Ouanes Mohand. Improving the Robustness of Difference of Convex Algorithm in the Research of a Global Optimum of a Nonconvex Differentiable Function Defined on a Bounded Closed Interval. Applied Mathematical Sciences, Hikari, 2014, vol. 8 (n° 1), pp. 1-12. ⟨10.12988/ams.2014.35258⟩. ⟨hal-01137376v2⟩

Share

Metrics

Record views

392

Files downloads

740