Tighter convex underestimator for general twice differentiable function for global optimization
\nThis paper proposes a new convex underestimator for general C2 nonconvex functions. The new underestimator can be used in the branch and bound algorithm αBB for solving global optimization problems. We show that the new underestimator is tighter than the classical underestimator in the αBB method.\n
Institutions
- Mouloud Mammeri University of Tizi-Ouzou (DZ)
Publication Details
- Journal
- Springer Link (Chiba Institute of Technology)
- Published
- 2024-12-06
- DOI
- https://doi.org/10.1051/ro/2024176/pdf
- Primary Topic
- Education Methods and Technologies
- Type
- article
- Field-Weighted Citation Impact
- 0.00