liu.seSearch for publications in DiVA
Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • oxford
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
A Mixed Integer Dual Quadratic Programming Algorithm Tailored for MPC
Linköping University, Department of Electrical Engineering, Automatic Control. Linköping University, The Institute of Technology.ORCID iD: 0000-0001-6957-2603
Linköping University, Department of Electrical Engineering, Automatic Control. Linköping University, The Institute of Technology.
2007 (English)Report (Other academic)
Abstract [en]

The objective of this work is to derive an MIQP solver tailored for MPC. The MIQP solver is built on the branch and bound method, where QP relaxations of the original problem are solved in the nodes of a binary search tree. The difference between the subproblems is often small and therefore it is interesting to be able to use a previous solution as a starting point in a new subproblem. This is referred to as a warm start of the solver. Because of its good warm start properties, a dual active set QP method was chosen. The method is tailored for MPC by solving a part of the KKT system using a Riccati recursion, which makes the computational complexity of the QP iterations grow linearly with the prediction horizon. Simulation results are presented both for the QP solver itself and when it is incorporated as a part of the MIQP solver. In both cases the computational complexity is significantly reduced compared to if a primal active set solver not utilizing structure is used.

Place, publisher, year, edition, pages
Linköping: Linköping University Electronic Press, 2007. , 8 p.
Series
LiTH-ISY-R, ISSN 1400-3902 ; 2761
Keyword [en]
Riccati equations, Computational complexity, Integer programming, Iterative methods, Predictive control, Quadratic programming, Tree searching, KKT system, QP iterations, QP relaxations, Riccati recursion, Binary search tree, Branch and bound method, Computational complexity, Mixed integer dual quadratic programming algorithm, Model predictive control, Prediction horizon
National Category
Control Engineering
Identifiers
URN: urn:nbn:se:liu:diva-56112ISRN: LiTH-ISY-R-2761OAI: oai:DiVA.org:liu-56112DiVA: diva2:316819
Available from: 2010-04-30 Created: 2010-04-30 Last updated: 2016-08-31Bibliographically approved

Open Access in DiVA

fulltext(252 kB)161 downloads
File information
File name FULLTEXT01.pdfFile size 252 kBChecksum SHA-512
eef6009025bcb11c1c4e7a6451e4793f71b821dee2ad59c6c398315d43535859608a0ed3cc0871dccf9a63fd328df674f45dd2ef8764d5af5f153b1b733bde64
Type fulltextMimetype application/pdf

Authority records BETA

Axehill, DanielHansson, Anders

Search in DiVA

By author/editor
Axehill, DanielHansson, Anders
By organisation
Automatic ControlThe Institute of Technology
Control Engineering

Search outside of DiVA

GoogleGoogle Scholar
Total: 161 downloads
The number of downloads is the sum of all downloads of full texts. It may include eg previous versions that are now no longer available

urn-nbn

Altmetric score

urn-nbn
Total: 200 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • oxford
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf