• 제목/요약/키워드: Matrix inequalities

검색결과 360건 처리시간 0.023초

A Study on Linear Matrix Inequalities Robust Active Suspension Control System Design Algorithm

  • Park, Jung-Hyen
    • Journal of information and communication convergence engineering
    • /
    • 제6권1호
    • /
    • pp.105-109
    • /
    • 2008
  • A robust optimal control system design algorithm in active suspension equipment adopting linear matrix inequalities control system design theory is presented. The validity of the linear matrix inequalities robust control system design in active suspension system through the numerical examples is also investigated.

ON SOME MATRIX INEQUALITIES

  • Lee, Hyun Deok
    • Korean Journal of Mathematics
    • /
    • 제16권4호
    • /
    • pp.565-571
    • /
    • 2008
  • In this paper we present some trace inequalities for positive definite matrices in statistical mechanics. In order to prove the method of the uniform bound on the generating functional for the semi-classical model, we use some trace inequalities and matrix norms and properties of trace for positive definite matrices.

  • PDF

TWO INEQUALITIES INVOLVING HADAMARD PRODUCTS OF POSITIVE SEMI-DEFINITE HERMITIAN MATRICES

  • Cao, Chong-Guang;Yang, Zhong-Peng;Xian Zhang
    • Journal of applied mathematics & informatics
    • /
    • 제10권1_2호
    • /
    • pp.101-109
    • /
    • 2002
  • We extend two inequalities involving Hadamard Products of Positive definite Hermitian matrices to positive semi-definite Hermitian matrices. Simultaneously, we also show the sufficient conditions for equalities to hold. Moreover, some other matrix inequalities are also obtained. Our results and methods we different from those which are obtained by S. Liu in [J. Math. Anal. Appl. 243:458-463(2000)] and B.-Y Wang et al in [Lin. Alg. Appl. 302-303: 163-172(1999)] .

A Study on Intelligent Decentralized Active Suspension Control System with Descriptor LMI Design Method

  • Park, Jung-Hyen
    • Journal of information and communication convergence engineering
    • /
    • 제6권2호
    • /
    • pp.198-203
    • /
    • 2008
  • An Intelligent optimal control system design algorithm in active suspension equipment adopting linear matrix inequalities control system design theory with representing by descriptor system form is presented. The validity of the linear matrix inequalities intelligent decentralized control system design with representing by descriptor system form in active suspension system through the numerical examples is also investigated.

Approach to BMI Problems Using Evolution Strategy

  • Chung, Tae-Jin;Chung, Chan-Soo
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 제어로봇시스템학회 2000년도 제15차 학술회의논문집
    • /
    • pp.224-224
    • /
    • 2000
  • Biaffine Matrix Inequalities(BIs) are known to give more general and flexible frameworks in control designs than Linear Matrix Inequalities(LMIs). However, BMIs are nonconvex constraints and very difficult to solve. In this paper, BMI problems are solved using Evolution Strategy(ES). Numerous BMI problems are solved to verify performances of ES solver for BMI problems and compared with those of Genetic Algorithms and Branch-and-Cut algorithm.

  • PDF

Sets of Integer Matrix Pairs Derived from Row Rank Inequalities and Their Preservers

  • Song, Seok-Zun;Jun, Young-Bae
    • Kyungpook Mathematical Journal
    • /
    • 제53권2호
    • /
    • pp.273-283
    • /
    • 2013
  • In this paper, we consider the row rank inequalities derived from comparisons of the row ranks of the additions and multiplications of nonnegative integer matrices and construct the sets of nonnegative integer matrix pairs which is occurred at the extreme cases for the row rank inequalities. We characterize the linear operators that preserve these extreme sets of nonnegative integer matrix pairs.

EXTREME PRESERVERS OF FUZZY MATRIX PAIRS DERIVED FROM ZERO-TERM RANK INEQUALITIES

  • Song, Seok-Zun;Park, Eun-A
    • 호남수학학술지
    • /
    • 제33권3호
    • /
    • pp.301-310
    • /
    • 2011
  • In this paper, we construct the sets of fuzzy matrix pairs. These sets are naturally occurred at the extreme cases for the zero-term rank inequalities derived from the multiplication of fuzzy matrix pairs. We characterize the linear operators that preserve these extreme sets of fuzzy matrix pairs.

EXTREME SETS OF RANK INEQUALITIES OVER BOOLEAN MATRICES AND THEIR PRESERVERS

  • Song, Seok Zun;Kang, Mun-Hwan;Jun, Young Bae
    • 대한수학회논문집
    • /
    • 제28권1호
    • /
    • pp.1-9
    • /
    • 2013
  • We consider the sets of matrix ordered pairs which satisfy extremal properties with respect to Boolean rank inequalities of matrices over nonbinary Boolean algebra. We characterize linear operators that preserve these sets of matrix ordered pairs as the form of $T(X)=PXP^T$ with some permutation matrix P.

Linear Matrix Inequalities(LMIs)를 이용한 강인한 LQR/LQG 제어기의 설계 (Design of robust LQR/LQG controllers by LMIs)

  • 유지환;박영진
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 제어로봇시스템학회 1996년도 한국자동제어학술회의논문집(국내학술편); 포항공과대학교, 포항; 24-26 Oct. 1996
    • /
    • pp.988-991
    • /
    • 1996
  • The purpose of this thesis is to develop methods of designing robust LQR/LQG controllers for time-varying systems with real parametric uncertainties. Controller design that meet desired performance and robust specifications is one of the most important unsolved problems in control engineering. We propose a new framework to solve these problems using Linear Matrix Inequalities (LMls) which have gained much attention in recent years, for their computational tractability and usefulness in control engineering. In Robust LQR case, the formulation of LMI based problem is straightforward and we can say that the obtained solution is the global optimum because the transformed problem is convex. In Robust LQG case, the formulation is difficult because the objective function and constraint are all nonlinear, therefore these are not treatable directly by LMI. We propose a sequential solving method which consist of a block-diagonal approach and a full-block approach. Block-diagonal approach gives a conservative solution and it is used as a initial guess for a full-block approach. In full-block approach two LMIs are solved sequentially in iterative manner. Because this algorithm must be solved iteratively, the obtained solution may not be globally optimal.

  • PDF