Complexity estimates of some cutting plane methods based on the analytic barrier
Data up to Jan 2025
Total Citations Per Year
Abstract
References (15)
A new polynomial-time algorithm for linear programming
1984 • 4,898 citations
Interior-Point Polynomial Algorithms in Convex Programming
1994 • 4,212 citations
Problem complexity and method efficiency in optimization
1984 • 1,542 citations
Problem Complexity and Method Efficiency in Optimization
1984 • 603 citations
A polynomial-time algorithm, based on Newton's method, for linear programming
1988 • 587 citations
New variants of bundle methods
1995 • 390 citations
Mathematical Programming
1995 • 221 citations
Decomposition and Nondifferentiable Optimization with the Projective Algorithm
1992 • 203 citations
An algorithm for linear programming which requires O(((m+n)n 2+(m+n)1.5 n)L) arithmetic operations
1990 • 197 citations
A cutting plane algorithm for convex programming that uses analytic centers
1995 • 154 citations
A new algorithm for minimizing convex functions over convex sets
1996 • 151 citations
Nonsmooth Optimization and Descent Methods
1978 • 91 citations
Location of the Maximum on Unimodal Surfaces
1965 • 84 citations
New Algorithms in Convex Programming Based on a Notion of “Centre” (for Systems of Analytic Inequalities) and on Rational Extrapolation
1988 • 74 citations
A Potential Reduction Algorithm Allowing Column Generation
1992 • 73 citations