Convergence and restart in branch-and-bound algorithms for global optimization. Application to concave minimization and d.c. optimization problems

From MaRDI portal

(Redirected from Convergence and restart in branch-and-bound algorithms for global optimization. Application to concave minimization and d.c. optimization problems)

Jump to:navigation, search

WARNING: Page is not linked to a MaRDI-Entity. Please add Sitelink / Wikibase-link.

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Convergence_and_restart_in_branch-and-bound_algorithms_for_global_optimization._Application_to_concave_minimization_and_d.c._optimization_problems&oldid=66732150"