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

DOI10.1016/S0362-546X(97)00516-6MaRDI QIDQ4266399zbMATH OpenOpenAlexFDO

Authors Bo Yu, Guochen Feng, Zhenghua Lin

Publication date 27 September 2000

Published in Nonlinear Analysis: Theory, Methods & Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/s0362-546x(97)00516-6

zbMATH Keywords

interior point methodNonconvex programmingnormal cone conditioncombined homotopy

Mathematics Subject Classification ID

Nonconvex programming, global optimization (90C26) Interior-point methods (90C51)

Recommendations

• Solving the Karush-Kuhn-Tucker system of a nonconvex programming problem on an unbounded set
• A combined homotopy interior point method for general nonlinear programming problems
• scientific article; zbMATH DE number 1816759

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 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-point methods for convex programming
• On projected newton barrier methods for linear programming and an equivalence to Karmarkar’s projective method
• On some efficient interior point methods for nonlinear convex programming
• The Projective SUMT Method for Convex Programming

Cited in

(32)

• The flattened aggregate constraint homotopy method for nonlinear programming problems with many nonlinear constraints
• Solving nonlinear programming problems with unbounded non-convex constraint sets via a globally convergent algorithm
• A homotopy method for getting a local minimum of constrained nonconvex programming
• Condition for global convergence of a homotopy method for variational inequality problems on unbounded sets
• Homotopy method for solving variational inequalities with bounded box constraints
• Strong convergence on the aggregate constraint-shifting homotopy method for solving general nonconvex programming
• On the complexity of a combined homotopy interior method for convex programming
• A smoothing homotopy method for variational inequality problems on polyhedral convex sets
• Globally convergent homotopy method for designing piecewise linear deterministic contractual function
• Solving nonconvex nonlinear programming problems via a new aggregate constraint homotopy method
• A smoothing homotopy method for solving variational inequalities
• A combined homotopy interior point method for convex nonlinear programming
• A globally convergent interior point algorithm for non-convex nonlinear programming
• A comparison of normal cone conditions for homotopy methods for solving inequality constrained nonlinear programming problems
• Globally convergent homotopy algorithm for solving the KKT systems to the principal-agent bilevel programming
• Global convergence analysis of the aggregate constraint homotopy method for nonlinear programming problems with both inequality and equality constraints
• Solving nonlinear programming problems via a homotopy continuation method under three unbounded conditions
• A modified homotopy method for solving the principal-agent bilevel programming problem
• A spline smoothing homotopy method for nonlinear programming problems with both inequality and equality constraints
• A spline smoothing homotopy method for nonconvex nonlinear programming
• Solving the Karush-Kuhn-Tucker system of a nonconvex programming problem on an unbounded set
• The aggregate constraint homotopy method for nonconvex nonlinear programming
• AN ENTROPY CONTINUATION METHOD FOR A CLASS OF THE PERIODICITY PROBLEMS OF ORDINARY DIFFERENTIAL EQUATIONS
• A NEW CONTINUATION METHOD FOR THE PERIODICITY PROBLEMS OF ORDINARY DIFFERENTIAL EQUATIONS
• Homotopy methods for solving variational inequalities in unbounded sets
• A constraint shifting homotopy method for general non-linear programming
• Globally convergent method for designing twice spline contractual function
• An aggregate deformation homotopy method for min-max-min problems with max-min constraints
• Truncated aggregate homotopy method for nonconvex nonlinear programming
• A new homotopy method for solving non-linear complementarity problems
• A continuation method for solving fixed points of self-mappings in general nonconvex sets
• A CONSTRUCTIVE PROOF OF THE EXISTENCE OF THE PERIODIC SOLUTION OF THE PERIODICITY PROBLEMS OF ORDINARY DIFFERENTIAL EQUATIONS VIA A NON-INTERIOR POINT ENTROPY CONTINUATION METHOD

This page was built for publication: Existence of an interior pathway to a Karush-Kuhn-Tucker point of a nonconvex programming problem

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