Complexity estimates of some cutting plane methods based on the analytic barrier
Author:
- 1 July 1995
- journal article
- Published by Springer Nature in Mathematical Programming
- Vol. 69 (1-3) , 149-176
Abstract
No abstract availableKeywords
This publication has 8 references indexed in Scilit:
- Interior-Point Polynomial Algorithms in Convex Programming1994
- Decomposition and Nondifferentiable Optimization with the Projective AlgorithmManagement Science, 1992
- A Potential Reduction Algorithm Allowing Column GenerationSIAM Journal on Optimization, 1992
- An algorithm for linear programming which requires O(((m+n)n 2+(m+n)1.5 n)L) arithmetic operationsMathematical Programming, 1990
- New Algorithms in Convex Programming Based on a Notion of “Centre” (for Systems of Analytic Inequalities) and on Rational Extrapolation1988
- A polynomial-time algorithm, based on Newton's method, for linear programmingMathematical Programming, 1988
- A new polynomial-time algorithm for linear programmingCombinatorica, 1984
- Location of the Maximum on Unimodal SurfacesJournal of the ACM, 1965