Abstract
Nine different techniques of unconstrained minimization are applied to the same problem and their relative efficiency is compared. The techniques used are of gradient, variable metric type, used in conjunction with the sequential unconstrained minimization techniques (SUMT) program. The problem tested has nonlinear inequality constraints up to the ninth order.
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.
