On consistency of bounding operations in deterministic global optimization |
| |
Authors: | R Horst |
| |
Institution: | (1) Fachbereich IV—Mathematik, Universität Trier, Trier, West Germany |
| |
Abstract: | This technical comment refers to the discussion of strong consistency of several bounding procedures in Lemma 2.1 and Proposition 2.1 of Ref. 1. A necessary clarification is given of the notion of convergence q in Lemma 2.1, and a derivation of Proposition 2.1 is presented that includes a new and simple consistency proof of the classical bounding by convex envelopes used in many branch-and-bound procedures. |
| |
Keywords: | Global optimization nonconvex programming mathematical programming branch-and-bound methods |
本文献已被 SpringerLink 等数据库收录! |