Homotopy method for getting a local minimum of unconstrained non-convex programming

zbMATH Open1228.90086MaRDI QIDQ3089846FDOQ3089846

Authors: Wenjuan Sun, Zhongfan Li, Cai-ling Wang, Ming-Ming Wang 

Publication date: 25 August 2011

Recommendations

• Homotopy method for getting a local minimum of a class of non-convex programming
• A homotopy method for getting a local minimum of constrained nonconvex programming
• Convergence theorems of the homotopy method for nonconvex programming in unbounded sets
• Convergence theorems of homotopy method for constrained nonconvex programming
• scientific article; zbMATH DE number 2164053

zbMATH Keywords

homotopy methodlocal minimumunconstrained nonconvex programming

Mathematics Subject Classification ID

Nonconvex programming, global optimization (90C26)

Cited In (5)

• A homotopy method for getting a local minimum of constrained nonconvex programming
• Convergence theorems of the homotopy method for nonconvex programming in unbounded sets
• Dynamic constrained homotopy algorithms for solving extremum of functions in nonconvex domains with holes
• Title not available (Why is that?)
• Homotopy method for getting a local minimum of a class of non-convex programming

This page was built for publication: Homotopy method for getting a local minimum of unconstrained non-convex programming

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