Abstract
The multiblock l1-optimal control problem for single-input single-output (SISO) plants is considered. It is shown that it can be converted via polynomial equation techniques to an infinite-dimensional linear programming (LP) problem. Finite dimensional sub/super approximations can be determined by considering two sequences of modified finite-dimensional linear programming problems derived directly from the YJBK parameterisation by exploiting the underlying algebraic structure. This approach induces the application of a consistent truncation strategy that leads to a redundancy-free constraint formulation and, as a consequence, to linear programming problems less affected by degeneracy. Further, more insight on the algebraic structure of the problem and on the achievement of exact rational solutions is provided, allowing the development of a simple and conceptually attractive theory.
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.
