Title :
Global Minimum of Measure Function and Quasi-convex Function
Author :
Chen, Zhong ; Liu, Cai-Yun ; Lv, Yi-Bing
Author_Institution :
Sch. of Inf. & Math., Yangtze Univ., Jingzhou, China
Abstract :
In, Zheng etc present a mean method for solving global optimization problems, if the objective function f(x) is continuous, the global convergence of the mean method is proved. In this paper, if f(x) is measurable function and satisfies the measure Lipschitz condition, we will prove the global convergence of mean method for the global optimization problems. Furthermore, if f(x) is a quasi-convex function in a bounded closed set, the global convergence of the mean method is also discussed.
Keywords :
convergence; convex programming; set theory; Lipschitz condition; bounded closed set; global convergence; global minimum; global optimization problem solving; mean method; measure function; quasiconvex function; Convergence; Iterative algorithms; Level set; Mathematics; Minimization methods; Optimization methods; Global Minimum; Mean method; Measure function; Quasi-convex function;
Conference_Titel :
Computational Science and Optimization (CSO), 2010 Third International Joint Conference on
Conference_Location :
Huangshan, Anhui
Print_ISBN :
978-1-4244-6812-6
Electronic_ISBN :
978-1-4244-6813-3
DOI :
10.1109/CSO.2010.47