A combined homotopy interior point method for general nonlinear programming problems

DOI10.1016/0096-3003(95)00295-2zbMath0883.65054OpenAlexW2084444452MaRDI QIDQ1354287

Zhenghua Lin, Bo Yu, Yong Li

Publication date: 23 February 1998

Published in: Applied Mathematics and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0096-3003(95)00295-2

zbMATH Keywords

convergencenumerical examplesnonlinear programminghomotopy-interior point method

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Nonlinear programming (90C30) Global methods, including homotopy approaches to the numerical solution of nonlinear equations (65H20)

Related Items

A combined homotopy interior point method for the linear complementarity problem, A modified homotopy method for solving the principal-agent bilevel programming problem, Finding a minimal efficient solution of a convex multiobjective program, An aggregate deformation homotopy method for min-max-min problems with max-min constraints, A spline smoothing homotopy method for nonlinear programming problems with both inequality and equality constraints, Globally convergent homotopy method for designing piecewise linear deterministic contractual function, Unnamed Item, Homotopy method for a general multiobjective programming problem, A constraint shifting homotopy method for general non-linear programming, A homotopy method for nonlinear second-order cone programming, A homotopy method for solving the horizontal linear complementarity problem, Solving the Karush-Kuhn-Tucker system of a nonconvex programming problem on an unbounded set, Globally convergent method for designing twice spline contractual function, Globally convergent homotopy algorithm for solving the KKT systems to the principal-agent bilevel programming

Cites Work

• Global ellipsoidal approximations and homotopy methods for solving convex analytic programs
• A new polynomial-time algorithm for linear programming
• Interior path following primal-dual algorithms. I: Linear programming
• Interior path following primal-dual algorithms. II: Convex quadratic programming
• On some efficient interior point methods for nonlinear convex programming
• Interior-point methods for convex programming
• Global analysis and economics. VI: Geometric analysis of Pareto optima and price equilibria under classical hypotheses
• A combined homotopy interior point method for convex nonlinear programming
• An implementation of Karmarkar's algorithm for linear programming
• An Extension of Karmarkar Type Algorithm to a Class of Convex Separable Programming Problems with Global Linear Rate of Convergence
• The Projective SUMT Method for Convex Programming
• A path following algorithm for a class of convex programming problems
• A Constructive Proof of the Brouwer Fixed-Point Theorem and Computational Results
• Finding Zeroes of Maps: Homotopy Methods That are Constructive With Probability One
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item