A combined homotopy interior point method for general nonlinear programming problems

DOI10.1016/0096-3003(95)00295-2MaRDI QIDQ1354287zbMATH OpenOpenAlexFDO

Authors Zhenghua Lin, Yong Li, Bo Yu

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

convergencenonlinear programmingnumerical exampleshomotopy-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)

Recommendations

• A combined homotopy infeasible interior point method for nonconvex programming
• Convergence theorems of homotopy method for constrained nonconvex programming
• On the complexity of a combined homotopy interior method for convex programming
• A combined homotopy interior point method for convex nonlinear programming

Cites work

• scientific article; zbMATH DE number 4164543 (Why is no real title available?)
• scientific article; zbMATH DE number 3809326 (Why is no real title available?)
• scientific article; zbMATH DE number 3972641 (Why is no real title available?)
• scientific article; zbMATH DE number 3682672 (Why is no real title available?)
• scientific article; zbMATH DE number 47206 (Why is no real title available?)
• scientific article; zbMATH DE number 4126998 (Why is no real title available?)
• scientific article; zbMATH DE number 269555 (Why is no real title available?)
• A Constructive Proof of the Brouwer Fixed-Point Theorem and Computational Results
• A combined homotopy interior point method for convex nonlinear programming
• A new polynomial-time algorithm for linear programming
• A path following algorithm for a class of convex programming problems
• An Extension of Karmarkar Type Algorithm to a Class of Convex Separable Programming Problems with Global Linear Rate of Convergence
• An implementation of Karmarkar's algorithm for linear programming
• Finding Zeroes of Maps: Homotopy Methods That are Constructive With Probability One
• Global analysis and economics. VI: Geometric analysis of Pareto optima and price equilibria under classical hypotheses
• Global ellipsoidal approximations and homotopy methods for solving convex analytic programs
• Interior path following primal-dual algorithms. I: Linear programming
• Interior path following primal-dual algorithms. II: Convex quadratic programming
• Interior-point methods for convex programming
• On some efficient interior point methods for nonlinear convex programming
• The Projective SUMT Method for Convex Programming

Cited in

(25)

• Convergence theorems of homotopy method for constrained nonconvex programming
• A combined homotopy interior point method for the linear complementarity problem
• On the complexity of a combined homotopy interior method for convex programming
• Globally convergent homotopy method for designing piecewise linear deterministic contractual function
• A combined homotopy infeasible interior-point method for convex nonlinear programming
• A combined homotopy interior point method for convex nonlinear programming
• Globally convergent homotopy algorithm for solving the KKT systems to the principal-agent bilevel programming
• Finding a minimal efficient solution of a convex multiobjective program
• A homotopy method for nonlinear second-order cone programming
• Theory of globally convergent probability-one homotopies for nonlinear programming
• scientific article; zbMATH DE number 4057297 (Why is no real title available?)
• A modified homotopy method for solving the principal-agent bilevel programming problem
• Homotopy method for a general multiobjective programming problem
• A spline smoothing homotopy method for nonlinear programming problems with both inequality and equality constraints
• A homotopy method for solving the horizontal linear complementarity problem
• A predictor-corrector algorithm combined conjugate gradient with homotopy interior point for general nonlinear programming
• Solving the Karush-Kuhn-Tucker system of a nonconvex programming problem on an unbounded set
• scientific article; zbMATH DE number 5812524 (Why is no real title available?)
• scientific article; zbMATH DE number 1186903 (Why is no real title available?)
• scientific article; zbMATH DE number 6129489 (Why is no real title available?)
• A constraint shifting homotopy method for general non-linear programming
• Globally convergent method for designing twice spline contractual function
• Dynamic constraint homotopy algorithm for solving a class of extremum problem of function
• An aggregate deformation homotopy method for min-max-min problems with max-min constraints
• Solving generalized equations via homotopies

This page was built for publication: A combined homotopy interior point method for general nonlinear programming problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1354287)