Abstract
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.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
