Abstract
The conundrum of the non-convex global optimization is that there are multiple local minima which are not global optimal solution, and conventional algorithms drop into local optimum easily. Filled function method is an available way which generally invokes an auxiliary function to move successively from a local minimizer to another better one. Definition-based on filled function, a new filled function with easy- adjustment parameter, simple form and non- exponential is proposed, and then prove the filled function can maintain the padding properties. Moreover, a local search method with stochastic and uniformity strategy is designed to strengthen the local search. Based on the above, a new filled function algorithm is presented. The numerical results indicate the proposed algorithm is feasible and effective, it follows that the stochastic and uniform strategy design is valid, further, the analysis and comparison of numerical experiments manifest high-efficiency, good stability and easy-realization.
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.
