|
|||||
|
|
A note on the convergence of an algorithm for nonconvex programming problems |
|
| Authors: | Reiner Horst |
| Affiliation: | (1) Technische Hochschule Darmstadt, Darmstadt, Fed. Rep. Germany |
| Abstract: | A strong convergence theorem is proven to hold for the general algorithm of the branch and bound type for solving nonconvex programming problems given in [1]. |
| Keywords: | Nonconvex Programming Branch and Bound Methods Convergence |
| 本文献已被 SpringerLink 等数据库收录！ | |