Bidirectional branch and bound for controlled variable selection. Part III: local average loss minimization

Show simple item record

dc.contributor.author Kariwala, Vinay -
dc.contributor.author Cao, Yi -
dc.date.accessioned 2011-11-13T23:25:16Z
dc.date.available 2011-11-13T23:25:16Z
dc.date.issued 2010-02-05T00:00:00Z -
dc.identifier.citation Vinay Kariwala and Yi Cao, Bidirectional Branch and Bound for Controlled Variable Selection. Part III: Local Average Loss Minimization. IEEE Transactions On Industrial Informatics, Vol.6(1), 2010, p.54-61
dc.identifier.issn 1551-3203 -
dc.identifier.uri http://dx.doi.org/10.1109/TII.2009.2037494 -
dc.identifier.uri http://dspace.lib.cranfield.ac.uk/handle/1826/5062
dc.description.abstract The selection of controlled variables (CVs) from available measurements through exhaustive search is computationally forbidding for large-scale processes. We have recently proposed novel bidirectional branch and bound (B-3) approaches for CV selection using the minimum singular value (MSV) rule and the local worst- case loss criterion in the framework of self-optimizing control. However, the MSV rule is approximate and worst-case scenario may not occur frequently in practice. Thus, CV selection by minimizing local average loss can be deemed as most reliable. In this work, the B-3 approach is extended to CV selection based on local average loss metric. Lower bounds on local average loss and, fast pruning and branching algorithms are derived for the efficient B-3 algorithm. Random matrices and binary distillation column case study are used to demonstrate the computational efficiency of the proposed method. en_UK
dc.language.iso en_UK -
dc.publisher IEEE en_UK
dc.rights This is the author’s version of a work that was accepted for publication in IEEE Transactions On Industrial Informatics. Changes resulting from the publishing process, such as peer review, editing, corrections, structural formatting, and other quality control mechanisms may not be reflected in this document. Changes may have been made to this work since it was submitted for publication. A definitive version was subsequently published in IEEE Transactions On Industrial Informatics, Vol.6(1), 2010, p.54-61 DOI:10.1109/TII.2009.2037494
dc.subject Branch and bound combinatorial optimization control structure design controlled variables self-optimizing control self-optimizing control algorithm combination en_UK
dc.title Bidirectional branch and bound for controlled variable selection. Part III: local average loss minimization en_UK
dc.type Article -


Files in this item

This item appears in the following Collection(s)

Show simple item record

Search CERES


Browse

My Account

Statistics