A convex robust control synthesis method that embeds a model of time-variation to produce first-order algorithms for smooth strongly convex time-varying problems.
Direct synthesis of iterative al- gorithms with bounds on achievable worst-case convergence rate,
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.OC 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Convex Synthesis of First-Order Methods for Time-Varying Smooth Strongly Convex Optimization
A convex robust control synthesis method that embeds a model of time-variation to produce first-order algorithms for smooth strongly convex time-varying problems.