On some efficient interior point methods for nonlinear convex programming
Authors:
- 1 July 1991
- journal article
- Published by Elsevier in Linear Algebra and its Applications
- Vol. 152, 169-189
Abstract
No abstract availableKeywords
This publication has 8 references indexed in Scilit:
- An Extension of Karmarkar Type Algorithm to a Class of Convex Separable Programming Problems with Global Linear Rate of ConvergenceMathematics of Operations Research, 1990
- Containing and shrinking ellipsoids in the path-following algorithmMathematical Programming, 1990
- Global ellipsoidal approximations and homotopy methods for solving convex analytic programsApplied Mathematics & Optimization, 1990
- The Projective SUMT Method for Convex ProgrammingMathematics of Operations Research, 1989
- Interior path following primal-dual algorithms. part I: Linear programmingMathematical Programming, 1989
- A polynomial-time algorithm for a class of linear complementarity problemsMathematical Programming, 1989
- A polynomial-time algorithm, based on Newton's method, for linear programmingMathematical Programming, 1988
- A new polynomial-time algorithm for linear programmingCombinatorica, 1984