Abstract
We prove the convergence of a steepest descent iterative procedure for determining an “extremal” point of a function defined on a sequentially compact convex subset of a topological vector space. We then apply this procedure to the problem of determining an extremal of a relaxed optimal control problem defined by ordinary differential equations without endpoint or unilateral restrictions.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
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.