Abstract
Abstract In this work, an active set strategy is used together with a Coleman–Li strategy and penalty method to transform a general nonlinear programming problem with bound on the variables to unconstrained optimization problem with bound on the variables. A trust-region globalization strategy is used to compute a step. A global convergence theory for the proposed algorithm is presented under credible assumptions. Prefatory numerical experiment on the algorithm is presented. The rendering of the algorithm is reported on some classical problem.
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.
