Abstract

Du and Zhang (1989) recently proved that Rosen's gradient projection method converges when using either exact or Armijo-type inexact line searches. We show here that the method fails to converge when the inexact line search proposed in the original paper is used. The same quadratic programming counterexample can be used to show that Ritter's method with Rosen's inexact line search also fails to converge.

Full Text
Paper version not known

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 call

Disclaimer: 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.