On the Convergence of Cone Splitting Algorithms with ω-Subdivisions

B. Jaumard and C. Meyer
Additional contact information
B. Jaumard: GERAD and École Polytechnique de Montréal
C. Meyer: École Polytechnique de Montréal

Journal of Optimization Theory and Applications, 2001, vol. 110, issue 1, No 6, 119-144

Abstract: Abstract We present a convergence proof of the Tuy cone splitting algorithm with a pure ω-subdivision strategy for the minimization of a concave function over a polytope. The key idea of the convergence proof is to associate with the current hyperplane a new hyperplane that supports the whole polytope instead of only the portion of it contained in the current cone. A branch-and-bound variant of the algorithm is also discussed.

Keywords: concave minimization; ω-subdivisions; convergence (search for similar items in EconPapers)
Date: 2001
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
http://link.springer.com/10.1023/A:1017595513275 Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:joptap:v:110:y:2001:i:1:d:10.1023_a:1017595513275

Ordering information: This journal article can be ordered from
http://www.springer. ... cs/journal/10957/PS2

DOI: 10.1023/A:1017595513275

Access Statistics for this article

Journal of Optimization Theory and Applications is currently edited by Franco Giannessi and David G. Hull

More articles in Journal of Optimization Theory and Applications from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().