✦ 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
DOI: 10.1007/s10957-004-5150-4

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Shallow, deep and very deep cuts in the

Shallow, deep and very deep cuts in the analytic center cutting plane method

✍ Jean-Louis Goffin; Jean-Philippe Vial 📂 Article 📅 1999 🏛 Springer-Verlag 🌐 English ⚖ 118 KB

A probabilistic analytic center cutting

A probabilistic analytic center cutting plane method for feasibility of uncertain LMIs

✍ Giuseppe C. Calafiore; Fabrizio Dabbene 📂 Article 📅 2007 🏛 Elsevier Science 🌐 English ⚖ 359 KB

A note on some analytic center cutting p

A note on some analytic center cutting plane methods for convex feasibility and minimization problems

✍ Anna Altman; Krzysztof C. Kiwiel 📂 Article 📅 1996 🏛 Springer US 🌐 English ⚖ 315 KB

An analytic center quadratic cut method

An analytic center quadratic cut method for the convex quadratic feasibility problem

✍ Faranak Sharifi Mokhtarian; Jean-Louis Goffin 📂 Article 📅 2002 🏛 Springer-Verlag 🌐 English ⚖ 150 KB

ACCPM — A library for convex optimizatio

ACCPM — A library for convex optimization based on an analytic center cutting plane method

✍ J. Gondzio; O. du Merle; R. Sarkissian; J.-P. Vial 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 425 KB

Variations on a cutting plane method for

Variations on a cutting plane method for solving concave minimization problems with linear constraints

✍ 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