A quadratically convergent global algorithm for the linearly-constrained minimum cross-entropy problem
From MaRDI portal
Recommendations
- Quadratically constrained minimum cross-entropy analysis
- Minimum cross-entropy analysis with entropy-type constraints
- Entropy optimization models with convex constraints
- Computation of minimum cross entropy spectral estimates: An unconstrained dual convex programming method
- scientific article; zbMATH DE number 1790601
Cites work
- scientific article; zbMATH DE number 3928227 (Why is no real title available?)
- scientific article; zbMATH DE number 3972625 (Why is no real title available?)
- scientific article; zbMATH DE number 4043578 (Why is no real title available?)
- scientific article; zbMATH DE number 3683373 (Why is no real title available?)
- scientific article; zbMATH DE number 3748742 (Why is no real title available?)
- scientific article; zbMATH DE number 3591873 (Why is no real title available?)
- scientific article; zbMATH DE number 3241743 (Why is no real title available?)
- scientific article; zbMATH DE number 3296905 (Why is no real title available?)
- A new variant of the primal affine scaling algorithm for linear programs
- An unconstrained convex programming view of linear programming
- Constrained Entropy Models; Solvability and Sensitivity
- Curved search methods for unconstrained optimization
- Information Theory and Statistical Mechanics
- Linear programming with entropic perturbation
- Maximum Entropy Analysis of Multiple-server Queueing Systems
- Maximum Entropy Condition in Queueing Theory
- Minimum cross-entropy analysis with entropy-type constraints
- On some methods for entropy maximization and matrix scaling
- On the convex programming approach to linear programming
- On the optimal entropy analysis
- Quadratically Constrained Information Theoretic Analysis
- Quadratically constrained minimum cross-entropy analysis
- Scaling of matrices to achieve specified row and column sums
Cited in
(6)- On the entropic perturbation and exponential penalty methods for linear programming
- An efficient computational procedure for solving entropy optimization problems with infinitely many linear constraints
- Computation of minimum cross entropy spectral estimates: An unconstrained dual convex programming method
- Quadratically constrained minimum cross-entropy analysis
- scientific article; zbMATH DE number 5818908 (Why is no real title available?)
- Cross entropy algorithm with multiple important sample level estimation for global optimization problems
This page was built for publication: A quadratically convergent global algorithm for the linearly-constrained minimum cross-entropy problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1342076)