collaborators

1 paper

math.OC2026

Dimension-Free Complexity Guarantees for Dual Dynamic Programming

Pablo Barros, Vincent Guigues, Jiaming Liang +1

This paper studies the complexity of a dual dynamic programming (DDP) method for solving a class of convex optimization problems with linear coupling constraints. Existing complexi…