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.
The fastest known globally convergent first-order method for minimizing strongly convex functions
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
citation-role summary
background 1
citation-polarity summary
fields
math.OC 2years
2026 2verdicts
UNVERDICTED 2roles
background 1polarities
background 1representative citing papers
A canonical structure via linear transformation enables projected first-order algorithms with delayed feedback to reach the optimum at the same rate as their unconstrained versions.
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.
-
A Canonical Structure for Constructing Projected First-Order Algorithms With Delayed Feedback
A canonical structure via linear transformation enables projected first-order algorithms with delayed feedback to reach the optimum at the same rate as their unconstrained versions.