Abstract
The classical trust region algorithm was extended to the nonsmooth minimization problem successful by Qi and Sun. Combining the trust region algorithm of Qi and Sun with the nonmonotone technique. Xi, Wu and Zhou presented a nonmonotone trust region algorithm for the unconstrained nonsmooth optimization problems where the objective function is locally Lipschitzian, and the local convergence results was established. This paper prove that our nonmonotone trust region algorithm is globally convergent.
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.
