Bidirectional branch and bound for controlled variable selection Part II : exact local method for self-optimizing control

The selection of controlled variables (CVs) from available measurements through enumeration of all possible alternatives is computationally forbidding for large-dimensional problems. In Part I of this work, we proposed a bidirectional branch and bound (BAB) approach for subset selection problems and...

Full description

Saved in:
Bibliographic Details
Main Authors: Kariwala, Vinay, Cao, Yi
Other Authors: School of Chemical and Biomedical Engineering
Format: Article
Language:English
Published: 2009
Subjects:
Online Access:https://hdl.handle.net/10356/90903
http://hdl.handle.net/10220/4628
Tags: Add Tag
No Tags, Be the first to tag this record!
Institution: Nanyang Technological University
Language: English
id sg-ntu-dr.10356-90903
record_format dspace
spelling sg-ntu-dr.10356-909032023-12-29T06:47:41Z Bidirectional branch and bound for controlled variable selection Part II : exact local method for self-optimizing control Kariwala, Vinay Cao, Yi School of Chemical and Biomedical Engineering DRNTU::Engineering::Chemical engineering DRNTU::Engineering::Electrical and electronic engineering::Control and instrumentation::Control engineering DRNTU::Science::Mathematics::Applied mathematics::Optimization The selection of controlled variables (CVs) from available measurements through enumeration of all possible alternatives is computationally forbidding for large-dimensional problems. In Part I of this work, we proposed a bidirectional branch and bound (BAB) approach for subset selection problems and demonstrated its efficiency using the minimum singular value criterion. In this paper, the BAB approach is extended for CV selection using the exact local method for self-optimizing control. By redefining the loss expression, we show that the CV selection criterion for exact local method is bidirectionally monotonic. A number of novel determinant based criteria are proposed for fast pruning and branching purposes resulting in a computationally inexpensive BAB approach. We also establish a link between the problems of selecting a subset and combinations of measurements as CVs and present a partially bidirectional BAB method for selection of measurements, whose combinations can be used as CVs. Numerical tests using randomly generated matrices and binary distillation column case study demonstrate the computational efficiency of the proposed methods. Accepted version 2009-06-19T06:35:43Z 2019-12-06T17:56:09Z 2009-06-19T06:35:43Z 2019-12-06T17:56:09Z 2009 2009 Journal Article Kariwala, V., & Cao, Y. (2009). Bidirectional branch and bound for controlled variable selection : Part II - Exact local method for self-optimizing control. Computers and Chemical Engineering, 33(8), 1402-1412. 0098-1354 https://hdl.handle.net/10356/90903 http://hdl.handle.net/10220/4628 10.1016/j.compchemeng.2009.01.014 en Computers and chemical engineering Computers and Chemical Engineering. Copyright © 2009 Elsevier Ltd All rights reserved. 30 p. application/pdf
institution Nanyang Technological University
building NTU Library
continent Asia
country Singapore
Singapore
content_provider NTU Library
collection DR-NTU
language English
topic DRNTU::Engineering::Chemical engineering
DRNTU::Engineering::Electrical and electronic engineering::Control and instrumentation::Control engineering
DRNTU::Science::Mathematics::Applied mathematics::Optimization
spellingShingle DRNTU::Engineering::Chemical engineering
DRNTU::Engineering::Electrical and electronic engineering::Control and instrumentation::Control engineering
DRNTU::Science::Mathematics::Applied mathematics::Optimization
Kariwala, Vinay
Cao, Yi
Bidirectional branch and bound for controlled variable selection Part II : exact local method for self-optimizing control
description The selection of controlled variables (CVs) from available measurements through enumeration of all possible alternatives is computationally forbidding for large-dimensional problems. In Part I of this work, we proposed a bidirectional branch and bound (BAB) approach for subset selection problems and demonstrated its efficiency using the minimum singular value criterion. In this paper, the BAB approach is extended for CV selection using the exact local method for self-optimizing control. By redefining the loss expression, we show that the CV selection criterion for exact local method is bidirectionally monotonic. A number of novel determinant based criteria are proposed for fast pruning and branching purposes resulting in a computationally inexpensive BAB approach. We also establish a link between the problems of selecting a subset and combinations of measurements as CVs and present a partially bidirectional BAB method for selection of measurements, whose combinations can be used as CVs. Numerical tests using randomly generated matrices and binary distillation column case study demonstrate the computational efficiency of the proposed methods.
author2 School of Chemical and Biomedical Engineering
author_facet School of Chemical and Biomedical Engineering
Kariwala, Vinay
Cao, Yi
format Article
author Kariwala, Vinay
Cao, Yi
author_sort Kariwala, Vinay
title Bidirectional branch and bound for controlled variable selection Part II : exact local method for self-optimizing control
title_short Bidirectional branch and bound for controlled variable selection Part II : exact local method for self-optimizing control
title_full Bidirectional branch and bound for controlled variable selection Part II : exact local method for self-optimizing control
title_fullStr Bidirectional branch and bound for controlled variable selection Part II : exact local method for self-optimizing control
title_full_unstemmed Bidirectional branch and bound for controlled variable selection Part II : exact local method for self-optimizing control
title_sort bidirectional branch and bound for controlled variable selection part ii : exact local method for self-optimizing control
publishDate 2009
url https://hdl.handle.net/10356/90903
http://hdl.handle.net/10220/4628
_version_ 1787136545657978880