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

Parametric simplex algorithms for solving a special class of nonconvex minimization problems

โœ Scribed by Hiroshi Konno; Yasutoshi Yajima; Tomomi Matsui


Publisher
Springer US
Year
1991
Tongue
English
Weight
725 KB
Volume
1
Category
Article
ISSN
0925-5001

No coin nor oath required. For personal study only.


๐Ÿ“œ SIMILAR VOLUMES


A new accelerating method for globally s
โœ 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