Extends lossless convexification theory for linear time-varying systems with discrete inputs by proving normality preservation under epigraph reformulation and geometric conditions that guarantee the relaxed solution satisfies the original discrete constraints exactly.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.OC 1years
2025 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Geometric Conditions for Lossless Convexification in Linear Optimal Control with Discrete-Valued Inputs: Real-Time Implementation for Spacecraft Rendezvous
Extends lossless convexification theory for linear time-varying systems with discrete inputs by proving normality preservation under epigraph reformulation and geometric conditions that guarantee the relaxed solution satisfies the original discrete constraints exactly.