메뉴 건너뛰기




Volumn 13, Issue 12, 2003, Pages 1137-1148

Fixed-order H∞ control design via a partially augmented Lagrangian method

Author keywords

Augmented Lagrangian method; Fixed order synthesis; Linear matrix inequalities; Rank constraints; Reduced order synthesis; Robust synthesis; Semi definite programming

Indexed keywords

CONSTRAINT THEORY; CONTROL SYSTEM SYNTHESIS; LAGRANGE MULTIPLIERS; MATHEMATICAL MODELS; MATRIX ALGEBRA; ROBUSTNESS (CONTROL SYSTEMS);

EID: 0142059838     PISSN: 10498923     EISSN: None     Source Type: Journal    
DOI: 10.1002/rnc.807     Document Type: Article
Times cited : (92)

References (23)
  • 1
    • 0030693425 scopus 로고    scopus 로고
    • Solving a class of rank minimization problems via semi-definite programs, with applications to the fixed order output feedback synthesis
    • Mesbahi M, Papavassilopoulos GP. Solving a class of rank minimization problems via semi-definite programs, with applications to the fixed order output feedback synthesis. In Proceedings of the American Control Conference, 1997.
    • Proceedings of the American Control Conference, 1997
    • Mesbahi, M.1    Papavassilopoulos, G.P.2
  • 3
    • 0035836297 scopus 로고    scopus 로고
    • An augmented lagrangian method for a class of LMI-constrained problems in robust control theory
    • Fares B, Apkarian P, Noll D. An augmented lagrangian method for a class of LMI-constrained problems in robust control theory. International Journal of Control 2001; 74: 348-360.
    • (2001) International Journal of Control , vol.74 , pp. 348-360
    • Fares, B.1    Apkarian, P.2    Noll, D.3
  • 4
    • 0026136104 scopus 로고
    • A globally convergent augmented Lagrangian algorithm for optimization with general constraints and simple bounds
    • Conn AR, Gould NIM, Toint PL. A globally convergent augmented Lagrangian algorithm for optimization with general constraints and simple bounds, SIAM Journal on Numerical Analysis 1991; 28: 545-572.
    • (1991) SIAM Journal on Numerical Analysis , vol.28 , pp. 545-572
    • Conn, A.R.1    Gould, N.I.M.2    Toint, P.L.3
  • 5
    • 44649149897 scopus 로고
    • Sequential quadratic programming
    • Boggs PT, Tolle JW. Sequential Quadratic Programming, Acta Numerica, 1995; 1-52.
    • (1995) Acta Numerica , pp. 1-52
    • Boggs, P.T.1    Tolle, J.W.2
  • 6
    • 0142083928 scopus 로고
    • Local convergence properties of two augmented Lagrangian algorithms for optimization with a combination of general equality and linear constraints
    • Technical Report TR/PA/93/27, CERFACS, Toulouse, France
    • Conn AR, Gould NIM, Sartenaer A, Toint PL. Local convergence properties of two augmented Lagrangian algorithms for optimization with a combination of general equality and linear constraints. Technical Report TR/PA/93/27, CERFACS, Toulouse, France, 1993.
    • (1993)
    • Conn, A.R.1    Gould, N.I.M.2    Sartenaer, A.3    Toint, P.L.4
  • 7
    • 0030303858 scopus 로고    scopus 로고
    • Convergence properties of an augmented Lagrangian algorithm for optimization with a combination of general equality and linear constraints
    • Conn AR, Gould NIM, Sartenaer A, Toint PL. Convergence properties of an augmented Lagrangian algorithm for optimization with a combination of general equality and linear constraints. SIAM Journal on Optimization 1996; 6: 674-703.
    • (1996) SIAM Journal on Optimization , vol.6 , pp. 674-703
    • Conn, A.R.1    Gould, N.I.M.2    Sartenaer, A.3    Toint, P.L.4
  • 8
    • 0242679075 scopus 로고    scopus 로고
    • Partially augmented Lagrangian method for matrix inequality constraints
    • (Rapport Interne, MIP, UMR 5640, Maths. Dept.- Paul Sabatier University), submitted
    • Noll D, Torki M, Apkarian P. Partially augmented Lagrangian method for matrix inequality constraints. (Rapport Interne, MIP, UMR 5640, Maths. Dept.- Paul Sabatier University), submitted.
    • Noll, D.1    Torki, M.2    Apkarian, P.3
  • 12
    • 0142115492 scopus 로고
    • Convergence rates for conditional gradients sequences generated by implicit step length rules
    • Dunn JC. Convergence rates for conditional gradients sequences generated by implicit step length rules. SIAM Journal on Control and Optimization 1979; 18: 473-487.
    • (1979) SIAM Journal on Control and Optimization , vol.18 , pp. 473-487
    • Dunn, J.C.1
  • 18
    • 0021482384 scopus 로고
    • On the global convergence of trust-region algorithms for unconstrained optimization
    • Powell M. On the global convergence of trust-region algorithms for unconstrained optimization. Math. Programming 1984; 29: 297-303.
    • (1984) Math. Programming , vol.29 , pp. 297-303
    • Powell, M.1
  • 19
    • 0142052140 scopus 로고    scopus 로고
    • Using SeDuMi 1.02, a matlab toolbox for optimization over symmetric cones
    • Technical Report, Tilburg University, Tilburg, Netherlands, October
    • Sturm JF. Using SeDuMi 1.02, A Matlab Toolbox for Optimization over Symmetric Cones, Technical Report, Tilburg University, Tilburg, Netherlands, October 2001.
    • (2001)
    • Sturm, J.F.1
  • 21


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.