Über die Numerische Lösung Nichtlinearer Optimierungsprobleme bei Vorhandensein Gewisser Invarianzeigenschaften

Abstract

We consider a nonlinear objective function subject to constraints. We assume that the objective function satisfies an additional condition, namely, that it is invariant under a certain linear transformation. This additional condition is satisfied for a wide class of applications. It will be shown that under above conditions the problem can either be solved by direct methods (e.g., dynamic programming, etc.), or, more economically, by employing numerical schemes in conservation law form (e.g., the Lax-Wendroff method).