Frequency Response Algorithms for H∞ Optimization with Time Domain Constraints

IEEE Transactions on Automatic Control

Volumn 34, Issue 4, 1989, Pages 427-434

  Sideris, Athanasios ^b  

^a UNIVERSITY OF CALIFORNIA   (United States)

^b CALIFORNIA INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

MATHEMATICAL PROGRAMMING, LINEAR; MATHEMATICAL TECHNIQUES--LEAST SQUARES APPROXIMATIONS; OPTIMIZATION;

FREQUENCY RESPONSE ALGORITHMS; H-INFINITY OPTIMIZATION; LAWSON'S ALGORITHM; TIME DOMAIN CONSTRAINTS; TREFETHEN'S ALGORITHM;

CONTROL SYSTEMS;

EID: 0024648040     PISSN: 00189286     EISSN: 15582523     Source Type: Journal    
DOI: 10.1109/9.28017     Document Type: Article

References (44)

1. H. Kwakernaak and R. Sivan , Linear Optimal Control Systems. New York, Wiley, 1972.
2. G. Zames, “Feedback and optimal sensitivity: Model reference transformations, multiplicative seminorms, and approximate inverses,” IEEE Trans. Automat. Contr., vol. AC-26, no. 4, pp. 301-320, 1981.
3. M. A. Dahleh and J. B. Pearson, Jr.. “l 1 optimal feedback controllers for MIMO discrete-time systems,” IEEE Trans. Automat. Contr., vol. AC-32, pp. 314-323, Apr. 1987.
4. J. C. Doyle and G. Stein, “Multivariable feedback design: concepts for a classical/modern synthesis,” IEEE Trans. Automat. Contr., vol. AC-26, no.1. pp. 4-16, 1981.
5. M. G. Safonov, A. Laub, and G. L. Hartmann, “Feedback properties of multivariable systems: The role and use of the return difference matrix,” IEEE Trans. Automat. Contr., vol. 26, no. 1. pp. 47-65, 1981.
6. J. Bence, J. W. Helton, and D. E. Marshall. “Optimization over H ∞ ,” presented at the IEEE Conf. Decision Contr., Athens, Greece, Dec. 1986.
7. J. C. Doyle, “Synthesis of robust controllers and filters,” in Proc. 22nd Conf. Decision Contr., Antonio. TX. Dec. 1983.
8. J. W. Helton, “An H ∞ approach to control,” presented at the IEEE Conf. Decision Contr., San Antonio, TX, Dec. 1983.
9. H. Kwakernaak, “A polynomial approach to minimax frequency domain optimization of multivariable feedback systems,” Int. J. Contr., vol. 44, no. 1, pp. 117-156, 1986.
10. M. G. Safonov, “L ∞ -optimal sensitivity versus stability margin,” in Proc. 22nd Conf. Decision Contr., San Antonio, TX, 1983.
11. M. Verma and E. Jonckheere, “L ∞ compensation with mixed sensitivity as a broadband matching problem,” Syst. Contr. Lett., vol. 4, pp. 125-129, 1984.
12. M. G. Safonov, “Light bounds on the response of multivariable systems with component uncertainty,” in Proc. 16th Allerton Conf., Monticello, 1L, 1978.
13. J. C. Doyle, “Analysis of feedback systems with structured uncertainty,” IEE Proc., vol. 129, pt. D, no. 6, pp. 242-250, 1981.
14. A. Sideris, “Robust feedback synthesis via conformal mappings and H ∞ optimization,” Ph.D. dissertation, Univ. Southern Calif., Los Angeles, July 1985.
15. D. C. Youla, J. J. Bongiorno, Jr., and C. N. Lu, “Single-loop feedback stabilization of linear multivariable dynamical plants,” Automatica, vol. 10, pp. 159-173, 1974.
16. J. W. Helton, “ H ∞ control for competing objectives,” IEEE Conf. Decision Contr., Las Vegas, NV, 1984.
17. —, “Worst case analysis in the frequency domain: The H ∞ approach to control,” IEEE Trans. Automat. Contr., vol. 30, no. 12, pp. 1154-1170, 1985.
18. A. Sideris and M. G. Safonov, “Design of linear control systems for robust stability and performance,” in Proc. IFAC Workshop on Estimation Contr., Uncertain Syst., Boston, MA, June 1985.
19. A. Sideris and M. G. Safonov, “Robust synthesis of SISO feedback systems using conformal maps and H ∞ theory—A design example,” in Proc. Automat. Contr. Conf., Seattle, WA, June 1986.
20. K. Glover, “All optimal Hankel-norm approximations of linear multivariable systems and their L ∞ error bounds,” Int. J. Contr., vol. 39, no. 6, pp. 1115-1193, 1984.
21. S. Boyd, “Linear controller design as convex programming in l 1 ,” in Proc. Amer. Contr. Conf., Minneapolis, MN, June 1987.
22. C. L. Lawson, “Contributions to the theory of linear least maximum approximations,” M.S. thesis, Univ. Calif., Los Angeles, 1961.
23. L. N. Trefethen, “Rational Chebyshev approximation on the unit disk,” Numeric. Math., vol. 37, 297-320, 1981.
24. R. L. Streit, “An algorithm for the solution of systems of complex linear equations in the l ∞ norm with constraints on the unknowns,” ACM Trans. Math. Software, vol. 11, no. 3, 242-249, 1985.
25. J. R. Rice, The Approximation of Functions, vol. 2: Nonlinear and Multivariate Theory. Reading, MA: Addison-Wesley, 1969.
26. A. K. Cline, “Rate of convergence of Lawson’s algorithm” Math. Comp., vol. 26, pp. 167-176, 1972.
27. S. Elacott and J. Williams, “Linear Chebyshev approximation in the complex plane using Lawson’s algorithm,” Math. Comput., vol. 30, no. 133, pp. 35-44, 1976.
28. M. H. Gutknecht, “Rational Caratheodory-Fejer approximation on a disk, a circle and an interval,” J. Approx. Theory, vol. 41, pp. 257-278, 1984.
29. J. W. Helton, “Broadband gain equalization directly from data,” IEEE Trans. Circuits Syst., vol. CAS-28, pp. 1125-1137, 1981.
30. J. W. Helton and D. Schwarz, “The best approximation to a vector-valued continuous function from the bounded analytic functions,” preprint.
31. J. W. Helton and N. Young, in Proc. Inst. Math. Anal., Univ. Minnesota, 1988.
32. L. Polak and S. Salcudean, “Algorithms for optimal design of feedback compensators,” presented at MTNS 1987, Phoenix, AZ, June 1987.
33. J. R. Rice and K. H. Usow, “The Lawson algorithm and extensions,” Math. Comput., vol. 22, pp. 118-127, 1968.
34. B. A. Francis, “A course in H ∞ control theory,” in Lecture Notes in Control and Information Sciences, M. Thoma and A. Wyner, Eds. New York: Springer-Verlag, vol. 88.
35. A. Sideris and D. Kavranoglu, “ H ∞ optimal control as a weighted Wiener-Hopf problem: The SISO case,” in Proc. 26th Conf. Decision Contr., Los Angeles, CA, Dec. 1987.
36. P. Henrici, “Fast Fourier methods in computational complex analysis,” SIAM Rev., vol. 21, pp. 481-527, 1979.
37. S. Smale, “On the average number of steps of the simplex method of linear programing,” Math. Progr., vol. 27. pp. 241-262, 1983.
38. G. W. Stewart, Introduction of Matrix Computations. New York: Academic, 1973.
39. M. S. Bazaraa and J. J. Jarvis, Linear Programming and Network Flows. New York: Wiley, 1977.
40. R. L. Streit, Personal communication with J. B. Helton.
41. G. A. Watson, Approximation Theory and Numerical Methods. New York: Wiley, 1980.
42. J. W. Helton, J. Bence, and D. F. Schwartz, “A primer on the H ∞ disk method in the frequency domain design: control, documentation for a publicly distributed computer program,” UCSD Tech. Rep., Mar. 1985, preprint.
43. A. C. Allison and N. J. Young, “Numerical algorithms for the Nevalinna-Pick problem,” Numerische Mathematic, vol. 42, pp. 125-145, 1983.
44. J. W. Helton, “Optimization over spaces of analytic functions and the Corona problem,” J. Oper. Theory, vol. 15, pp. 359-375, 1986.