Traversing non-convex regions

zbMATH Open1413.90213MaRDI QIDQ4614865FDOQ4614865

Authors: Salah Beddiaf, S. J. Kane, Michael Bartholomew-Biggs 

Publication date: 31 January 2019

Full work available at URL: https://camo.ici.ro/journal/vol15/v15b14.pdf

Recommendations

• A comparison of methods for traversing regions of non-convexity in optimization problems
• Searching for and quantifying nonconvexity regions of functions
• Nonconvex optimization using negative curvature within a modified linesearch
• Publication:3475919
• Non-monotone trust-region algorithms for nonlinear optimization subject to convex constraints

Mathematics Subject Classification ID

Nonconvex programming, global optimization (90C26)

Cited In (3)

• Searching for and quantifying nonconvexity regions of functions
• Continuous steepest descent path for traversing non-convex regions
• A comparison of methods for traversing regions of non-convexity in optimization problems

This page was built for publication: Traversing non-convex regions

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