A Primal-Dual Interior Point-Linear Programming Algorithm for MPC

Publication: Research - peer-reviewArticle in proceedings – Annual report year: 2009

Documents

DOI

View graph of relations

Constrained optimal control problems for linear systems with linear constraints and an objective function consisting of linear and l1-norm terms can be expressed as linear programs. We develop an efficient primal-dual interior point algorithm for solution of such linear programs. The algorithm is implemented in Matlab and its performance is compared to an active set based LP solver and linprog in Matlab's optimization toolbox. Simulations demonstrate that the new algorithm is more than one magnitude faster than the other LP algorithms applied to this problem.
Original languageEnglish
Title of host publicationProceedings of the 48th IEEE Conference on Decision and Control, 2009 held jointly with the 2009 28th Chinese Control Conference. CDC/CCC 2009
PublisherIEEE
Publication date2009
Pages351-356
ISBN (print)978-1-4244-3871-6
DOIs
StatePublished

Conference

ConferenceThe 48th IEEE Conference on Decision and Control, 2009 held jointly with the 2009 28th Chinese Control Conference. CDC/CCC 2009
Period01/01/09 → …

Bibliographical note

Copyright 2009 IEEE. Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE.

CitationsWeb of Science® Times Cited: 1
Download as:
Download as PDF
Select render style:
APAAuthorCBEHarvardMLAStandardVancouverShortLong
PDF
Download as HTML
Select render style:
APAAuthorCBEHarvardMLAStandardVancouverShortLong
HTML
Download as Word
Select render style:
APAAuthorCBEHarvardMLAStandardVancouverShortLong
Word

Download statistics

No data available

ID: 4588328