Paperlane

no. 16 · Tuesday 17 November 2026

Feasibility certificates for DeePC: A set invariance approach

Daniel O'Neill, Ross Drummond and Pablo R. Baldivieso-Monasterios

math.OC

Abstract

DeePC is posed on a window of past inputs and outputs, so its feasible set is a set of histories and is not available in closed form. We write the DeePC solution as an implicit ReLU network whose weights are built from Hankel matrices and whose activation patterns are the critical regions of the underlying quadratic program. This gives, directly from the Hankel matrices, the feasible set of DeePC as a polyhedral projection, its explicit piecewise-affine control law, and an exact linear model of the history window. We compute three invariant sets of histories: the maximal positively invariant set of the unsaturated linear branch, the region of recursive feasibility of DeePC without terminal ingredients, and the maximal control invariant set of admissible histories. We show these sets are nested and provide numerical examples.

fields
Optimization and Control
pdf ↗ page arXiv:2611.20220 ↗