mirage

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

DSpace/Manakin Repository

 

Search DR-NTU


Advanced Search Subject Search

Browse

My Account

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 2010-12-21T06:34:50Z
dc.date.available 2010-12-21T06:34:50Z
dc.date.copyright 2010
dc.date.issued 2010-12-21T06:34:50Z
dc.identifier.citation Kariwala, V., & Cao, Y. (2010). Bidirectional branch and bound for controlled variable selection Part III : local average loss minimization. IEEE transactions on industrial informatics, 6(1), 54-61.
dc.identifier.issn 1551-3203
dc.identifier.uri http://hdl.handle.net/10220/6494
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 (B3) 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 B3 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 B3 algorithm. Random matrices and binary distillation column case study are used to demonstrate the computational efficiency of the proposed method.
dc.format.extent 9 p.
dc.language.iso en
dc.relation.ispartofseries IEEE transactions on industrial informatics
dc.rights © 2010 IEEE. Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE. This material is presented to ensure timely dissemination of scholarly and technical work. Copyright and all rights therein are retained by authors or by other copyright holders. All persons copying this information are expected to adhere to the terms and constraints invoked by each author's copyright. In most cases, these works may not be reposted without the explicit permission of the copyright holder. http://www.ieee.org/portal/site This material is presented to ensure timely dissemination of scholarly and technical work. Copyright and all rights therein are retained by authors or by other copyright holders. All persons copying this information are expected to adhere to the terms and constraints invoked by each author's copyright. In most cases, these works may not be reposted without the explicit permission of the copyright holder.
dc.subject DRNTU::Engineering
dc.title Bidirectional branch and bound for controlled variable selection Part III : local average loss minimization
dc.type Journal Article
dc.contributor.school School of Chemical and Biomedical Engineering
dc.identifier.doi http://dx.doi.org/10.1109/TII.2009.2037494
dc.description.version Published version
dc.identifier.rims 149282

Files in this item

Files Size Format View
BB_SOC_P3.pdf 372.4Kb PDF View/Open

This item appears in the following Collection(s)

Show simple item record

Statistics

Total views

All Items Views
Bidirectional branch and bound for controlled variable selection Part III : local average loss minimization 438

Total downloads

All Bitstreams Views
BB_SOC_P3.pdf 192

Top country downloads

Country Code Views
United States of America 69
China 56
Singapore 18
Japan 8
Korea 7

Top city downloads

city Views
Mountain View 53
Beijing 41
Singapore 18
Seoul 7
Munich 2

Downloads / month

  2014-06 2014-07 2014-08 total
BB_SOC_P3.pdf 0 0 9 9