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

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.

Linear programming

active-set method

Topology

minimal-representation

invariant-set

Författare

Emil Klintberg

Zenuity

Qamcom Research & Technology

Magnus Nilsson

Zenuity

Qamcom Research & Technology

Lars Johannesson Mårdh

Zenuity

Ankit Gupta

Chalmers, Elektroteknik, System- och reglerteknik, Mekatronik

Proceedings of the IEEE Conference on Decision and Control

01912216 (ISSN)

Vol. 2018-December 6862-6867

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

Styrkeområden

Transport

Ämneskategorier

Beräkningsmatematik

Signalbehandling

Datavetenskap (datalogi)

DOI

10.1109/CDC.2018.8619642

Mer information

Senast uppdaterat

2019-05-06