๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

A homotopy method for getting a local minimum of constrained nonconvex programming

โœ Scribed by Wenjuan Sun; Qinghuai Liu; Cailing Wang

Publisher
Elsevier Science
Year
2009
Tongue
English
Weight
429 KB
Volume
71
Category
Article
ISSN
0362-546X

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

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

A homotopy method for determining the ei
A homotopy method for determining the eigenvalues of locally or non-locally reacting acoustic liners in flow ducts
โœ Xiaofeng Sun; Lin Du; Vigor Yang ๐Ÿ“‚ Article ๐Ÿ“… 2007 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 635 KB

This paper presents a unified algorithm for studying the eigenvalue problem of a lined duct using the homotopy method. Results from various validations show that the method developed in this work can provide accurate and reliable numerical solutions for sound-propagation computation. The investigati