Nonconvex spectral algorithm for solving BMI on the reduced order H<inf>∞</inf> control

Shi, Y; Tuan, HD; Su, S

Nonconvex spectral algorithm for solving BMI on the reduced order H<inf>∞</inf> control

Shi, Y

Tuan, HD

Su, S

Permalink

Publication Type:: Conference Proceeding
Citation:: Proceedings - 6th IEEE International Conference on Control System, Computing and Engineering, ICCSCE 2016, 2017, pp. 316 - 319
Issue Date:: 2017-04-05

Open Access

Copyright Clearance Process

Recently Added
In Progress
Open Access

This item is open access.

Adobe PDF

Download Accepted ManuscriptAdobe PDF (265.5 kB)

View on publisher's site

View statistics

Full metadata record

Field	Value	Language
dc.contributor.author	Shi, Y https://orcid.org/0000-0003-2302-4980	en_US
dc.contributor.author	Tuan, HD https://orcid.org/0000-0003-0292-6061	en_US
dc.contributor.author	Su, S https://orcid.org/0000-0002-5720-8852	en_US
dc.date.issued	2017-04-05	en_US
dc.identifier.citation	Proceedings - 6th IEEE International Conference on Control System, Computing and Engineering, ICCSCE 2016, 2017, pp. 316 - 319	en_US
dc.identifier.isbn	9781509011780	en_US
dc.identifier.uri	http://hdl.handle.net/10453/115844
dc.description.abstract	© 2016 IEEE. The design of reduced-order H∞ control can be transformed into an optimization problem with bilinear matrix inequality (BMI) constraints, which is an NP-hard problem. We propose a method to equivalently transfer the BMI constraint into a convex LMI constraint plus a matrix-rank constraint. The optimization with matrix-rank constraint is iteratively solved by a sequence of semidefinite programming (SDP) problems. Simulations on several benchmark systems show that our algorithm is practical and efficient.	en_US
dc.relation	http://purl.org/au-research/grants/arc/DP130104617
dc.relation.ispartof	Proceedings - 6th IEEE International Conference on Control System, Computing and Engineering, ICCSCE 2016	en_US
dc.relation.isbasedon	10.1109/ICCSCE.2016.7893591	en_US
dc.title	Nonconvex spectral algorithm for solving BMI on the reduced order H<inf>∞</inf> control	en_US
dc.type	Conference Proceeding
utslib.for	0906 Electrical and Electronic Engineering	en_US
pubs.embargo.period	Not known	en_US
pubs.organisational-group	/University of Technology Sydney
pubs.organisational-group	/University of Technology Sydney/Faculty of Engineering and Information Technology
pubs.organisational-group	/University of Technology Sydney/Faculty of Engineering and Information Technology/School of Biomedical Engineering
pubs.organisational-group	/University of Technology Sydney/Faculty of Engineering and Information Technology/School of Computer Science
pubs.organisational-group	/University of Technology Sydney/Faculty of Engineering and Information Technology/School of Electrical and Data Engineering
pubs.organisational-group	/University of Technology Sydney/Strength - CHT - Health Technologies
utslib.copyright.status	open_access
pubs.publication-status	Published	en_US

Abstract:

© 2016 IEEE. The design of reduced-order H∞ control can be transformed into an optimization problem with bilinear matrix inequality (BMI) constraints, which is an NP-hard problem. We propose a method to equivalently transfer the BMI constraint into a convex LMI constraint plus a matrix-rank constraint. The optimization with matrix-rank constraint is iteratively solved by a sequence of semidefinite programming (SDP) problems. Simulations on several benchmark systems show that our algorithm is practical and efficient.

Please use this identifier to cite or link to this item:

http://hdl.handle.net/10453/115844