.png){kind=icon}
返回
An improved algorithm for combinatorial multi-parametric quadratic programming
.png){kind=icon}
OA
AI
DOI：10.1016/j.automatica.2013.02.022.png)
.png){kind=icon}
.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
The goal of multi-parametric quadratic programming (mpQP) is to compute analytic solutions to parameter-dependent constrained optimization problems, e.g., in the context of explicit linear MPC. We propose an improved combinatorial mpQP algorithm that is based on implicit enumeration of all possible optimal active sets and a simple saturation matrix pruning criterion which uses geometric properties of the constraint polyhedron for excluding infeasible candidate active sets. In addition, techniques are presented that allow to reduce the complexity of the discussed algorithm in the presence of symmetric problem constraints. Performance improvements are discussed for two example problems from the area of explicit linear MPC. (c) 2013 Elsevier Ltd. All rights reserved.
Keyword:
Multi-parametric programming
Explicit constrained linear quadratic regulators
Predictive control
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
5.9
论文数:
1.2W
被引数:
6.3W
机构
引用论文
An algorithm for multi-parameffic quadratic programming and explicit MPC solutions.png)
AUTOMATICAOAAI
AUTOMATICAIF5.9
OAAI分享收藏On the facet-to-facet property of solutions to convex parametric quadratic programs关于凸参数二次程序的解的面到面性质AUTOMATICAOAAI
AUTOMATICAIF5.9
OAAI分享收藏 没有更多内容
没有更多内容