Abstract
Global convergence theorems for a class of descent methods for unconstrained optimization problems in normed spaces using multi directional search are proved Exact and inexact search are considered and the results allow to de ne a globally convergent algorithm for an unconstrained optimal control problem which operates at each step on discrete approximations of the original continuous problem AMS Subject Classi cation M M K
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.
