A single-trajectory model-free inverse LQR method is reformulated as a convex conic feasibility problem and solved by BSUM with an O(1/k) sublinear convergence rate claim.
Linear matrix inequalities in system and control theory
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
citation-role summary
background 1
citation-polarity summary
fields
math.OC 1years
2025 1verdicts
REJECT 1roles
background 1polarities
support 1representative citing papers
citing papers explorer
-
A Convex Optimization Approach to Model-Free Inverse Optimal Control with Provable Convergence
A single-trajectory model-free inverse LQR method is reformulated as a convex conic feasibility problem and solved by BSUM with an O(1/k) sublinear convergence rate claim.