可达到和可逼近总极小点的存在性和最优性

Operations Research Transactions ›› 2012, Vol. 16 ›› Issue (2): 32-40.

• Original Articles • Previous Articles Next Articles

Existence and Optimality of Accessible and Approximatable Minimizers for Global Optimization with Deviation Integral

Yao Yirong¹, AN Liu¹, CHEN Xi¹, ZHENG Quan²

1. Department of Mathematics, Shanghai University, Shanghai 200444, China; 2. Department of Mathematics, Columbus State University, Columbus, GA 31907

Received:2011-03-01 Revised:2012-03-29 Online:2012-06-15 Published:2012-06-15

Abstract

Abstract: The concepts of robustness of sets and functions are proposed in view of the theory of integral global minimization. These concepts are generalized, and global minimization of quasi and pseudo upper robust function is investigated in this paper. With the deviation integral optimality condition of global minimum, the existence of accessible minimizer of quasi upper functions and approximatable minimizer of pseudo upper robust function is examined..

Key words: global optimization, robust minimizer, quasi upper robust, deviation integral

Yao-Yi-Rong, AN Liu, CHEN Xi, ZHENG Quan. Existence and Optimality of Accessible and Approximatable Minimizers for Global Optimization with Deviation Integral[J]. Operations Research Transactions, 2012, 16(2): 32-40.

[1]	CHEN Yong, WANG Wei, XU Yifan. An stochastic algorithm for global optimization with linear constraints based on intermittent diffusion [J]. Operations Research Transactions, 2020, 24(1): 88-100.
[2]	WANG Weixiang, SHANG Youlin, WANG Duo. Filled function method for solving non-smooth box constrained global optimization problems [J]. Operations Research Transactions, 2019, 23(1): 28-34.
[3]	TIAN Mingyu, YANG Yongjian. A global optimization algorithm for polynomial programming [J]. Operations Research Transactions, 2018, 22(4): 79-88.
[4]	ZHENG Yue, ZHUANG Daoyuan, WAN Zhongping. A global optimization method for solving the weak linear bilevel programming problems [J]. Operations Research Transactions, 2017, 21(3): 86-94.
[5]	WU Peipei, GAO Yuelin. A new single parameter filled function method for nonlinear integer programming [J]. Operations Research Transactions, 2017, 21(3): 111-118.
[6]	SHI Litang, CHEN Wei. A filled-filter function algorithm for solving unconstrained nonlinear optimization [J]. Operations Research Transactions, 2017, 21(1): 55-64.
[7]	HU Quan, WANG Wei. A filled function method based on filter for global optimization with box constraints [J]. Operations Research Transactions, 2016, 20(3): 57-67.
[8]	YE Min, WU Zhiyou, ZHANG Liang. Necessary global optimality conditions and optimization methods for cubic polynomial optimization problems with linear constraints [J]. Operations Research Transactions, 2015, 19(2): 15-28.
[9]	LV Yibing, WAN Zhongping. A global optimization method for solving the linear semivectorial bilevel programming problem [J]. Operations Research Transactions, 2015, 19(2): 29-36.
[10]	DAI Yuhong, LIU Xinwei. Advances in linear and nonlinear programming [J]. Operations Research Transactions, 2014, 18(1): 69-92.
[11]	Lou-Ye, SUN Sheng, WU Ming-Nan. A new level-value estimation method for global minimization [J]. Operations Research Transactions, 2012, 16(2): 105-114.
[12]	TANG Dan. CRS algorithm based on the simulated annealing [J]. Operations Research Transactions, 2011, 15(4): 124-128.
[13]	TIAN Jing, WU Zhi-You, J. Ugon. Optimization Methods for a Class of Integer Polynomial Programming Problems [J]. Operations Research Transactions, 2011, 15(4): 23-35.
[14]	PAN Shao-Rong, ZHANG Li-Wei. Fritz-John Condition for a Class of Nondifferntiable Optimization [J]. Operations Research Transactions, 2011, 15(2): 77-84.

Existence and Optimality of Accessible and Approximatable Minimizers for Global Optimization with Deviation Integral

PDF

Knowledge

Abstract

Cite this article

share this article

References

Related Articles 14

Recommended Articles

Metrics

Comments