Infeasible interior-point homotopy method for non-convex programming under normal cone condition

zbMATH Open1150.90449MaRDI QIDQ3501411FDOQ3501411

Authors: Yihua Yang, Xianrui Lü, Qinghuai Liu 

Publication date: 3 June 2008

Recommendations

• A combined homotopy infeasible interior point method for nonconvex programming
• A combined homotopy method under quasi-cone condition for non-convex nonlinear programming with equality and inequality constrains
• scientific article; zbMATH DE number 1816759
• A combined homotopy infeasible interior-point method for convex nonlinear programming
• A homotopy method for solving nonconvex optimization with a weak quasi normal cone condition

zbMATH Keywords

non-convex programminghomotopy methodcombined homotopy infeasible interior-point method

Mathematics Subject Classification ID

Nonconvex programming, global optimization (90C26) Interior-point methods (90C51)

Cited In (6)

• A method to construct a quasi-normal cone for a class of complexity non-convex sets and its applications in solving non-convex programming
• A comparison of normal cone conditions for homotopy methods for solving inequality constrained nonlinear programming problems
• Title not available (Why is that?)
• A modified constraint shifting homotopy method for solving general nonlinear multiobjective programming
• Title not available (Why is that?)
• Construct a quasi-normal cone for nonconvex sets and its applications in solving nonconvex programming

This page was built for publication: Infeasible interior-point homotopy method for non-convex programming under normal cone condition

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