Name
Title | ||
|---|---|---|
Computation of minimum cross entropy spectral estimates: An unconstrained dual convex programming method |
Abstract | ||
|---|---|---|
The minimum cross entropy spectral analysis procedure (a generalization of maximum entropy spectral analysis) is formulated as a convex programming problem, and its unconstrained dual convex programming problem is shown. In this dual setting the Lagrange multipliers are precisely the dual variables, and the numerical solution values are easily determined by any of a number of nonlinear programming codes. This result vastly simplifies the computation of all such spectral density estimates. |
Year | DOI | Venue |
|---|---|---|
1986 | 10.1109/TIT.1986.1057161 | Information Theory, IEEE Transactions |
Keywords | Field | DocType |
Minimum-entropy methods,Nonlinear programming | Combinatorics,Maximum entropy spectral estimation,Lagrange multiplier,Entropy maximization,Nonlinear programming,Principle of maximum entropy,Convex optimization,Mathematics,Convex analysis,Computation | Journal |
Volume | Issue | ISSN |
32 | 2 | 0018-9448 |
Citations | PageRank | References |
3 | 0.98 | 3 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Brockett, P. | 1 | 3 | 0.98 |
| A. Charnes | 2 | 271 | 145.50 |
| Kwang Paick | 3 | 3 | 0.98 |