Generalization of Karmarkar's algorithm to convex homogeneous functions

Authors:
Bahman Kalantari
Affiliations:
Department of Computer Science, Rutgers University, New Brunswick, NJ 08903, USA
Venue:
Operations Research Letters
Year:
1992

Citing 6
Cited 0

A new polynomial-time algorithm for linear programming

Combinatorica
Theory of linear and integer programming

Theory of linear and integer programming
An extension of Karmarkar`s algorithm for solving a system of linear homogeneousequations on the simplex

Mathematical Programming: Series A and B
Karmarkar's algorithm with improved steps

Mathematical Programming: Series A and B
An extension of Karmarkar projective algorithm for convex quadratic programming

Mathematical Programming: Series A and B
A fully polynomial time projective method

Operations Research Letters

Quantified Score

Hi-index	0.00

Visualization

Abstract

Let @f be a convex homogeneous function of degree K 0 defined over the positive points of a subspace W of R^n, n = 2. Assume @f(x) 0 for some 0 0, there exists 0 ^1^/^n. Karmarkar's algorithm proves the above for the special case where @f is linear.