Some aspects of convexity useful in information theory

From its very beginning, information theory has been pervaded by convexity arguments. Much of the necessary background was developed on an ad hoc basis without reference to the knowledge available from the mathematical study of convex sets and functions. Yet explicit use shown by examples.

[1]  Hans S. Witsenhausen,et al.  A conditional entropy bound for a pair of discrete random variables , 1975, IEEE Trans. Inf. Theory.

[2]  H. Witsenhausen.  A minimax control problem for sampled linear systems , 1968 .

[3]  M. Katz.  On the extreme points of a certain convex polytope , 1970 .

[4]  L. Dubins.  On extreme points of convex sets , 1962 .

[5]  J. Kruskal.  Two convex counterexamples: A discontinuous envelope function and a nondifferentiable nearest-point mapping , 1969 .

[6]  Aaron D. Wyner,et al.  The common information of two dependent random variables , 1975, IEEE Trans. Inf. Theory.

[7]  L. Mirsky,et al.  Results and problems in the theory of doubly-stochastic matrices , 1963 .

[8]  R. Soland.  An Algorithm for Separable Nonconvex Programming Problems II: Nonconvex Constraints , 1971 .

[9]  Arie Tamir,et al.  Ergodicity and symmetric mathematical programs , 1977, Math. Program..

[10]  V. Klee,et al.  Semicontinuity of the face-function of a convex set , 1971 .

[11]  Thomas J. Santner,et al.  An Inequality for Multivariate Normal Probabilities with Application to a Design Problem , 1977 .

[12]  Wendy Koontz.  Convex Sets of Some Doubly Stochastic Matrices , 1978, J. Comb. Theory, Ser. A.

[13]  Allan B. Cruse.  A note on symmetric doubly-stochastic matrices , 1975, Discret. Math..

[14]  J. E. Falk,et al.  An Algorithm for Separable Nonconvex Programming Problems , 1969 .

[15]  H. Witsenhausen.  Values and Bounds for the Common Information of Two Discrete Random Variables , 1976 .