Abstract
In this study, we introduce a new global optimization technique for a multi-dimensional unconstrained optimization problem. First, we present a new smoothing auxiliary function. Second, we transform the multi-dimensional problem into a one-dimensional problem by using an auxiliary function to reduce the number of local minimizers and then we find the global minimizer of the one-dimensional problem. Finally, we find the global minimizer of the multi-dimensional smooth objective function with the help of a new algorithm.
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.
