Browsing by Author "Ouanes, Mohand"

Now showing 1 - 2 of 2
  • Thumbnail Image
    Item
    Improvement combined with (analysis, CSP, Arithmetic analysis and Interval) of Simulations for efficient combination of two lower bound functions in (univariate,multivariate) global optimization and generalization
    (2019-12-16) CHEBBAH, MOHAMMED; Ouanes, Mohand; Zidna, Ahmed
    Univariate global optimization problems attract attention of researchers.Several methods [23] have been studied in the literature for univariate global optimization problems . Optimization in R presents the same difficulty as in Rn. Many algorithms are directed in this direction. For cutting methods in Global optimization or Optimsation gradient method in general . In this work, we propose to improve: The article submitted: ( Simulations for efficient combination of two lower bound functions in univariate global optimization. AIP Conference Proceedings 1863, 250004 (2017) ; https ://doi.org/10.1063/1.4992412, (2017). ) In this context too, we will accelerate the speed of the Algorithm for better complexity with technics (CSP, Arithmetic analysis and Interval and another). It should be noted that, we have made conclusive simulations in this direction .
  • Thumbnail Image
    Item
    Simulation Improvements (analysis, CSP, Arithmetic analysis and Interval) for efficient combination of two lower bound functions in univariate global optimization
    (2019-08-20) CHEBBAH, MOHAMMED; Ouanes, Mohand; Zidna, Ahmed
    Univariate global optimization problems attract attention of researchers.Several methods [23] have been studied in the literature for univariate global optimization problems . Optimization in R presents the same difficulty as in Rn. Many algorithms are directed in this direction. For cutting methods in Global optimization or Optimsation gradient method in general . In this work, we propose to improve: The article submitted: ( Simulations for efficient combination of two lower bound functions in univariate global optimization. AIP Conference Proceedings 1863, 250004 (2017) ; https ://doi.org/10.1063/1.4992412, (2017). ) In this context too, we will accelerate the speed of the Algorithm for better complexity with technics (CSP, Arithmetic analysis and Interval and another). It should be noted that, we have made conclusive simulations in this direction