作者: S. Balemi , V. Balakrishnan
DOI: 10.1007/978-1-4615-2968-2_12
关键词: Branch and price 、 Global optimization 、 Branch and cut 、 Mathematical optimization 、 Control theory 、 Branch and bound 、 Optimization problem 、 Mathematics 、 Linear system 、 Computation
摘要: The computation of several quantities interest in the analysis and design parameter-dependent linear systems can be posed as a nonconvex optimization problem. We present branch bound algorithm that solves such problems. is worst-case combinatoric, but often performs well.