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

Analytic Center Cutting-Plane Method with Deep Cuts for Semidefinite Feasibility Problems

โœ Scribed by S. K. Chua; K. C. Toh; G. Y. Zhao


Publisher
Springer
Year
2004
Tongue
English
Weight
178 KB
Volume
123
Category
Article
ISSN
0022-3239

No coin nor oath required. For personal study only.


๐Ÿ“œ SIMILAR VOLUMES


Variations on a cutting plane method for
โœ A. Victor Cabot ๐Ÿ“‚ Article ๐Ÿ“… 1974 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 534 KB

## Abstract A cutting plane method for solving concave minimization problems with linear constraints has been advanced by Tui. The principle behind this cutting plane has been applied to integer programming by Balas, Young, Glover, and others under the name of convexity cuts. This paper relates th