Abstract
Considers a constrained optimal control problem, in which the /spl Hscr//sub /spl infin// norm of some transfer matrix is to remain bounded by some number while an objective function is minimized. All /spl Hscr//sub 2///spl Hscr//spl infin/, l/sup 1///spl Hscr//sub /spl infin// and time domain constrained /spl Hscr//sub /spl infin// are contained in the author's formulation. It is shown that a suboptimal solution may be computed by solving a finite dimensional, convex optimization problem. This problem may be constructed a priori in terms of the data and is usually large. Hence an iterative algorithm with guaranteed convergence is also given for the computation of an approximate solution.
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.
