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 IntervalReport as inadecuate




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 - Download this document for free, or read online. Document in PDF available to download.

1 Laboratoire de Recherche Opérationnelle et Mathématiques de la Décision - LAROMAD Alger, Algérie 2 IRIT - Institut de recherche en informatique de Toulouse

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.

Keywords : Global Optimization Non Convex Optimization Optimization DC And DCA





Author: Leslous Fadila - Philippe Marthon - Ouanes Mohand -

Source: https://hal.archives-ouvertes.fr/



DOWNLOAD PDF




Related documents