Abstract
A method for improving local optimal solutions of nonlinear programming problems by treating constraints directly, named "Modal Trimming Method, " has been proposed, and it has turned out that the method has a high possibility of deriving the global optimal solutions by the suboptimal ones for a wide range of problems. It has also been shown that the aforementioned feature, i.e., the capability of the global search for deriving the global optimal solutions, is because the renewal of solutions based on the extended Newton-Raphson method creates a chaos behavior of the solutions. In this paper, the mechanism and conditions for the chaos behavior are clarified, and a strategy for improving the capability of global search is proposed.
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.
