On polynomiality of the method of analytic centers for fractional problems

DOI10.1007/BF02592102zbMath0853.90107OpenAlexW2111365405MaRDI QIDQ1919100

Arkadi Nemirovski

Publication date: 6 January 1997

Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf02592102

zbMATH Keywords

fractional programminggeneralized eigenvalue probleminterior point methodsmethod of analytic centersself-concordancelinear-fractional optimizationpolynomial time convergence

Mathematics Subject Classification ID

Abstract computational complexity for mathematical programming problems (90C60) Fractional programming (90C32) Linear programming (90C05)

Related Items

A fifth bibliography of fractional programming^*, Solution of some convex separable resource allocation and production planning problems with bounds on the variables, The finite criss-cross method for hyperbolic programming

Cites Work

• Unnamed Item
• Unnamed Item
• A monotonic projective algorithm for fractional linear programming
• A new polynomial-time algorithm for linear programming
• Generalized fractional programming: Algorithms and numerical experimentation
• A polynomial-time algorithm, based on Newton's method, for linear programming
• Method of centers for minimizing generalized eigenvalues
• An interior-point method for generalized linear-fractional programming
• Partial linearization for generalized fractional programming
• Bibliography in fractional programming
• Linear Matrix Inequalities in System and Control Theory
• On Nonlinear Fractional Programming
• On An Invariant of Plane Regions and Mass Distributions