Abstract
A successive descent algorithm over a system of local minima has been developed to find the global minimum of a function of many variables defined on a simply connected compact set. If the number of local minima is finite and a bound on the global minimum is given, the algorithm finds the global minimum in finitely many steps. Test examples are presented.
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.
