A weighted sum equals the lexicographic cascade in convex MPC exactly when the weight supports the upper image at the lexicographic point; such certificates are computable under ℓ1 hinges but expire from tick to tick.
Explicit weight bounds for lexicographic optimization,
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.OC 1years
2026 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
Weight Certificates for Convex Multi-Objective MPC: Geometric Characterization, $\ell^1$ Construction, and $\ell^2$ Foreclosure
A weighted sum equals the lexicographic cascade in convex MPC exactly when the weight supports the upper image at the lexicographic point; such certificates are computable under ℓ1 hinges but expire from tick to tick.