We describe an algorithm for linear and convex quadratic programming problems that uses power series approximation of the weighted barrier path that passes through the current iterate in order to find ...

This is a preview. Log in through your library . Abstract Let 0 < θ < 1 be an irrational number with continued fraction expansion $\theta =[a_{1},a_{2},a_{3},\ldots ...