Feasibility analysis of the bilinear matrix inequalities with an application to multi-objective nonlinear observer design

Yan Wang, Rajesh Rajamani

Research output: Chapter in Book/Report/Conference proceedingConference contribution

7 Citations (Scopus)

Abstract

This paper develops a convex optimization method to analyze the feasibility of a nonconvex bilinear matrix inequality (BMI), which is traditionally treated as a NP hard problem. First, a sufficient condition for the convexity of a quadratic matrix inequality (QMI), which is a more general semidefinite constraint than a BMI, is presented. It will be shown that the satisfaction of sufficient convexity condition implies that the QMI constraint can be transferred into an equivalent linear matrix inequality (LMI) constraint, which can be efficiently solved by well-developed interior-point algorithms. This result constitutes perhaps the first systematic methodology to verify the convexity of QMIs in the literature of semidefinite programming (SDP) in Control. For the BMI problem, a method to derive a convex inner approximation is discussed. The BMI feasibility analysis method is then applied to a nonlinear observer design problem where the estimation error dynamics is transformed into a Lure system with a sector condition constructed from the element-wise bounds on the Jacobian matrix of the nonlinearities. The developed numerical algorithm is used to design a nonlinear observer that satisfies multiple performance criteria simultaneously.

Original languageEnglish (US)
Title of host publication2016 IEEE 55th Conference on Decision and Control, CDC 2016
PublisherInstitute of Electrical and Electronics Engineers Inc.
Pages3252-3257
Number of pages6
ISBN (Electronic)9781509018376
DOIs
StatePublished - Dec 27 2016
Event55th IEEE Conference on Decision and Control, CDC 2016 - Las Vegas, United States
Duration: Dec 12 2016Dec 14 2016

Publication series

Name2016 IEEE 55th Conference on Decision and Control, CDC 2016

Other

Other55th IEEE Conference on Decision and Control, CDC 2016
CountryUnited States
CityLas Vegas
Period12/12/1612/14/16

Fingerprint

Nonlinear Observer
Observer Design
Matrix Inequality
Convexity
Inequality Constraints
Jacobian matrices
Convex optimization
Interior-point Algorithm
Linear matrix inequalities
Semidefinite Programming
Jacobian matrix
Error analysis
Estimation Error
NP-hard Problems
Feasibility analysis
Observer
Convex Optimization
Computational complexity
Numerical Algorithms
Optimization Methods

Cite this

Wang, Y., & Rajamani, R. (2016). Feasibility analysis of the bilinear matrix inequalities with an application to multi-objective nonlinear observer design. In 2016 IEEE 55th Conference on Decision and Control, CDC 2016 (pp. 3252-3257). [7798758] (2016 IEEE 55th Conference on Decision and Control, CDC 2016). Institute of Electrical and Electronics Engineers Inc.. https://doi.org/10.1109/CDC.2016.7798758

Feasibility analysis of the bilinear matrix inequalities with an application to multi-objective nonlinear observer design. / Wang, Yan; Rajamani, Rajesh.

2016 IEEE 55th Conference on Decision and Control, CDC 2016. Institute of Electrical and Electronics Engineers Inc., 2016. p. 3252-3257 7798758 (2016 IEEE 55th Conference on Decision and Control, CDC 2016).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Wang, Y & Rajamani, R 2016, Feasibility analysis of the bilinear matrix inequalities with an application to multi-objective nonlinear observer design. in 2016 IEEE 55th Conference on Decision and Control, CDC 2016., 7798758, 2016 IEEE 55th Conference on Decision and Control, CDC 2016, Institute of Electrical and Electronics Engineers Inc., pp. 3252-3257, 55th IEEE Conference on Decision and Control, CDC 2016, Las Vegas, United States, 12/12/16. https://doi.org/10.1109/CDC.2016.7798758
Wang Y, Rajamani R. Feasibility analysis of the bilinear matrix inequalities with an application to multi-objective nonlinear observer design. In 2016 IEEE 55th Conference on Decision and Control, CDC 2016. Institute of Electrical and Electronics Engineers Inc. 2016. p. 3252-3257. 7798758. (2016 IEEE 55th Conference on Decision and Control, CDC 2016). https://doi.org/10.1109/CDC.2016.7798758
Wang, Yan ; Rajamani, Rajesh. / Feasibility analysis of the bilinear matrix inequalities with an application to multi-objective nonlinear observer design. 2016 IEEE 55th Conference on Decision and Control, CDC 2016. Institute of Electrical and Electronics Engineers Inc., 2016. pp. 3252-3257 (2016 IEEE 55th Conference on Decision and Control, CDC 2016).
@inproceedings{1cefccfac6054fa9b11d230291b885e5,
title = "Feasibility analysis of the bilinear matrix inequalities with an application to multi-objective nonlinear observer design",
abstract = "This paper develops a convex optimization method to analyze the feasibility of a nonconvex bilinear matrix inequality (BMI), which is traditionally treated as a NP hard problem. First, a sufficient condition for the convexity of a quadratic matrix inequality (QMI), which is a more general semidefinite constraint than a BMI, is presented. It will be shown that the satisfaction of sufficient convexity condition implies that the QMI constraint can be transferred into an equivalent linear matrix inequality (LMI) constraint, which can be efficiently solved by well-developed interior-point algorithms. This result constitutes perhaps the first systematic methodology to verify the convexity of QMIs in the literature of semidefinite programming (SDP) in Control. For the BMI problem, a method to derive a convex inner approximation is discussed. The BMI feasibility analysis method is then applied to a nonlinear observer design problem where the estimation error dynamics is transformed into a Lure system with a sector condition constructed from the element-wise bounds on the Jacobian matrix of the nonlinearities. The developed numerical algorithm is used to design a nonlinear observer that satisfies multiple performance criteria simultaneously.",
author = "Yan Wang and Rajesh Rajamani",
year = "2016",
month = "12",
day = "27",
doi = "10.1109/CDC.2016.7798758",
language = "English (US)",
series = "2016 IEEE 55th Conference on Decision and Control, CDC 2016",
publisher = "Institute of Electrical and Electronics Engineers Inc.",
pages = "3252--3257",
booktitle = "2016 IEEE 55th Conference on Decision and Control, CDC 2016",

}

TY - GEN

T1 - Feasibility analysis of the bilinear matrix inequalities with an application to multi-objective nonlinear observer design

AU - Wang, Yan

AU - Rajamani, Rajesh

PY - 2016/12/27

Y1 - 2016/12/27

N2 - This paper develops a convex optimization method to analyze the feasibility of a nonconvex bilinear matrix inequality (BMI), which is traditionally treated as a NP hard problem. First, a sufficient condition for the convexity of a quadratic matrix inequality (QMI), which is a more general semidefinite constraint than a BMI, is presented. It will be shown that the satisfaction of sufficient convexity condition implies that the QMI constraint can be transferred into an equivalent linear matrix inequality (LMI) constraint, which can be efficiently solved by well-developed interior-point algorithms. This result constitutes perhaps the first systematic methodology to verify the convexity of QMIs in the literature of semidefinite programming (SDP) in Control. For the BMI problem, a method to derive a convex inner approximation is discussed. The BMI feasibility analysis method is then applied to a nonlinear observer design problem where the estimation error dynamics is transformed into a Lure system with a sector condition constructed from the element-wise bounds on the Jacobian matrix of the nonlinearities. The developed numerical algorithm is used to design a nonlinear observer that satisfies multiple performance criteria simultaneously.

AB - This paper develops a convex optimization method to analyze the feasibility of a nonconvex bilinear matrix inequality (BMI), which is traditionally treated as a NP hard problem. First, a sufficient condition for the convexity of a quadratic matrix inequality (QMI), which is a more general semidefinite constraint than a BMI, is presented. It will be shown that the satisfaction of sufficient convexity condition implies that the QMI constraint can be transferred into an equivalent linear matrix inequality (LMI) constraint, which can be efficiently solved by well-developed interior-point algorithms. This result constitutes perhaps the first systematic methodology to verify the convexity of QMIs in the literature of semidefinite programming (SDP) in Control. For the BMI problem, a method to derive a convex inner approximation is discussed. The BMI feasibility analysis method is then applied to a nonlinear observer design problem where the estimation error dynamics is transformed into a Lure system with a sector condition constructed from the element-wise bounds on the Jacobian matrix of the nonlinearities. The developed numerical algorithm is used to design a nonlinear observer that satisfies multiple performance criteria simultaneously.

UR - http://www.scopus.com/inward/record.url?scp=85010756213&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=85010756213&partnerID=8YFLogxK

U2 - 10.1109/CDC.2016.7798758

DO - 10.1109/CDC.2016.7798758

M3 - Conference contribution

AN - SCOPUS:85010756213

T3 - 2016 IEEE 55th Conference on Decision and Control, CDC 2016

SP - 3252

EP - 3257

BT - 2016 IEEE 55th Conference on Decision and Control, CDC 2016

PB - Institute of Electrical and Electronics Engineers Inc.

ER -