Abstract: A proof is given for a duality theorem for a class of convex programs, i.e., constrained minimization of convex functions. A simple example is included.

Written in a tutorial style, the authors summarize the key ideas of information relaxation methods for stochastic DPs and demonstrate their use in several examples. They provide a “one-stop-shop” for ...

Note These examples were developed as part of the DARPA DPRIVE program. They are solely for research purposes and should not be used for benchmarking or production purposes where performance is ...

Less well-known is Grothendieck's program, sketched in letters to Serre and Breen [G1], [G2]. Grothendieck gives several extensions of geometric class field theory through duality, derived categories, ...

In mathematics, Cartier duality is an analogue of Pontryagin duality for commutative group schemes. It was introduced by Pierre Cartier (1962). A finite commutative group scheme over a field ...