Mathematical Programming and the Maximum Transform

DOI10.1137/0110042MaRDI QIDQ3292039zbMATH OpenOpenAlexFDO

Authors Richard Bellman, William Karush

Publication date 1962

Published in Journal of the Society for Industrial and Applied Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1137/0110042

zbMATH Keywords

applications of probability theory, mathematical programming

Cited in

(16)

• Sequential minimaxization under dynamic programming structure
• Conjugate transforms for _T semigroups of probability distribution functions
• Iterative integral versus dynamic programming
• The imbedded state approach to reducing dimensionality in dynamic programs of higher dimensions
• On information functions and their polars
• Computational experiments with a class of dynamic programming algorithms of higher dimensions
• Conjugate duality and its implications in dynamic programming
• Computation of optimal controls
• Profit functions and optimal control: An alternate description of the control problem
• Total variation on a tree
• Fast value iteration: an application of Legendre-Fenchel duality to a class of deterministic dynamic programming problems in discrete time
• Necklaces, convolutions, and \(X+Y\)
• A polyhedral perspective on tropical convolutions
• Laplace meets Moreau: smooth approximation to infimal convolutions using Laplace's method
• The law of large numbers for fuzzy variables under a general triangular norm extension principle
• Conjugate duality and the curse of dimensionality

This page was built for publication: Mathematical Programming and the Maximum Transform

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3292039)