Bidirectional Branch and Bound for Average Loss Minimization

Version (8.34 KB) by Yi Cao
Two algorithms for selection of controlled variables using the average loss as the criterion.
Updated 23 Feb 2010

View License

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.

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.

Cite As

Yi Cao (2024). Bidirectional Branch and Bound for Average Loss Minimization (, MATLAB Central File Exchange. Retrieved .

MATLAB Release Compatibility
Created with R2009b
Compatible with any release
Platform Compatibility
Windows macOS Linux

Community Treasure Hunt

Find the treasures in MATLAB Central and discover how the community can help you!

Start Hunting!
Version Published Release Notes

update reference.

Updated version to avoid divided by zero errors.

Update to deal with negative results which happen numerically.