The geometric programming dual to the extinction probability problem in simple branching processes

DOI10.1214/AOP/1176994422MaRDI QIDQ1158888zbMATH OpenOpenAlexFDO

Authors Paul D. Feigin, Ury Passy

Publication date 1981

Published in The Annals of Probability (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1214/aop/1176994422

zbMATH Keywords

extinction probabilitygeometric dualitybranching measureinfinite geometric programKullback directed divergence

Mathematics Subject Classification ID

Measures of information, entropy (94A17) Branching processes (Galton-Watson, birth-and-death, etc.) (60J80)

Cited in

(3)

• A tutorial on geometric programming
• Path following in the exact penalty method of convex programming
• MM algorithms for geometric and signomial programming

This page was built for publication: The geometric programming dual to the extinction probability problem in simple branching processes

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