The robust path of a linear robust optimization problem is a Bregman projection of a dual-space curve, and proximal point trajectories of the nominal problem approximate it with a geometry-dependent error bound.
2019 Winter Simulation Conference (WSC), 3740--3751
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.OC 1years
2025 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
Robust Paths: Geometry and Computation
The robust path of a linear robust optimization problem is a Bregman projection of a dual-space curve, and proximal point trajectories of the nominal problem approximate it with a geometry-dependent error bound.