Global optimization for the Biaffine Matrix Inequality problem | Zendy

Keat-Choon Goh | Zendy; Michael G. Safonov | Zendy; George P. Papavassilopoulos | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

Global optimization for the Biaffine Matrix Inequality problem

Author(s) -

Keat-Choon Goh,

Michael G. Safonov,

George P. Papavassilopoulos

Publication year - 1995

Publication title -

journal of global optimization

Language(s) - English

Resource type - Journals

SCImago Journal Rank - 0.861

H-Index - 86

eISSN - 1573-2916

pISSN - 0925-5001

DOI - 10.1007/bf01099648

Subject(s) - mathematics , semidefinite programming , linear matrix inequality , mathematical optimization , optimization problem , eigenvalues and eigenvectors , bilinear interpolation , interior point method , controller (irrigation) , robust optimization , nonlinear programming , control theory (sociology) , nonlinear system , computer science , control (management) , statistics , physics , quantum mechanics , artificial intelligence , agronomy , biology

It has recently been shown that an extremely wide array of robust controller design problems may be reduced to the problem of finding a feasible point under a Biaffine Matrix Inequality (BMI) constraint. The BMI feasibility problem is the bilinear version of the Linear (Affine) Matrix Inequality (LMI) feasibility problem, and may also be viewed as a bilinear extension t

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research