New Path Following Algorithm for Convex Programming

To study a path following algorithm for tracing a constraint shifting combined homogony method for convex nonlinear programming. The method is based on the technique of beta -cone neighbourhood which ensures the obtained iterative points are in the interior of the constraint shifting feasible set. To establish the global linear convergence of the algorithm the numerical experiments indicate that the algorithm is efficient.