A homotopy method for getting a local minimum of constrained nonconvex programming
From MaRDI portal
Publication:838080
DOI10.1016/J.NA.2009.03.039zbMATH Open1178.90319OpenAlexW2050394153MaRDI QIDQ838080FDOQ838080
Qinghuai Liu, Cai-ling Wang, Wenjuan Sun
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
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
- 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
- Title not available (Why is that?)
- 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
- Title not available (Why is that?)
- Theory of globally convergent probability-one homotopies for nonlinear programming
- Solving the Karush-Kuhn-Tucker system of a nonconvex programming problem on an unbounded set
Cited In (2)
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)
