✦ LIBER ✦

Subset simulation for unconstrained global optimization

✍ Scribed by Hong-Shuang Li

Publisher: Elsevier Science
Year: 2011
Tongue: English
Weight: 490 KB
Volume: 35
Category: Article
ISSN: 0307-904X
DOI: 10.1016/j.apm.2011.04.023

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A new filled function method for unconst

A new filled function method for unconstrained global optimization

✍ Chengjun Wang; Yongjian Yang; Jing Li 📂 Article 📅 2009 🏛 Elsevier Science 🌐 English ⚖ 585 KB

In this paper, a new filled function which has better properties is proposed for identifying a global minimum point for a general class of nonlinear programming problems within a closed bounded domain. An algorithm for unconstrained global optimization is developed from the new filled function. Theo

Unconstrained global optimization using

Unconstrained global optimization using strict complementary slackness

✍ Ismail Bin Mohd 📂 Article 📅 1990 🏛 Elsevier Science 🌐 English ⚖ 536 KB

A dynamic selection algorithm for global

A dynamic selection algorithm for globally optimal subsets

✍ Bin Yu; Baozong Yuan 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 419 KB

A dimension-reducing method for unconstr

A dimension-reducing method for unconstrained optimization

✍ T.N. Grapsa; M.N. Vrahatis 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 762 KB

A hybrid trust region algorithm for unco

A hybrid trust region algorithm for unconstrained optimization

✍ Yigui Ou 📂 Article 📅 2011 🏛 Elsevier Science 🌐 English ⚖ 166 KB

A new trust region method for unconstrai

A new trust region method for unconstrained optimization

✍ Zhen-Jun Shi; Jin-Hua Guo 📂 Article 📅 2008 🏛 Elsevier Science 🌐 English ⚖ 179 KB

In this paper, we propose a new trust region method for unconstrained optimization problems. The new trust region method can automatically adjust the trust region radius of related subproblems at each iteration and has strong global convergence under some mild conditions. We also analyze the global