Pages that link to "Item:Q1119476"
From MaRDI portal
The following pages link to Quadratically constrained minimum cross-entropy analysis (Q1119476):
Displaying 16 items.
- Minimum cross-entropy analysis with entropy-type constraints (Q1186903) (← links)
- On the optimal entropy analysis (Q1194774) (← links)
- Linearly constrained estimation by mathematical programming (Q1262209) (← links)
- Proximal minimization algorithm with \(D\)-functions (Q1321192) (← links)
- Deriving an unconstrained convex program for linear programming (Q1321279) (← links)
- Interior-point algorithm for quadratically constrained entropy minimization problems (Q1321322) (← links)
- A quadratically convergent global algorithm for the linearly-constrained minimum cross-entropy problem (Q1342076) (← links)
- Quasi chain rule for min-entropy (Q1707982) (← links)
- Minimum discrimination information problems via generalized geometric programming. (Q1812225) (← links)
- Entropy optimization models with convex constraints (Q1891156) (← links)
- An efficient computational procedure for solving entropy optimization problems with infinitely many linear constraints (Q1923627) (← links)
- Quadratically constrained information theoretic analysis (Q3200369) (← links)
- Computation of minimum cross entropy spectral estimates: An unconstrained dual convex programming method (Q3709720) (← links)
- Quadratically Constrained Information Theoretic Analysis (Q3774696) (← links)
- An unconstrained convex programming view of linear programming (Q4007117) (← links)
- Linear programming with entropic perturbation (Q5286755) (← links)