摘要： 就无约束和有约束算法中求解的方式进行了讨论,由此引申出求解效率的问题。为使有效地运行于大规模控制问题DMCQPQPDMC之上,提出了问题的降维算法。数值仿真表明,在大规模数值求解中,这种降维算法能在保证求解精度的情况下有效提高求解速度。QPQP

关键词: 动态矩阵控制, 复杂度, QP

Abstract: Being an important part of dynamic matrix control (DMC), QP optimization is by far the most time-consuming computational module in whole DMC application, especially when DMC application is running in control task with very large-scale variables. Based on dimension-reduction technique, this paper presents an efficient algorithm to resolve QP optimization. Numeric examinations show its good performance in improving on-line efficiency to resolve QP problem in DMC.

中图分类号: 

• TP273.5