TY - GEN
T1 - A filled function with one parameter approach for box constrained optimization problem
AU - Yao, Yirong
AU - Zeliang, Liang
AU - Zhang, Liansheng
PY - 2012
Y1 - 2012
N2 - The box constrained optimization appears in a wide range of scientific application. Therefore, box constrained problems continue to attract research interest. We address box constrained global optimization by deriving a new filled function with one parameter algorithm, we also prove the analysis properties of the proposed function under some suitable assumptions. Moreover, we show that the unconstrained minimization allows to escape from a local minima of the original objective function. We give experiment results on a solution of problems with different properties.
AB - The box constrained optimization appears in a wide range of scientific application. Therefore, box constrained problems continue to attract research interest. We address box constrained global optimization by deriving a new filled function with one parameter algorithm, we also prove the analysis properties of the proposed function under some suitable assumptions. Moreover, we show that the unconstrained minimization allows to escape from a local minima of the original objective function. We give experiment results on a solution of problems with different properties.
KW - Box constrained problem
KW - Filled function algorithm
KW - Global optimization
KW - Nonlinear programming
UR - http://www.scopus.com/inward/record.url?scp=84867902893&partnerID=8YFLogxK
U2 - 10.1109/CSO.2012.213
DO - 10.1109/CSO.2012.213
M3 - Conference contribution
AN - SCOPUS:84867902893
SN - 9780769546902
T3 - Proceedings of the 2012 5th International Joint Conference on Computational Sciences and Optimization, CSO 2012
SP - 414
EP - 418
BT - Proceedings of the 2012 5th International Joint Conference on Computational Sciences and Optimization, CSO 2012
T2 - 2012 5th International Joint Conference on Computational Sciences and Optimization, CSO 2012
Y2 - 23 June 2012 through 26 June 2012
ER -