Abstract
A fast and reliable non-gradient optimisation method is proposed. The basic structure of the proposed numerical method is a binary matrix in which each row represents an encoded string for the corresponding parameter. The operations of adding a binary digit and performing an increment or a decrement to a selected row make successive approximations of the local minima, and the restart is undertaken from an unexplored initial matrix as an escape scheme. To verify the feasibility of the proposed method for global optimisation, several test functions are optimised as a benchmark, and the parameter identification of an induction motor is carried out on experimental data. Both the results of the benchmarking and the parameter identification show that the proposed non-gradient optimisation method is capable of fast and reliable global search for various problems.
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.
