✦ LIBER ✦

Solving nonconvex nonlinear programming problems via a new aggregate constraint homotopy method

✍ Scribed by Menglong Su; Bo Yu; Jian Wang

Publisher: Elsevier Science
Year: 2010
Tongue: English
Weight: 426 KB
Volume: 73
Category: Article
ISSN: 0362-546X
DOI: 10.1016/j.na.2010.06.032

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

The aggregate constraint homotopy method

The aggregate constraint homotopy method for nonconvex nonlinear programming

✍ Bo Yu; Guo-chen Feng; Shao-Liang Zhang 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 98 KB

A new accelerating method for globally s

A new accelerating method for globally solving a class of nonconvex programming problems

✍ Peiping Shen; Xiaodi Bai; Weimin Li 📂 Article 📅 2009 🏛 Elsevier Science 🌐 English ⚖ 591 KB

In this paper, we combine the new global optimization method proposed by Jiao [H. Jiao, A branch and bound algorithm for globally solving a class of nonconvex programming problems, Nonlinear Anal. 70 (2) (2008) 1113-1123] with a suitable deleting technique to propose a new accelerating global optimi