Skip to main navigation Skip to search Skip to main content

QPDAS: Dual Active Set Solver for Mixed Constraint Quadratic Programming

Mattias Fält, Pontus Giselsson

Research output: Chapter in Book/Report/Conference proceedingPaper in conference proceedingpeer-review

Abstract

We present a method for solving the general mixed constrained convex quadratic programming problem using an active set method on the dual problem. The approach is similar to existing active set methods, but we present a new way of solving the linear systems arising in the algorithm. There are two main contributions; we present a new way of factorizing the linear systems, and show how iterative refinement can be used to achieve good accuracy and to solve both types of sub-problems that arise from semi-definite problems.
Original languageEnglish
Title of host publication2019 IEEE Conference on Decision and Control (CDC)
PublisherIEEE - Institute of Electrical and Electronics Engineers Inc.
Pages4891-4897
Number of pages7
ISBN (Electronic)978-1-7281-1398-2
ISBN (Print)978-1-7281-1399-9
DOIs
Publication statusPublished - 2019 Dec 11
Event58th IEEE Conference on Decision and Control, CDC 2019 - Nice, France
Duration: 2019 Dec 112019 Dec 13

Conference

Conference58th IEEE Conference on Decision and Control, CDC 2019
Country/TerritoryFrance
CityNice
Period2019/12/112019/12/13

Subject classification (UKÄ)

  • Control Engineering

Fingerprint

Dive into the research topics of 'QPDAS: Dual Active Set Solver for Mixed Constraint Quadratic Programming'. Together they form a unique fingerprint.

Cite this