SIAM Journal on Control and Optimization · 1996 · 17 citations · 1 references
Natural SciencesMathematicsAlgorithmsDifferential EquationsOptimizationShortest Path AlgorithmsTransportation ProblemsVariational FormulationVariational InequalitiesVariational OptimizationConvex Variational ProblemsNonlinear Variational ProblemsShortest PathsVariational Methods In Partial Differential EquationsVariational Problems
A classical theorem of Hardy, L.ittlewood, and Pólya on rearrangements of functions is used to prove the equivalence of a class of variational problems. As a consequence, solutions are shortest paths and can be computed numerically via quadratic programming. Applications include solar cars and reservoirs.
1