A central cutting plane algorithm for the convex programming problem
- 1 December 1975
- journal article
- Published by Springer Nature in Mathematical Programming
- Vol. 8 (1), 134-145
- https://doi.org/10.1007/bf01580439
Abstract
No abstract availableKeywords
This publication has 10 references indexed in Scilit:
- Computational experience with the Central Cutting Plane AlgorithmPublished by Association for Computing Machinery (ACM) ,1973
- Generalized Cutting Plane AlgorithmsSIAM Journal on Control, 1971
- A Modified Linear Program for Columnar Methods in Mathematical ProgrammingOperations Research, 1971
- Letter to the Editor—A Note on Cutting-Plane Methods Without Nested Constraint SetsOperations Research, 1970
- Elements of Large-Scale Mathematical Programming Part I: ConceptsManagement Science, 1970
- Cutting-Plane Methods without Nested Constraint SetsOperations Research, 1970
- The Supporting Hyperplane Method for Unimodal ProgrammingOperations Research, 1967
- Nonlinear Programming: A Numerical SurveySIAM Journal on Control, 1966
- The Cutting-Plane Method for Solving Convex ProgramsJournal of the Society for Industrial and Applied Mathematics, 1960
- Newton's method for convex programming and Tchebycheff approximationNumerische Mathematik, 1959