# A Generic Solver for Unconstrained Control Problems with Integral Functional Objectives

## TL;DR

This paper introduces a versatile and faster solver for unconstrained control problems with integral objectives, significantly improving computational efficiency and demonstrating applicability to classic and extended problems.

## Contribution

The paper generalizes and enhances an existing algorithm for unconstrained control problems, achieving faster computation and broader applicability.

## Key findings

- 30x faster than previous algorithm on Witsenhausen's counterexample
- Successfully applied to additional control problem examples
- Potential for extension to constrained control problems

## Abstract

We present a generic solver for unconstrained control problems (UCPs) whose objectives take the form of an integral functional of the controllers. The solver generalizes and improves upon the algorithm proposed by Tseng and Tang for the Witsenhausen's counterexample, which provides the best-known results. In essence, we show that minimizing the objective implies minimizing the marginal cost functions almost everywhere, and we perform the latter task pointwisely by the adaptive minimization technique, which speeds up the computation. We implement single-threaded and parallelized versions of the proposed algorithm. Our implementation runs $30 \times$ faster than Tseng and Tang's algorithm on the Witsenhausen's counterexample, and we demonstrate the applicability of the solver and discuss the possible generalization to constrained problems through two more examples.