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

DOI10.1016/J.NA.2009.03.039MaRDI QIDQ838080zbMATH OpenOpenAlexFDO

Authors Wenjuan Sun, Qinghuai Liu, 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

interior point methodhomotopy methodlocal minimumK-K-T point

Mathematics Subject Classification ID

Nonlinear programming (90C30)

Recommendations

• Homotopy method for getting a local minimum of a class of non-convex programming
• Homotopy method for getting a local minimum of unconstrained non-convex programming
• Convergence theorems of homotopy method for constrained nonconvex programming
• Convergence theorems of the homotopy method for nonconvex programming in unbounded sets
• A combined homotopy infeasible interior point method for nonconvex programming

Cites work

• scientific article; zbMATH DE number 3809326 (Why is no real title available?)
• scientific article; zbMATH DE number 47206 (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
• Existence of an interior pathway to a Karush-Kuhn-Tucker point of a nonconvex programming problem
• 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
• 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

Cited in

(6)

• Convergence theorems of homotopy method for constrained nonconvex programming
• A homotopy method for solving nonconvex optimization with a weak quasi normal cone condition
• Dynamic constrained homotopy algorithms for solving extremum of functions in nonconvex domains with holes
• A constraint shifting homotopy method for general non-linear programming
• Homotopy method for getting a local minimum of unconstrained non-convex programming
• Homotopy method for getting a local minimum of a class of non-convex programming

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

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