Bidirectional Branch and Bound for Average Loss Minimization
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
Zitieren als
Yi Cao (2024). Bidirectional Branch and Bound for Average Loss Minimization (https://www.mathworks.com/matlabcentral/fileexchange/25870-bidirectional-branch-and-bound-for-average-loss-minimization), MATLAB Central File Exchange. Abgerufen .
Kompatibilität der MATLAB-Version
Plattform-Kompatibilität
Windows macOS LinuxKategorien
Tags
Quellenangaben
Inspiriert von: Bidirectional Branch and Bound Minimum Singular Value Solver (V2), Bidirectional Branch and Bound Solvers for Worst Case Loss Minimization
Inspiriert: TEP Retrofit gSOC Case Study
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!Live Editor erkunden
Erstellen Sie Skripte mit Code, Ausgabe und formatiertem Text in einem einzigen ausführbaren Dokument.
Version | Veröffentlicht | Versionshinweise | |
---|---|---|---|
1.4.0.0 | update reference. |
||
1.3.0.0 | Updated version to avoid divided by zero errors. |
||
1.1.0.0 | Update to deal with negative results which happen numerically. |
||
1.0.0.0 |