Letter to the Editor—A Note on Cutting-Plane Methods Without Nested Constraint Sets

Donald M. Topkis
Additional contact information
Donald M. Topkis: University of California, Berkeley, California

Operations Research, 1970, vol. 18, issue 6, 1216-1220

Abstract: This note shows that a framework I developed earlier can be used to give a simplified proof of conditions given by Eaves and Zangwill (which weaken the uniform concavity requirement on my earlier objective function) under which inactive constraints may be dropped after each subproblem in cutting-plane algorithms. Here the convergence rate I established previously as an extension of the results of Levitin and Polyak is improved and its application extended.

Date: 1970
References: Add references at CitEc
Citations:

Downloads: (external link)
http://dx.doi.org/10.1287/opre.18.6.1216 (application/pdf)

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:inm:oropre:v:18:y:1970:i:6:p:1216-1220

Access Statistics for this article

More articles in Operations Research from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().