Bidirectional Branch and Bound for Average Loss Minimization
Two algorithms for selection of controlled variables using the average loss as the criterion.
現在この提出コンテンツをフォロー中です。
- フォローしているコンテンツ フィードに更新が表示されます。
- コミュニケーション基本設定に応じて電子メールを受け取ることができます
This is the third part of the work to select measurements / measurement combination for selfoptimizing control. It uses aberage loss as the criterion instead of the worst case loss presented in the second part.
Bidirection branch and bound (B3) is a very efficient BAB algorithm. In the first two parts, we developed b3msv and b3wc algorithms for minimum singular value and worst case loss.
Reference:
V. Kariwala and Y. Cao, Bidirectional Branch and Bound for Controlled Variable Selection: Part III. Local Average Loss Minimization, IEEE Transactions on Industrial Informatics, Vol. 6, No. 1, pp. 54—61, 2010.
http://ieeexplore.ieee.org/xpls/abs_all.jsp?arnumber=5378454
引用
Yi Cao (2026). Bidirectional Branch and Bound for Average Loss Minimization (https://jp.mathworks.com/matlabcentral/fileexchange/25870-bidirectional-branch-and-bound-for-average-loss-minimization), MATLAB Central File Exchange. に取得済み.
