betaFeedback

WorksMathematics

Worst-Case Finite-Horizon Analysis of Perturbed LQR via Performance Estimation Problem

Abstract

We propose a framework to assess the robustness of a given state-feedback controller by evaluating its worst-case finite-horizon cost over a class of norm-bounded perturbations. To compute this cost, we show how to apply the Performance Estimation Problem (PEP) framework, originally developed to analyze optimization algorithms, and reformulate the worst-case search as a rank-constrained Semidefinite Program (SDP). Our results suggest that the perturbations that induce the highest finite-horizon costs can differ substantially from those identified using standard asymptotic metrics. Intuitively, worst-case perturbations are obtained by aligning slowly decaying modes with specific initial conditions to drive transient growth, causing a bifurcation in the worst-case behavior as the horizon length changes. These findings open new possibilities to certify finite-horizon performance of broader system classes, including data-driven models or nonlinear components.

Introduction

Many control applications must guarantee performance over a finite time window, such as a maneuver, a batch process, or a mission of fixed duration. Over such horizons, the relevant measure is the accumulated transient cost rather than asymptotic stability. Feedback laws, such as a Linear Quadratic Regulator (LQR), are typically designed on a nominal model, whereas the physical system is subject to parametric uncertainties. Such parameter variations, which create a mismatch between the design model and the true physical system, can arise, for example, from changing operating conditions or unmodeled nonlinearities like a varying resistance in an electronic circuit.

To handle these parametric uncertainties, it is natural to turn to robust control to provide guarantees on the desired behaviors [1, 2, 3]. Robust control approaches include, for example, μ\mu-analysis [4] (which evaluates worst-case stability and performance against structured uncertainties), robust Lyapunov functions and Integral Quadratic Constraints (IQC) [5] (a framework that bounds the input-output behavior of complex uncertainties and nonlinearities using quadratic inequalities).

The authors are with the ICTEAM Institute, UCLouvain, Belgium. G. Bianchin is also an Investigator of the WEL Research Institute, Belgium. This research is supported in part by the “SID-DARTA” Concerted Research Action (ARC) granted by UCLouvain and in part by the “InterpoControl” F.R.S.-FNRS research project (PDR). Generative AI tools (Gemini 3.1, Claude Opus 5.5) were used to improve the code used in the numerical investigations. Corresponding author: [email protected] pliers, which quantifies the conservatism introduced by the LTV relaxation, and we relate the relaxed SDP to IQC bounds with richer multipliers through Lagrangian duality.

Notation. We denote by R\mathbb{R} the set of real numbers. Vectors of dimension nn will be denoted as x∈Rnx \in\mathbb{R}^{n} in lowercase and a matrix A∈Rn×mA \in\mathbb{R}^{n \times m} in uppercase letters. The concatenation of a sequence of vectors {xk}k=0N−1\{x_k\}_{k=0}^{N-1} is denoted by x=[x0,…,xN−1]∈Rn×N\mathbf{x} = [x_0,\ldots,x_{N-1}] \in\mathbb{R}^{n \times N}. For two matrices A,B∈Rn×nA,B \in\mathbb{R}^{n \times n}, we denote by A⪰BA \succeq B the Loewner partial order, i.e., A−BA-B is positive semidefinite.

Problem Formulation

Consider a discrete-time linear system xk+1=Axk+Bukx_{k+1}=Ax_k+Bu_k with state trajectory {xk}k=0N⊂Rn\{x_k\}_{k=0}^{N} \subset\mathbb{R}^{n}, control sequence {uk}k=0N−1⊂Rm\{u_k\}_{k=0}^{N-1} \subset\mathbb{R}^{m}, for the nominal matrices A∈Rn×nA \in\mathbb{R}^{n \times n} and B∈Rn×mB \in\mathbb{R}^{n \times m}. Let uk=Kxku_k=Kx_k be a nominal state-feedback control law, with KK any fixed gain (in our examples, the infinite-horizon LQR gain).

As discussed in Section I, in many control applications, real-world systems are characterized by system matrices that differ from the nominal matrices used to design the controller. We therefore evaluate the performance of the fixed controller KK under unknown but bounded LTI perturbations on the system matrices:

xk+1=(A+ΔA)xk+(B+ΔB)uk(1)x_{k+1}=(A+\Delta_A)x_k+(B+\Delta_B)u_k \tag*{(1)}

where ΔA∈Rn×n\Delta_A \in\mathbb{R}^{n \times n} and ΔB∈Rn×m\Delta_B \in\mathbb{R}^{n \times m} are static perturbations bounded in spectral norm by εA,εB≥0\varepsilon_A,\varepsilon_B \ge0:

ΔA∈DA:={M∈Rn×n∣∥M∥2≤εA},\Delta_A \in\mathcal{D}_A := \{M \in\mathbb{R}^{n \times n} \mid\lVert M \rVert_2 \le\varepsilon_A\},
ΔB∈DB:={M∈Rn×m∣∥M∥2≤εB}.\Delta_B \in\mathcal{D}_B := \{M \in\mathbb{R}^{n \times m} \mid\lVert M \rVert_2 \le\varepsilon_B\}.

Under the nominal control law uk=Kxku_k=Kx_k, the closed-loop perturbed dynamics becomes:

xk+1=(Φ+ΔA+ΔBK)xk,(2)x_{k+1}=(\Phi+\Delta_A+\Delta_BK)x_k, \tag*{(2)}

where Φ=A+BK\Phi=A+BK is the nominal closed-loop state matrix.

To quantify the transient performance degradation caused by these uncertainties, we consider a finite-horizon evaluation cost over NN steps, with stage cost penalties Q⪰0Q \succeq0, R≻0R \succ0, and terminal penalty S⪰0S \succeq0:

JN(x0,Δ)=∑k=0N−1(xkTQxk+ukTRuk)+xNTSxN,J_N(x_0,\Delta)=\sum_{k=0}^{N-1}(x_k^{\mathsf T}Qx_k+u_k^{\mathsf T}Ru_k)+x_N^{\mathsf T}Sx_N,

where the state trajectory depends on the perturbations Δ=(ΔA,ΔB)\Delta=(\Delta_A,\Delta_B) through the closed-loop dynamics defined in (2). Substituting uk=Kxku_k=Kx_k, this cost simplifies to a quadratic function of the state trajectory:

JN(x0,Δ)=∑k=0N−1xkTQKxk+xNTSxN,(3)J_N(x_0,\Delta)=\sum_{k=0}^{N-1}x_k^{\mathsf T}Q_Kx_k+x_N^{\mathsf T}Sx_N, \tag*{(3)}

where QK=Q+KTRK⪰0Q_K=Q+K^{\mathsf T}RK \succeq0 is the equivalent closed-loop stage cost matrix, and the state sequence {xk}k=0N\{x_k\}_{k=0}^{N} is generated by the perturbed dynamics (2).

Our objective is to quantify the largest finite-horizon cost of the fixed controller KK and identify the initial states and admissible LTI perturbations that produce it. We are therefore interested in determining solutions to the following optimization problem1:

JN∗(εA,εB,QK,S):=max⁡{xk}k=0N,ΔA,ΔBJN(x0,Δ)s.t.∥x0∥22≤1xk+1=(Φ+ΔA+ΔBK)xk,∀k∈KΔA∈DA,ΔB∈DB(4)\begin{aligned} J_N^*(\varepsilon_A,\varepsilon_B,Q_K,S)&:=\max_{\{x_k\}_{k=0}^{N},\Delta_A,\Delta_B} J_N(x_0,\Delta)\\ \text{s.t.}\quad&\lVert x_0\rVert_2^2\le1\\ &x_{k+1}=(\Phi+\Delta_A+\Delta_BK)x_k,\quad\forall k\in\mathcal{K}\\ &\Delta_A\in\mathcal{D}_A,\quad\Delta_B\in\mathcal{D}_B \tag*{(4)} \end{aligned}

where K={0,…,N−1}\mathcal{K}=\{0,\ldots,N-1\}. One may expect the worst case to be produced by the perturbation that moves the closed-loop poles the most. The following example shows that this is not always the case.

Example 1: (Pole locations do not capture transient performance) In this example, we illustrate that worst-case perturbations can increase the finite-horizon cost (4) without moving the closed-loop poles of the system with state feedback KK taken as the optimal gain of infinite horizon LQR problem, i.e., K=−(R+BTPB)−1BTPAK=-(R+B^{\mathsf T}PB)^{-1}B^{\mathsf T}PA, where P≻0P \succ0 solves the discrete algebraic Riccati equation P=ATPA−ATPB(R+BTPB)−1BTPA+QP=A^{\mathsf T}PA-A^{\mathsf T}PB(R+B^{\mathsf T}PB)^{-1}B^{\mathsf T}PA+Q. Consider the following system:

A=[01.2500.25],B=[0.50.5],Q=diag⁡(1,0.75),R=1.A=\begin{bmatrix}0&1.25\\0&0.25\end{bmatrix},\quad B=\begin{bmatrix}0.5\\0.5\end{bmatrix},\quad Q=\operatorname{diag}(1,0.75),\quad R=1.

Moreover, we let N=2N=2, S=0S=0, εA=0.375\varepsilon_A=0.375 and εB=0.25\varepsilon_B=0.25. The Riccati solution is P=diag⁡(1,2)P=\operatorname{diag}(1,2), so that K=[0 −0.5]K=[0\ -0.5], Φ=[0000]\Phi=\begin{bmatrix}0&0\\0&0\end{bmatrix} and QK=IdQ_K=I_d.

Since N=2N=2 and S=0S=0, only x0x_0 and x1x_1 are penalized, so the worst case maximizes the one-step amplification of the perturbed closed loop. Writing ΦΔ=Φ+ΔA+ΔBK\Phi_\Delta=\Phi+\Delta_A+\Delta_BK, the cost reduces to J2(x0,Δ)=∥x0∥22+∥ΦΔx0∥22J_2(x_0,\Delta)=\lVert x_0\rVert_2^2+\lVert\Phi_\Delta x_0\rVert_2^2, hence J2∗=1+max⁡Δ∥ΦΔ∥22J_2^*=1+\max_\Delta\lVert\Phi_\Delta\rVert_2^2. The triangle inequality gives ∥ΦΔ∥2≤∥Φ∥2+εA+εB∥K∥2=1.5\lVert\Phi_\Delta\rVert_2\le\lVert\Phi\rVert_2+\varepsilon_A+\varepsilon_B\lVert K\rVert_2=1.5, and this bound is attained by the following admissible perturbations

ΔA∗=[00.37500],ΔB∗=[−0.250],ΦΔ∗=[01.500].\Delta_A^*=\begin{bmatrix}0&0.375\\0&0\end{bmatrix},\quad\Delta_B^*=\begin{bmatrix}-0.25\\0\end{bmatrix},\quad\Phi_{\Delta^*}=\begin{bmatrix}0&1.5\\0&0\end{bmatrix}.

From x0=[0 1]Tx_0=[0\ 1]^{\mathsf T}, this gives J2∗=1+2.25=3.25J_2^*=1+2.25=3.25, against 2 for the nominal loop: the perturbation increases the cost by more than 60%.

Yet Φ\Phi and ΦΔ∗\Phi_{\Delta^*} have the same eigenvalues {0,0}\{0,0\}: the worst-case perturbation leaves the poles in place and strengthens the coupling from the second state to the first. An analysis based on eigenvalue location, such as μ\mu-analysis or pseudospectra [4], sees no degradation here. In our computations, the perturbations that maximize the spectral radius (ρ≈0.79\rho\approx0.79) yield at most J2≈3.05J_2\approx3.05. □\square

The Performance Estimation Problem (PEP) Reformulation

Our main result, Theorem 1, uses the PEP framework to recast the exact worst-case optimization problem (4) into a rank-constrained SDP. To derive this formulation, we first abstract the problem over discrete sequences, enforce the LTI behavior of the perturbations through operator interpolation, and lift the sequence variables into a positive semidefinite Gram matrix.

The Abstract Optimization Problem

The products ΔAxk\Delta_A x_k and ΔBKxk\Delta_B K x_k in (2) make the constraints bilinear in the decision variables, and therefore nonconvex. To overcome this complexity, we treat the perturbation outputs as independent sequence variables. Over the horizon NN, we define:

x=[x0,…,xN−1]∈Rn×N,x = [x_0,\ldots,x_{N-1}] \in\mathbb{R}^{n \times N},
vA=[vA,0,…,vA,N−1]∈Rn×N,v_A = [v_{A,0},\ldots,v_{A,N-1}] \in\mathbb{R}^{n \times N},
vB=[vB,0,…,vB,N−1]∈Rn×N,v_B = [v_{B,0},\ldots,v_{B,N-1}] \in\mathbb{R}^{n \times N},

where at each time step k∈Kk \in\mathcal{K}, the pointwise perturbations are given by:

vA,k=ΔAxk,vB,k=ΔBKxk.v_{A,k} = \Delta_A x_k,\qquad v_{B,k} = \Delta_B K x_k.

By substituting these vectors into the system dynamics, the state update becomes a linear equation independent of the explicit matrices ΔA\Delta_A and ΔB\Delta_B:

xk+1=Φxk+vA,k+vB,k.(5)x_{k+1} = \Phi x_k + v_{A,k} + v_{B,k}. \tag*{(5)}

Instead of optimizing over the matrices ΔA,ΔB\Delta_A, \Delta_B, our decision variables are now the sequences of vectors: the states {xk}k=0N\{x_k\}_{k=0}^{N} and the perturbations {vA,k}k=0N−1\{v_{A,k}\}_{k=0}^{N-1} and {vB,k}k=0N−1\{v_{B,k}\}_{k=0}^{N-1}. With this change, the optimization problem (4) can thus be rewritten as:

JN∗(εA,εB,QK,S)=max⁡x,vA,vBJN(x0,vA,vB)s.t.∥x0∥22≤1xk+1=Φxk+vA,k+vB,k,∀k∈K∃ΔA∈DA s.t.vA,k=ΔAxk,∀k∈K∃ΔB∈DB s.t.vB,k=ΔBKxk,∀k∈K.(6)\begin{aligned} J_N^*(\varepsilon_A,\varepsilon_B,Q_K,S) &= \max_{x,v_A,v_B} && J_N(x_0,v_A,v_B)\\ \text{s.t.} && \|x_0\|_2^2 &\le1\\ && x_{k+1} &= \Phi x_k+v_{A,k}+v_{B,k}, && \forall k\in\mathcal{K}\\ && \exists\Delta_A\in\mathcal{D}_A\ \text{s.t.}\quad v_{A,k} &= \Delta_A x_k, && \forall k\in\mathcal{K}\\ && \exists\Delta_B\in\mathcal{D}_B\ \text{s.t.}\quad v_{B,k} &= \Delta_B Kx_k, && \forall k\in\mathcal{K}. \tag*{(6)} \end{aligned}

By shifting to this sequence-based formulation, the objective and the dynamics are now quadratic and linear, respectively.

Operator Interpolation: Enforcing LTI Behavior

The last two constraints in (6) are abstract, in the sense that they cannot be directly encoded in a solver. In this section, we use tools from the PEP framework to translate these constraints into algebraic inequalities.

Let L[0,L]\mathcal{L}_{[0,L]} denote the set of matrices M∈Rd2×d1M\in\mathbb{R}^{d_2\times d_1} with an induced 2-norm bounded by L≥0L\ge0. We use operator interpolation to enforce LTI behavior on the perturbation variables. Let p=[p0,…,pN−1]∈Rd1×Np=[p_0,\ldots,p_{N-1}]\in\mathbb{R}^{d_1\times N} and q=[q0,…,qN−1]∈Rd2×Nq=[q_0,\ldots,q_{N-1}]\in\mathbb{R}^{d_2\times N} be matrices containing vector sequences. We say the sequences are L[0,L]\mathcal{L}_{[0,L]}-interpolable if there exists M∈L[0,L]M\in\mathcal{L}_{[0,L]} such that qk=Mpkq_k=Mp_k for all kk. For L[0,L]\mathcal{L}_{[0,L]} the interpolation conditions are given by algebraic conditions over the data matrices from [13].

Lemma 1 (L[0,L]\mathcal{L}_{[0,L]}-Interpolation Condition [13]). Let p∈Rd1×Np\in\mathbb{R}^{d_1\times N} and q∈Rd2×Nq\in\mathbb{R}^{d_2\times N} be data matrices. The sequences are L[0,L]\mathcal{L}_{[0,L]}-interpolable if and only if the following LMI holds:

L2pTp−qTq⪰0.L^2p^\mathsf{T}p-q^\mathsf{T}q\succeq0.

Lemma 1 allows us to map the operator existence condition in (6) to quadratic constraints on the data matrix. This allows us to transform the optimization problem into a QCQP, as shown next.

Proposition 1 (QCQP formulation). The worst-case finite-horizon performance JN∗J_N^* defined in (6) equals the optimal value of the following QCQP over the finite vector sequences xx, vAv_A, and vBv_B:

JN∗(εA,εB,QK,S)=max⁡x,vA,vBJN(x0,vA,vB)s.t.∥x0∥22≤1xk+1=Φxk+vA,k+vB,k,∀k∈KεA2xTx−vATvA⪰0εB2xTKTKx−vBTvB⪰0.(7)\begin{aligned} J_N^*(\varepsilon_A,\varepsilon_B,Q_K,S)&=\max_{x,v_A,v_B}&&J_N(x_0,v_A,v_B)\\ \text{s.t.}&&\|x_0\|_2^2&\le1\\ &&x_{k+1}&=\Phi x_k+v_{A,k}+v_{B,k}, &&\forall k\in\mathcal{K}\\ &&\varepsilon_A^2x^\mathsf{T}x-v_A^\mathsf{T}v_A&\succeq0\\ &&\varepsilon_B^2x^\mathsf{T}K^\mathsf{T}Kx-v_B^\mathsf{T}v_B&\succeq0. \tag*{(7)} \end{aligned}

Proof. Using Lemma 1, we map the existence constraints ∃ΔA∈DA\exists\Delta_A\in\mathcal{D}_A in the optimization problem (6) to the LMI εA2xTx−vATvA⪰0\varepsilon_A^2x^\mathsf{T}x-v_A^\mathsf{T}v_A\succeq0. Similarly, ∃ΔB∈DB\exists\Delta_B\in\mathcal{D}_B is replaced by εB2xTKTKx−vBTvB⪰0\varepsilon_B^2x^\mathsf{T}K^\mathsf{T}Kx-v_B^\mathsf{T}v_B\succeq0, yielding (7). ■

Proposition 1 provides an equivalent formulation of (6) and thus of (4). Notice that, in (7), the perturbation matrices no longer appear explicitly.

The Gram Matrix SDP Formulation

Unfortunately, the QCQP in (7) remains a non-convex optimization problem due to the quadratic matrix inequalities. To bypass this complexity, in this section, we use a Gram lifting approach [14]. Because the objective function and constraints in (7) depend solely on quadratic inner products of the sequence variables, we can linearize them by shifting our decision variables to a positive semidefinite Gram matrix.

We concatenate the initial state and the independent perturbation sequences into a single lifted vector zz:

z=[x0T    vA,0T⋯vA,N−1T    vB,0T⋯vB,N−1T]T.z=\left[x_0^\mathsf{T}\;\;v_{A,0}^\mathsf{T}\cdots v_{A,N-1}^\mathsf{T}\;\;v_{B,0}^\mathsf{T}\cdots v_{B,N-1}^\mathsf{T}\right]^\mathsf{T}.

We also define block-selector matrices E0,EA,k,EB,k∈Rn×(1+2N)E_0,E_{A,k},E_{B,k}\in\mathbb{R}^{n\times(1+2N)} to extract the corresponding blocks from zz:

x0=E0z,vA,k=EA,kz,vB,k=EB,kz.x_0=E_0z,\qquad v_{A,k}=E_{A,k}z,\qquad v_{B,k}=E_{B,k}z.

Because the linear dynamics determines the state trajectory, every state xkx_k is a linear combination of the components of zz. Using the dynamics from Proposition 1, we define the state extraction matrices Hx,kH_{x,k} recursively:

Hx,0=E0,Hx,k+1=ΦHx,k+EA,k+EB,k,∀k∈K.(8)H_{x,0}=E_0,\qquad H_{x,k+1}=\Phi H_{x,k}+E_{A,k}+E_{B,k},\qquad\forall k\in\mathcal{K}. \tag*{(8)}

Thus, xk=Hx,kzx_k = H_{x,k}z for all k∈Kk \in\mathcal{K}. Any scalar inner product in the system can be expressed as a linear trace operation on the (1+2N)n×(1+2N)n(1 + 2N)n \times(1 + 2N)n positive semidefinite Gram matrix Z=zz⊤Z = zz^\top, which has rank at most 1. Indeed, for any symmetric M∈Rn×nM \in\mathbb{R}^{n \times n}, one has:

xi⊤Mxj=z⊤Hx,i⊤MHx,jz=Tr⁡(Hx,j⊤MHx,iZ).x_i^\top Mx_j = z^\top H_{x,i}^\top M H_{x,j}z = \operatorname{Tr}\left(H_{x,j}^\top M H_{x,i}Z\right).

By the trace property, the (i,j)(i,j)-th entry of this matrix is Tr⁡(Hx,j⊤Hx,iZ)\operatorname{Tr}(H_{x,j}^\top H_{x,i}Z). Similarly, the cost JNJ_N can be expressed as a linear operator acting on ZZ. Explicitly, the symmetric cost matrix MJN∈R(1+2N)n×(1+2N)nM_{J_N} \in\mathbb{R}^{(1+2N)n \times(1+2N)n} is obtained from the state extraction matrices Hx,kH_{x,k} as:

MJN=∑k=0N−1Hx,k⊤QKHx,k+Hx,N⊤SHx,N,M_{J_N} = \sum_{k=0}^{N-1} H_{x,k}^\top Q_K H_{x,k} + H_{x,N}^\top S H_{x,N},

which yields JN(x0,vA,vB)=Tr⁡(MJNZ)J_N(x_0,v_A,v_B) = \operatorname{Tr}(M_{J_N}Z).

Let Gx(Z)∈SN×N\mathcal{G}_x(Z) \in\mathbb{S}^{N \times N} denote the linear operator mapping ZZ to the N×NN \times N sequence inner-product matrix x⊤xx^\top x. We define analogous linear operators GvA(Z)\mathcal{G}_{v_A}(Z), GvB(Z)\mathcal{G}_{v_B}(Z), and GKx(Z)\mathcal{G}_{Kx}(Z) for the other sequences.

With those mathematical tools, we are now ready to present our main result, which expresses the optimization problem (4) with the lifted variables ZZ.

Theorem 1 (Rank-constrained SDP formulation): The worst-case finite-horizon performance JN∗J_N^* defined in (6) equals the optimal value of the following rank-constrained SDP over the Gram matrix ZZ:

JN∗(εA,εB,QK,S)=max⁡Z⪰0Tr⁡(MJNZ)s.t.Tr⁡(E0⊤E0Z)≤1εA2Gx(Z)−GvA(Z)⪰0εB2GKx(Z)−GvB(Z)⪰0rank⁡(Z)≤1(9)\begin{aligned} J_N^*(\varepsilon_A,\varepsilon_B,Q_K,S) &= \max_{Z \succeq0} && \operatorname{Tr}(M_{J_N}Z) \\ \text{s.t.} && \operatorname{Tr}(E_0^\top E_0 Z) &\le1 \\ && \varepsilon_A^2\mathcal{G}_x(Z)-\mathcal{G}_{v_A}(Z) &\succeq0 \\ && \varepsilon_B^2\mathcal{G}_{Kx}(Z)-\mathcal{G}_{v_B}(Z) &\succeq0 \\ && \operatorname{rank}(Z) &\le1 \tag*{(9)} \end{aligned}

Theorem 1 reformulates (4) as an SDP whose only nonconvex constraint is the rank constraint. Dropping this constraint yields a tractable convex relaxation and an upper bound on JN∗J_N^*. The rank of an optimal relaxed solution ZSDP∗Z_{\mathrm{SDP}}^* then determines whether a worst-case trajectory can be recovered directly: a rank-one solution certifies that the bound is tight and yields a physically realizable worst-case trajectory. A higher-rank solution may instead represent a superposition of trajectories and need not correspond to any single admissible LTI system [14]; in this case, the bound may be conservative.

Worst Case Perturbations via PEP

Section III-C characterized the case where the relaxation is exact. In practice, however, the solution ZSDP∗Z_{\mathrm{SDP}}^* to the relaxed version of (8) often has rank strictly greater than one, even for relatively short planning horizons such as N=5N = 5, so that only the upper bound is available. To obtain a lower bound together with an actual worst-case perturbation, we search directly over admissible perturbations. For fixed (ΔA,ΔB)(\Delta_A,\Delta_B), the trajectory is linear in

x0x_0, so JN(x0,Δ)=x0⊤GN(Δ)x0J_N(x_0,\Delta) = x_0^\top G_N(\Delta)x_0 with

GN(Δ)=∑k=0N−1(ΦΔk)⊤QKΦΔk+(ΦΔN)⊤SΦΔN.G_N(\Delta) = \sum_{k=0}^{N-1}(\Phi_\Delta^k)^\top Q_K\Phi_\Delta^k + (\Phi_\Delta^N)^\top S\Phi_\Delta^N.

and ΦΔ\Phi_\Delta as in Example 1. The worst x0x_0 in (4) is therefore the dominant eigenvector of GN(Δ)G_N(\Delta), and the problem reduces to maximizing λmax⁡(GN(Δ))\lambda_{\max}(G_N(\Delta)) over DA×DB\mathcal{D}_A \times\mathcal{D}_B. We do so by projected gradient ascent, following [6], [7]: each step moves (ΔA,ΔB)(\Delta_A,\Delta_B) along the gradient, then projects them back onto the norm balls by clipping their singular values at εA\varepsilon_A and εB\varepsilon_B. As this problem is nonconvex, the ascent is started from several points: the perturbation that best fits the trajectory given by the dominant eigenvector of ZSDP∗Z_{\mathrm{SDP}}^*, and a set of random samples (Monte Carlo, MC) perturbations. In this case, every iterate is admissible, so the best cost found is a lower bound on JN∗J_N^*, while the SDP value is an upper bound. The ascent only guarantees first-order stationarity, but when the two bounds coincide, e.g., when rank⁡(ZSDP∗)=1\operatorname{rank}(Z_{\mathrm{SDP}}^*) = 1, the extracted perturbation and x0x_0 are the exact worst case.

We provide an interactive interface [15] for changing the parameters (matrices AA, BB, QQ, RR, SS and hyperparameters NN, εA\varepsilon_A, εB\varepsilon_B) in real time using the solver MOSEK.

Pseudospectral Targeting and Trajectories for large N

To illustrate the PEP approach, we apply it to three 2D systems (Figure 1). We chose the following nominal matrices AA because they each represent one of the three distinct worst-case behaviors we observed, making the differences visually clear:

Worst-case perturbation spectral representations and state-space trajectories

Figure 1. Worst-case perturbation: spectral representation (top row) and trajectories (bottom row) extracted via PEP and projected gradient ascent.

A1=[1101],A2=[−0.9101]andA3=[10.9−0.81],A_1 = \begin{bmatrix} 1 & 1 \\ 0 & 1 \end{bmatrix},\quad A_2 = \begin{bmatrix} -0.9 & 1 \\ 0 & 1 \end{bmatrix} \quad\text{and}\quad A_3 = \begin{bmatrix} 1 & 0.9 \\ -0.8 & 1 \end{bmatrix},

with B=[01]B = \begin{bmatrix} 0 \\ 1 \end{bmatrix}, Q=R=S=IdQ = R = S = \mathrm{Id}, N=20N = 20, and KK the infinite-horizon LQR gain computed with the same QQ and RR.

Varying the nominal system matrices reveals three classes of worst-case behavior, which we interpret through their spectral geometry (Figure 1, top row). This spectral view is used as a diagnostic of the PEP solution: in general, the finite-horizon objective is not determined by the perturbed eigenvalues alone (Example 1). For given uncertainty bounds εA\varepsilon_A and εB\varepsilon_B, the structured ε\varepsilon-pseudospectrum of the closed-loop system [7] is the set of all possible eigenvalues for the perturbed matrix ΦΔ=Φ+ΔA+ΔBK\Phi_\Delta= \Phi+ \Delta_A + \Delta_BK under valid LTI perturbations, computed exactly via the real stability radius formula [16]:

Λε(Φ):={λ∈C | det⁡(λI−(Φ+ΔA+ΔBK))=0, for some ∥ΔA∥2≤εA | ∥ΔB∥2≤εB}.\Lambda_\varepsilon(\Phi) := \left\{\lambda\in\mathbb{C} \,\middle|\, \det\left(\lambda I - (\Phi+ \Delta_A + \Delta_BK)\right) = 0,\ \text{for some } \lVert\Delta_A\rVert_2 \le\varepsilon_A \,\middle|\, \lVert\Delta_B\rVert_2 \le\varepsilon_B\right\}.

As the red stars show, the optimal perturbation often pushes a dominant eigenvalue toward the boundary of Λε(Φ)\Lambda_\varepsilon(\Phi). For large horizons, this behavior approaches the spectral-radius-maximizing perturbations predicted by classical μ\mu-analysis and pseudospectral theory [4, 17]. However, these asymptotic tools do not fully characterize the finite-horizon optimum: PEP captures transient dynamics and invariant-direction effects, so the worst-case cost is not determined by the eigenvalues alone. In our numerical evaluations, the pseudospectral heuristic that maximizes the spectral radius of ΦΔ\Phi_{\Delta} over the admissible perturbations [6] therefore yields a lower cost than PEP (e.g., on system A1A_1, J20ρ≈20.95J_{20}^{\rho} \approx20.95 versus J20PEP≈21.06J_{20}^{\mathrm{PEP}} \approx21.06). Since this maximizer is not unique, JNρJ_{N}^{\rho} denotes the largest finite-horizon cost among the sampled maximizers, the most favorable choice for the heuristic.

This occurs because the finite-horizon cost depends on transient amplification, whereas asymptotic tools mainly focus on pole locations. PEP does not impose or target any particular spectral configuration: it optimizes directly over admissible finite-horizon trajectories. A posteriori, we observe that the resulting perturbations may remain slightly inside Λε(Φ)\Lambda_{\varepsilon}(\Phi) depending on the cost matrices while modifying the associated invariant directions in a way that produces a larger transient cost.

The maximum spectral radius on the boundary can occur at a real positive, real negative, or complex eigenvalue, depending on the nominal eigenvalues. This shift changes the state-space trajectories (bottom row of Figure 1). The perturbation modifies the dominant eigenspace of ΦΔ∗\Phi_{\Delta^*} to confine the state energy to a slowly decaying invariant manifold. In our computations, we observe three cases:

  • Monotonic 1D Slow Manifold (λ∗>0\lambda^* > 0, Figure 1d): When the dominant worst-case eigenvalue is real and positive, the optimal perturbation applies a rank-one shear opposing the nominal damping. The trajectory collapses onto a 1D invariant line (a “slow manifold”) and moves monotonically toward the origin.

  • Oscillatory 1D Slow Manifold (λ∗<0\lambda^* < 0, Figure 1e): If the perturbed eigenvalue on the boundary is real and negative, the trajectory again collapses onto a 1D line. The negative eigenvalue causes the state to alternate signs, jumping back and forth across the origin at each step while slowly decaying.

  • Spiraling 2D Invariant Subspace (λ∗∈C\R\lambda^* \in\mathbb{C}\backslash\mathbb{R}, Figure 1f): When the worst-case eigenvalues form a complex conjugate pair, ΦΔ∗\Phi_{\Delta^*} acts on a 2D invariant plane, and the

state trajectory spirals. The perturbation changes the rotational frequency and minimizes radial contraction, creating a slowly decaying spiral.

In classical matrix perturbation theory, asymptotic variations that maximize the spectral radius correspond to rank-one (for real eigenvalues) or rank-two (for complex conjugate pairs) perturbations [18]. The PEP solutions recover this geometry. The primal formulation collapses finite-horizon trajectories onto the slow manifolds dictated by worst-case μ\mu-analysis.

Pole-Placement bifurcation with respect to NN

The optimal adversarial LTI perturbation depends directly on the length of the evaluation horizon. We illustrate this using the system A1A_1 with the same BB, QQ and RR but terminal cost S=diag⁡(0,1)S = \operatorname{diag}(0, 1), which penalizes only the second state component. We set the uncertainty bounds ϵA=0.15\epsilon_A = 0.15 and ϵB=0.05\epsilon_B = 0.05. The different worst-case pole placements under those settings are shown in Figure 2.

Figure 2. Spectral migration of the worst-case closed-loop poles as a function of the finite planning horizon NN. The colored diamonds represent the worst-case poles extracted from the PEP solution.

As the horizon NN increases, the initial transient growth contributes less to the total cumulative cost JNJ_N. The slow asymptotic decay of the state begins to drive the cost instead. As NN approaches 15, the perturbation stops manipulating transient eigenvectors. The poles migrate toward the rightmost edge of the structured ϵ\epsilon-pseudospectrum to maximize the asymptotic time constant. Along the way, the poles undergo a geometric bifurcation. For horizons N≤5N \le5, the optimal perturbation maintains a complex conjugate pole pair. For N≥6N \ge6, the poles meet on the real axis and split. This implies that the worst-case trajectories transition from 2D spiraling behavior (Figure 1f) to motion along a 1D slow manifold (Figure 1d).

Evaluating controllers over finite horizons therefore requires more than identifying the worst-case asymptotic poles on the pseudospectrum boundary.

Comparison with IQC and Pseudospectral Approaches

We now compare the worst-case performance obtained from the different approaches discussed in this paper: the IQC bound with static multipliers [5], the relaxed PEP SDP, the worst-case LTI perturbation extracted by projected gradient ascent, and the pseudospectral heuristic defined in Section IV-A. We evaluate these methods on system A1A_1 to solve problem (4), using the same matrix BB as in the previous section. The cost matrices are set to Q=R=S=IdQ = R = S = \mathrm{Id}, with perturbation bounds ϵA=0.15\epsilon_A = 0.15 and ϵB=0.05\epsilon_B = 0.05. Figure 3 shows how the accumulated cost changes with the horizon NN under each approach.

Figure 3. Finite-horizon accumulated cost bounds for system A1A_1 with ϵA=0.15\epsilon_A = 0.15 and ϵB=0.05\epsilon_B = 0.05. The LTV bound (static IQC) and the relaxed PEP (LTI) are upper bounds on JN∗J_N^*; the worst case found by gradient ascent, the Monte Carlo samples, and the pseudospectral heuristic are achievable costs, hence lower bounds.

To quantify the effect of time invariance, we also solve (8) without the rank constraint and with each LMI replaced by its diagonal, i.e., ϵA2∥xk∥22≥∥vA,k∥22\epsilon_A^2\lVert x_k\rVert_2^2 \ge\lVert v_{A,k}\rVert_2^2 and ϵB2∥Kxk∥22≥∥vB,k∥22\epsilon_B^2\lVert Kx_k\rVert_2^2 \ge\lVert v_{B,k}\rVert_2^2 for all k∈Kk \in\mathcal{K}. By Lemma 1 applied at each time step separately, these are exactly the interpolation conditions of LTV perturbations ΔA,k,ΔB,k\Delta_{A,k}, \Delta_{B,k}, so this bound (red) is an upper bound for the LTV problem, and the pink area shows the cost of this relaxation. By Lagrangian duality, it coincides with the IQC bound using static multipliers [5, 8]. Similarly, the multipliers obtained by dualizing the full LMIs of (8) weight these quadratic forms over all pairs of time steps, so the relaxed PEP (orange) coincides with the IQC bound using this larger class of multipliers, which contains the dynamic multipliers mentioned in Section I, as observed in [19].

As discussed at the end of Section III-C, dropping the rank constraint in the PEP SDP introduces conservatism, as it admits infeasible trajectories; this gap is shown by the orange shaded region. This gap initially grows as NN increases and then plateaus, similarly to the gap between the LTV and relaxed SDP bounds. However, the LTI worst case extracted by projected gradient ascent (blue circles) is admissible, so its cost is a lower bound on JN∗J_N^*. It is first-order stationary but not certified globally optimal. Its cost is higher than what random Monte Carlo sampling (black stars) typically finds, as random sampling struggles to hit the narrow geometric manifold where the worst-case parameters lie.

The pseudospectral heuristic (green solid line) yields the lowest cost of the group. As discussed in Section IV-A, maximizing the spectral radius places the dominant eigenvalue on the boundary of the pseudospectrum and thus minimizes the long-term decay rate. However, it misses the short-term transient growth. The heuristic does not align the eigenvectors with a worst-case initial condition x0x_0, leaving out a large portion of the finite-horizon cost for short horizons.

Conclusions and Perspectives

This paper develops a Performance Estimation Problem (PEP) framework for evaluating the worst-case finite-horizon cost of a fixed state-feedback controller under norm-bounded LTI uncertainty. Operator interpolation is used to characterize the trajectories generated by a single admissible perturbation pair, yielding an exact rank-constrained semidefinite formulation. Its convex relaxation provides an upper bound on the worst-case cost. Our results suggest that finite-horizon worst cases are driven by transient alignment rather than pole placement: LTI perturbations align slowly decaying invariant manifolds with specific initial conditions. We also show that asymptotic metrics, such as structured pseudospectra, miss part of the finite-time cost and that IQC approaches can be conservative. Open questions include characterizing when a worst-case LTV sequence collapses to an LTI one, leading to tight LTV relaxations.

Acknowledgment

Anthony Couthures would like to thank Mengmou Li for insightful discussions and suggestions on the connections between the PEP framework and IQC analysis.

References

  1. [1]F. Amato, M. Ariola, and P. Dorato, “Finite-Time Control of Linear Systems Subject to Parametric Uncertainties and Disturbances,” Automatica, vol. 37, no. 9, pp. 1459–1463, 2001.DOI
  2. [2]D. Q. Mayne, M. M. Seron, and S. V. Raković, “Robust Model Predictive Control of Constrained Linear Systems with Bounded Disturbances,” Automatica, vol. 41, no. 2, pp. 219–224, 2005.DOI
  3. [3]I. Abel, D. Steeves et al., “Prescribed-Time Safety Design for Strict-Feedback Nonlinear Systems,” IEEE Transactions on Automatic Control, vol. 69, no. 3, pp. 1464–1479, 2024.DOI
  4. [4]A. Packard and J. Doyle, “The Complex Structured Singular Value,” Automatica, vol. 29, no. 1, pp. 71–109, 1993.DOI
  5. [5]A. Megretski and A. Rantzer, “System Analysis via Integral Quadratic Constraints,” IEEE Transactions on Automatic Control, vol. 42, no. 6, pp. 819–830, 1997.
  6. [6]N. Guglielmi, C. Lubich, and S. Sicilia, “Rank-1 Matrix Differential Equations for Structured Eigenvalue Optimization,” SIAM Journal on Numerical Analysis, vol. 61, no. 4, pp. 1737–1762, 2023.arxiv.org/abs/2206.09338
  7. [7]N. Guglielmi and C. Lubich, “Transient Dynamics Under Structured Perturbations: Bridging Unstructured and Structured Pseudospectra,” SIAM Journal on Numerical Analysis, vol. 63, no. 2, pp. 908–930, 2025.arxiv.org/abs/2401.09601
  8. [8]P. Seiler, R. M. Moore et al., “Finite Horizon Robustness Analysis of LTV Systems Using Integral Quadratic Constraints,” Automatica, vol. 100, pp. 135–143, 2019.DOI
  9. [13]N. Bousselmi, J. M. Hendrickx, and F. Glineur, “Interpolation Conditions for Linear Operators and Applications to Performance Estimation Problems,” arXiv, 2024.arxiv.org/abs/2302.08781
  10. [14]Z.-Q. Luo, W.-K. Ma et al., “Semidefinite Relaxation of Quadratic Optimization Problems,” IEEE Signal Processing Magazine, vol. 27, no. 3, pp. 20–34, 2010.DOI
  11. [15]A. Couthures, “Worst-case LTI perturbations of finite-horizon LQR: A performance estimation problem approach,” 10.5281/zenodo.23161489, 2026. https://github.com/AnthonyCouthures/PEP-LQRDOI
  12. [16]L. Qiu, B. Bernhardsson et al., “A Formula for Computation of the Real Stability Radius,” Automatica, vol. 31, no. 6, pp. 879–890, 1995.DOI
  13. [17]D. Hinrichsen and A. J. Pritchard, “Real and Complex Stability Radii: A Survey,” in Control of Uncertain Systems: Proceedings of an International Workshop Bremen, West Germany, June 1989, D. Hinrichsen and B. Mårtensson, Eds. Boston, MA: Birkhäuser, 1990, pp. 119–162.
  14. [18]L. N. Trefethen and M. Embree, Spectra and Pseudospectra: The Behavior of Nonnormal Matrices and Operators. Princeton University Press, 2005.
  15. [19]B. V. Scoy and L. Lessard, “Absolute Stability via Lifting and Interpolation,” in 2022 IEEE 61st Conference on Decision and Control (CDC), 2022, pp. 6217–6223.arxiv.org/abs/2209.06412

Paper details

vlnc:W_tecjxxq2
Version
v2 · latest
Published
Fresh — added to the Hub within the last 30 days
Added
License
CC BY 4.0
Usage

views · 0

downloads · 0

A view counts once per browser per day, a download each time the PDF is requested.

  • Mathematics

Not recorded for this paper

View statement
Looking for related papers…
Contents