Abstract
AbstractBased on recent work by Powell, a new optimization algorithm is presented. It merges the Newton‐Raphson method and quadratic programming. A unique feature is that one does not converge the equality and tight inequality constraints for each step taken by the optimization algorithm. The article show how to perform the necessary calculations efficiently for very large problems which require the use of mass memory. Experience with the algorithm on small problems indicates it converges exceptionally quickly to the optimal answer, often in as few iterations (5 to 15) as are needed to perform a single simulation with no optimization using more conventional approaches.
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.
