An efficient computational procedure for solving entropy optimization problems with infinitely many linear constraints
DOI10.1016/0377-0427(95)00266-9zbMath0872.65054OpenAlexW2039099506MaRDI QIDQ1923627
H.-S. Jacob Tsao, Shu-Cherng Fang
Publication date: 8 October 1997
Published in: Journal of Computational and Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0377-0427(95)00266-9
convergencenumerical examplesdualitysemi-infinite programmingcompact metric spaceentropy optimization problemcutting-plane type algorithminfinite constraint set
Numerical mathematical programming methods (65K05) Programming in abstract spaces (90C48) Semi-infinite programming (90C34)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The role of duality in optimization problems involving entropy functionals with applications to information theory
- Quadratically constrained minimum cross-entropy analysis
- On some methods for entropy maximization and matrix scaling
- Minimum cross-entropy analysis with entropy-type constraints
- On the optimal entropy analysis
- A quadratically convergent global algorithm for the linearly-constrained minimum cross-entropy problem
- Semi-infinite programming and applications. An International Symposium, Austin, Texas, September 8-10, 1981
- Linear programming with inequality constraints via entropic perturbation
- An approach to nonlinear programming
- Curved search methods for unconstrained optimization
- Minimum cross-entropy spectral analysis
- An inexact approach to solving linear semi-infinite programming problems
- Duality Relationships for Entropy-Like Minimization Problems
- Geometric Programming
- Linear programming with entropic perturbation
- Partially-Finite Programming in $L_1 $ and the Existence of Maximum Entropy Estimates
This page was built for publication: An efficient computational procedure for solving entropy optimization problems with infinitely many linear constraints
