A filled function with one parameter approach for box constrained optimization problem

Yirong Yao; Liang Zeliang; Liansheng Zhang

doi:10.1109/CSO.2012.213

A filled function with one parameter approach for box constrained optimization problem

Yirong Yao^*, Liang Zeliang, Liansheng Zhang

^*Corresponding author for this work

Shanghai University

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

1 Citation (Scopus)

Abstract

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.

Original language	English
Title of host publication	Proceedings of the 2012 5th International Joint Conference on Computational Sciences and Optimization, CSO 2012
Pages	414-418
Number of pages	5
DOIs	https://doi.org/10.1109/CSO.2012.213
Publication status	Published - 2012
Externally published	Yes
Event	2012 5th International Joint Conference on Computational Sciences and Optimization, CSO 2012 - Harbin, Heilongjiang, China Duration: 23 Jun 2012 → 26 Jun 2012

Publication series

Name	Proceedings of the 2012 5th International Joint Conference on Computational Sciences and Optimization, CSO 2012

Conference

Conference	2012 5th International Joint Conference on Computational Sciences and Optimization, CSO 2012
Country/Territory	China
City	Harbin, Heilongjiang
Period	23/06/12 → 26/06/12

Keywords

Box constrained problem
Filled function algorithm
Global optimization
Nonlinear programming

Access to Document

10.1109/CSO.2012.213

Cite this

Yao, Y., Zeliang, L., & Zhang, L. (2012). A filled function with one parameter approach for box constrained optimization problem. In Proceedings of the 2012 5th International Joint Conference on Computational Sciences and Optimization, CSO 2012 (pp. 414-418). Article 6274757 (Proceedings of the 2012 5th International Joint Conference on Computational Sciences and Optimization, CSO 2012). https://doi.org/10.1109/CSO.2012.213

Yao, Yirong ; Zeliang, Liang ; Zhang, Liansheng. / A filled function with one parameter approach for box constrained optimization problem. Proceedings of the 2012 5th International Joint Conference on Computational Sciences and Optimization, CSO 2012. 2012. pp. 414-418 (Proceedings of the 2012 5th International Joint Conference on Computational Sciences and Optimization, CSO 2012).

@inproceedings{34f2dfc75968441594fd551319d4f08c,

title = "A filled function with one parameter approach for box constrained optimization problem",

abstract = "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.",

keywords = "Box constrained problem, Filled function algorithm, Global optimization, Nonlinear programming",

author = "Yirong Yao and Liang Zeliang and Liansheng Zhang",

year = "2012",

doi = "10.1109/CSO.2012.213",

language = "English",

isbn = "9780769546902",

series = "Proceedings of the 2012 5th International Joint Conference on Computational Sciences and Optimization, CSO 2012",

pages = "414--418",

booktitle = "Proceedings of the 2012 5th International Joint Conference on Computational Sciences and Optimization, CSO 2012",

note = "2012 5th International Joint Conference on Computational Sciences and Optimization, CSO 2012 ; Conference date: 23-06-2012 Through 26-06-2012",

}

Yao, Y, Zeliang, L & Zhang, L 2012, A filled function with one parameter approach for box constrained optimization problem. in Proceedings of the 2012 5th International Joint Conference on Computational Sciences and Optimization, CSO 2012., 6274757, Proceedings of the 2012 5th International Joint Conference on Computational Sciences and Optimization, CSO 2012, pp. 414-418, 2012 5th International Joint Conference on Computational Sciences and Optimization, CSO 2012, Harbin, Heilongjiang, China, 23/06/12. https://doi.org/10.1109/CSO.2012.213

A filled function with one parameter approach for box constrained optimization problem. / Yao, Yirong; Zeliang, Liang; Zhang, Liansheng.
Proceedings of the 2012 5th International Joint Conference on Computational Sciences and Optimization, CSO 2012. 2012. p. 414-418 6274757 (Proceedings of the 2012 5th International Joint Conference on Computational Sciences and Optimization, CSO 2012).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

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 -

Yao Y, Zeliang L, Zhang L. A filled function with one parameter approach for box constrained optimization problem. In Proceedings of the 2012 5th International Joint Conference on Computational Sciences and Optimization, CSO 2012. 2012. p. 414-418. 6274757. (Proceedings of the 2012 5th International Joint Conference on Computational Sciences and Optimization, CSO 2012). doi: 10.1109/CSO.2012.213

A filled function with one parameter approach for box constrained optimization problem

Abstract

Publication series

Conference

Keywords

Access to Document

Other files and links

Fingerprint

Cite this