Interval mathematics algorithms for tolerance analysis

DOI10.1109/31.1843MaRDI QIDQ3814663zbMATH OpenOpenAlexFDO

Authors Valeri Mladenov, Simeon S. Vladov, Lubomir Kolev

Publication date 1988

Published in IEEE Transactions on Circuits and Systems (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/31.1843

zbMATH Keywords

branch-and-bound algorithmglobal optimizationinterval extensioninterval mathematics algorithmsModified mean-value formstolerance analysis

Mathematics Subject Classification ID

Interval and finite arithmetic (65G30) Numerical mathematical programming methods (65K05) Nonlinear programming (90C30)

Recommendations

• scientific article; zbMATH DE number 3903855
• scientific article; zbMATH DE number 4121310
• What can interval analysis do for global optimization?
• scientific article; zbMATH DE number 12533
• scientific article; zbMATH DE number 3854310

Cited in

(6)

• Qualitative and quantitative simulation: bridging the gap
• scientific article; zbMATH DE number 3903855 (Why is no real title available?)
• scientific article; zbMATH DE number 3982403 (Why is no real title available?)
• scientific article; zbMATH DE number 4121310 (Why is no real title available?)
• Computer technology of interval-set analysis in MATLAB
• Strategies for assigning interval tolerances

This page was built for publication: Interval mathematics algorithms for tolerance analysis

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3814663)