A primal active-set minimal-representation algorithm for polytopes with application to invariant-set calculations
Paper in proceeding, 2018

This paper provides a description of a practically efficient minimal-representation algorithm for polytopes. The algorithm is based on a primal active-set method that heavily exploits warm-starts and low-rank updates of matrix factorizations in order to reduce the required computational work. By using a primal active-set method, several nonredundant inequalities can be identified for each solved linear program. Implementation details are provided both for the minimalrepresentation algorithm and for the underlying active-set method.

Topology

invariant-set

Linear programming

minimal-representation

active-set method

Author

Emil Klintberg

Qamcom Research & Technology

Zenuity AB

Magnus Nilsson

Qamcom Research & Technology

Zenuity AB

Lars Johannesson Mårdh

Zenuity AB

Ankit Gupta

Chalmers, Electrical Engineering, Systems and control

Proceedings of the IEEE Conference on Decision and Control

07431546 (ISSN) 25762370 (eISSN)

Vol. 2018-December 6862-6867
978-153861395-5 (ISBN)

57th IEEE Conference on Decision and Control
Miami, USA,

Areas of Advance

Transport

Subject Categories

Computational Mathematics

Signal Processing

Computer Science

DOI

10.1109/CDC.2018.8619642

More information

Latest update

1/3/2024 9