Quadratically constrained minimum cross-entropy analysis
DOI10.1007/BF01587079zbMath0671.90071OpenAlexW2067885730MaRDI QIDQ1119476
J. R. Rajasekera, Shu-Cherng Fang
Publication date: 1989
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf01587079
perturbationdualityapproximationgeometric inequalitiesminimum cross-entropy problemsnonsmooth concave linearly constrained dual problemquadratic (convex) constraints
Numerical mathematical programming methods (65K05) Nonlinear programming (90C30) Duality theory (optimization) (49N15) Measures of information, entropy (94A17) Mathematical programming (90C99)
Related Items (11)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Minimum cross-entropy spectral analysis
- Controlled dual perturbations for l p -programming
- Quadratically Constrained Information Theoretic Analysis
- Axiomatic derivation of the principle of maximum entropy and the principle of minimum cross-entropy
- Extremal principles and optimization dualities for khinchin-kullback-leibler estimation
- Controlled perturbations for quadratically constrained quadratic programs
- Convex Analysis
This page was built for publication: Quadratically constrained minimum cross-entropy analysis