In this paper, we propose a new convex underestimator for a general C 2 nonconvex function. The new underestimator can be used in branch and bound algorithm for solving global optimization problems. We show that the new underestimator is tighter than the classical underestimator in the α BB method.
No takes yet. Share an insight, caveat, or question.
Ouanès et al. (2024) studied this question.
Synapse has enriched 5 closely related papers on similar clinical questions. Consider them for comparative context: