Bidirectional Branch and Bound for Average Loss Minimization
Two algorithms for selection of controlled variables using the average loss as the criterion.
Ahora está siguiendo esta publicación
- Verá actualizaciones en las notificaciones de contenido en seguimiento.
- Podrá recibir correos electrónicos, en función de las preferencias de comunicación que haya establecido.
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
Citar como
Yi Cao (2026). Bidirectional Branch and Bound for Average Loss Minimization (https://es.mathworks.com/matlabcentral/fileexchange/25870-bidirectional-branch-and-bound-for-average-loss-minimization), MATLAB Central File Exchange. Recuperado .
Agradecimientos
Inspirado por: Bidirectional Branch and Bound Minimum Singular Value Solver (V2), Bidirectional Branch and Bound Solvers for Worst Case Loss Minimization
Inspiración para: TEP Retrofit gSOC Case Study
Información general
- Versión 1.4.0.0 (8,34 KB)
Compatibilidad con la versión de MATLAB
- Compatible con cualquier versión
Compatibilidad con las plataformas
- Windows
- macOS
- Linux
