Continuous steepest descent path for traversing non-convex regions

zbMATH Open1173.65042MaRDI QIDQ3397670FDOQ3397670

Authors:

Publication date: 22 September 2009

Recommendations

• A comparison of methods for traversing regions of non-convexity in optimization problems
• scientific article; zbMATH DE number 4049405
• Traversing non-convex regions
• Nonmonotone trust region methods with curvilinear path in unconstrained optimization
• scientific article; zbMATH DE number 465313

zbMATH Keywords

numerical examplesalgorithmunconstrained optimizationnonconvex programmingline searchtrust-regioncontinuous steepest descent pathgradient-flow methodordinary differential equation trajectory following

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Nonconvex programming, global optimization (90C26) Interior-point methods (90C51)

Cited In (2)

• A comparison of methods for traversing regions of non-convexity in optimization problems
• Global convergence of a curvilinear search for non-convex optimization

Uses Software

• CSDP

This page was built for publication: Continuous steepest descent path for traversing non-convex regions

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