Abstract
In this paper, an expansion scheme for general functions is presented, which can be used to achieve better enclosure of function ranges. In the context of interval branch-and-bound methods for non-smooth global optimization, a pruning technique is given via the expansion. An interval pruning test is established. This pruning test offers the possibility to cut away a large part of the currently investigated box by the optimization algorithm, which can be utilized as an accelerating device similar to the monotonicity test frequently used in interval methods for smooth problems. Numerical computation shows that the proposed method is reliable and can find all solutions of global optimization problem.
Sign-in/Register to access full text options 
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.
