Existence of an interior pathway to a Karush-Kuhn-Tucker point of a nonconvex programming problem

This publication has 12 references indexed in Scilit:

• A path following algorithm for a class of convex programming problems
  Mathematical Methods of Operations Research, 1992
• An Extension of Karmarkar Type Algorithm to a Class of Convex Separable Programming Problems with Global Linear Rate of Convergence
  Mathematics of Operations Research, 1990
• Global ellipsoidal approximations and homotopy methods for solving convex analytic programs
  Applied Mathematics & Optimization, 1990
• The Projective SUMT Method for Convex Programming
  Mathematics of Operations Research, 1989
• An implementation of Karmarkar's algorithm for linear programming
  Mathematical Programming, 1989
• Interior path following primal-dual algorithms. part I: Linear programming
  Mathematical Programming, 1989
• On projected newton barrier methods for linear programming and an equivalence to Karmarkar’s projective method
  Mathematical Programming, 1986
• Finding zeroes of maps: homotopy methods that are constructive with probability one
  Mathematics of Computation, 1978
• A Constructive Proof of the Brouwer Fixed-Point Theorem and Computational Results
  SIAM Journal on Numerical Analysis, 1976
• Global analysis and economics VI: Geometric analysis of Pareto Optima and price equilibria under classical hypotheses
  Journal of Mathematical Economics, 1976