A homotopy method for getting a local minimum of constrained nonconvex programming

DOI10.1016/j.na.2009.03.039zbMath1178.90319OpenAlexW2050394153MaRDI QIDQ838080

Qinghuai Liu, Wenjuan Sun, Cai-ling Wang

Publication date: 21 August 2009

Published in: Nonlinear Analysis. Theory, Methods \& Applications. Series A: Theory and Methods (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.na.2009.03.039

zbMATH Keywords

local minimumhomotopy methodinterior point methodK-K-T point

Mathematics Subject Classification ID

Nonlinear programming (90C30)

Related Items (1)

A constraint shifting homotopy method for general non-linear programming

Cites Work

• Unnamed Item
• Unnamed Item
• 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
• Solving the Karush-Kuhn-Tucker system of a nonconvex programming problem on an unbounded set
• Theory of Globally Convergent Probability-One Homotopies for Nonlinear Programming
• A Constructive Proof of the Brouwer Fixed-Point Theorem and Computational Results
• Finding Zeroes of Maps: Homotopy Methods That are Constructive With Probability One
• Existence of an interior pathway to a Karush-Kuhn-Tucker point of a nonconvex programming problem

This page was built for publication: A homotopy method for getting a local minimum of constrained nonconvex programming