Abstract
Problems in the optimal control of linear systems with convex costs are recast in a primal-dual (minimax) framework. An approximation scheme which leads to primal and dual optimal control problems n discrete time having similar structure to the original primal-dual pair is ntroduced. The discretizationis shown to be variationally consistent in the sense of epi/hypo-convergence, so that any limit point of solutions for the approximate minimax problems will solve the original primal and dual problems.
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.
