Convergence theorems of the homotopy method for nonconvex programming in unbounded sets

MaRDI QIDQ4928048zbMATH OpenFDO

Authors Wenjuan Sun, Cai-ling Wang

Publication date 20 June 2013

zbMATH Keywords

nonconvex programmingunbounded sethomotopy methodlocal optimal solution

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Nonconvex programming, global optimization (90C26)

Recommendations

• scientific article; zbMATH DE number 2164053
• Convergence theorems of homotopy method for constrained nonconvex programming
• A combined homotopy method for nonconvex programming with unbounded feasible set
• 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

Cited in

(11)

• Convergence theorems of homotopy method for constrained nonconvex programming
• A combined homotopy method for nonconvex programming with unbounded feasible set
• A continuous method for solving nonconvex optimization problem
• 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
• Solving a class of nonlinear programming problems via a homotopy continuation method
• scientific article; zbMATH DE number 2164053 (Why is no real title available?)
• A continuation method for solving K-K-T points of general unbounded nonconvex programming problems
• scientific article; zbMATH DE number 1816759 (Why is no real title available?)
• 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: Convergence theorems of the homotopy method for nonconvex programming in unbounded sets

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