Generalization of Karmarkar's algorithm to convex homogeneous functions (Q1197885)

Let \(\varphi\) be a homogeneous convex function of degree \(K>0\), defined over the positive points of a subspace \(W\) of \(R^ n\) \((n\geq 2)\). Assume \(\{x\in W\mid x>0, \varphi(x)>0\}\neq\emptyset\). Let \(V\) be the set of nonnegative nonzero \(x\in W\) such that \(\varphi(x^ k)\) converges to zero, for some sequence \(0<x^ k\in W\) converging to \(x\). The author proves \(V=\emptyset\) iff for every \(d\in U\) there exists \(0<x_ d\in W\) such that \(e^ T d=e^ T x_ d\) and \(f(x_ d)\leq\gamma f(d)\), where \(e\) is the vector of ones, \(f(x)=\varphi(x)/\left(\prod^ n_{i=1} x_ i\right)^{K/n}\) and \(\gamma=\{[(K+1)/K]^ K\exp(-1)\}^{1/n}\). In the case when \(\varphi\) is linear one recovers Karmarkar's algorithm.