Simulation Improvements (analysis, CSP, Arithmetic analysis and Interval) for efficient combination of two lower bound functions in univariate global optimization
Loading...
Date
2019-08-20
Journal Title
Journal ISSN
Volume Title
Publisher
Abstract
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
Description
2nd International Conference on Mathematical Modelling in Applied Sciences, ICMMAS19,
ICMMAS'2019, Belgorod Russia, 20-24 august 2019
Keywords
Global optimization, BB method, quadratic lower bound function, Branch and Bound, pruning method