A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is
Proceedings of the 2001 American Control Conference. (Cat. No.01CH37148)
We present a methodology to address the general multiobjective (GMO) control problem involving the L1 norm, U2 norm, U, norm and time-domain constraint (TDC). We show that the problem resulted from imposing a regularizing condition always admits an optimal solution, and suboptimal solutions with performance arbitrarily close to the optimal cost can be obtained by constructing two sequences of finite dimensional convex optimization problems whose objective values converge to the optimum fromdoi:10.1109/acc.2001.946297 fatcat:b3rmly43knemhhoeaphngf7psq