Reduced-order output feedback control design with specSDP, a code for linear / nonlinear SDP problems

Proceedings of the 5th International Conference on Control and Automation, ICCA'05

Volumn , Issue , 2005, Pages 465-470

  Thevenet, Jean Baptiste ^a,b   Apkarian, Pierre ^a,b   Noll, Dominikus ^a  

^a UNIVERSITÉ DE TOULOUSE   (France)

^b ONERA   (France)

Author keywords

Bilinear matrix inequality; Reduced order control synthesis; Spectral penalty function

Indexed keywords

CODES (STANDARDS); CONSTRAINT THEORY; CONTROL THEORY; FUNCTIONS; LINEAR PROGRAMMING; LINEAR SYSTEMS; MATRIX ALGEBRA; NONLINEAR SYSTEMS; OPTIMIZATION; QUADRATIC PROGRAMMING;

BILINEAR MATRIX INEQUALITY (BMI); REDUCED CONTROL ORDERED SYNTHESIS; SEMIDEFINITE PROGRAMMING (SDP); SPECTRAL PENALTY FUNCTION;

FEEDBACK CONTROL;

EID: 27844596642     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (13)

1. B. D. O. Anderson and S. Vongpanitlerd, Network Analysis, Printice Hall, Englewood Cliffs, 1973.
2. M. J. D. Powell, A method for nonlinear constraints in minimization problem, Optimization, R. Fletcher, Academic Press, London, New York, 1969.
3. M. R. Hestenes, Multiplier and gradient method, J. Optim. Theory Appl., vol. 4, pp 303-320, 1969.
4. M. Kocvara and M. Stingl, A Code for Convex Nonlinear and Semidefinite Programming, Optimization Methods and Software,vol. 18, number 3, pp 317-333, 2003.
5. ∞ Synthesis, To appear in European Journal of Control, vol. 10, number 6, pp 527-538, 2004.
6. L. Mosheyev and M. Zibulevsky, Penalty/Barrier Multiplier Algorithm for Semidefinite Programming, Optimization Methods and Software, vol. 13, number 4, pp 235-261, 2000.
7. A.S. Lewis, Derivatives of spectral functions, Mathematics of Operations Research, vol. 21, pp 576-588, 1996.
8. Robert B. Schnabel and Elizabeth Eskow, A revised modified Cholesky factorization algorithm, SIAM J. on Optimization, vol. 9, number 4, pp 1135-1148, 1999.
9. Aharon Ben-Tal and Michael Zibulevsky, Penalty/Barrier Multiplier Methods for Convex Programming Problems, SIAM J. on Optimization, vol. 7, pp 347-366, 1997.
10. F. Leibfritz and W. Lipinsky, Description of the benchmark examples in Complib 1.0, Technical Report, University of Trier, Dpt. of Mathematics, 2003.
11. M. Zibulevsky, Penalty/Barrier Multiplier Methods for Large-Scale Nonlinear and Semidefinite Programming, Ph. D. Thesis, Technion Israël Institute of Technology, 1996.
12. C. Lin and J. More, Newton's method for large bound-constrained optimization problems, Technical Report, ANL/MCS-P724-0898, Mathematics and Computer Sciences Division, Argonne National Laboratory, 1998.
13. J. B. Thevenet and D. Noll and P. Apkarian, Nonlinear spectral SDP method for BMI-constrained problems: Applications to control design, To appear in Informatics in Control, Automation and Robotics, Kluwer Academic Publishers, Portugal, 2004.