A continuous method for solving nonconvex optimization problem

MaRDI QIDQ4926558zbMATH OpenFDO

Authors Hongliang Shu, Chunyang Zhang

Publication date 20 June 2013

zbMATH Keywords

homotopy interior methodpositive independent mappingweak quasi-normal

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 1816759
• A combined homotopy infeasible interior point method for nonconvex programming
• Homotopy method for getting a local minimum of a class of non-convex programming
• Convergence theorems of the homotopy method for nonconvex programming in unbounded sets
• Solving a class of nonlinear programming problems via a homotopy continuation method

Cited in

(8)

• A fast continuous time approach with time scaling for nonsmooth convex optimization
• A new method for nonsmooth convex optimization
• Solving a class of nonlinear programming problems via a homotopy continuation method
• Dynamic constrained homotopy algorithms for solving extremum of functions in nonconvex domains with holes
• Dynamic constraint homotopy algorithm for solving a class of extremum problem of function
• scientific article; zbMATH DE number 5670876 (Why is no real title available?)
• On the calculation of a feasible point of a nonconvex set: pathfollowing with jumps
• scientific article; zbMATH DE number 1816759 (Why is no real title available?)

This page was built for publication: A continuous method for solving nonconvex optimization problem

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