Spectral Estimation Via Convex Programming

  • Aharon Ben-Tal
  • Jonathan M. Borwein
  • Marc Teboulle


There are many concrete optimization problems that can be reduced to minimizing a convex objective function over an infinite-dimensional convex cone subject to a finite number of equality (or inequality) constraints. Typically the cone fails to have a nonempty interior, and so classical constraint conditions do not apply. Two such types of problems concern constrained spline interpolation and spectral estimation. An earlier treatment of such problems in the context of statistical information theory can be traced back to the work of Ben-Tal and Charnes [1], which in turn extended the finite-dimensional results of Charnes and Cooper [7].


Dual Problem Duality Theory Spectral Estimation Constraint Qualification Entropy Spectral 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [1]
    Ben-Tal, A. and A. Chames, “A Dual Optimization Framework for Some Problems of Information Theory and Statistics,” Problems in Control and Information Theory 8 (1979), 387–401.Google Scholar
  2. [2]
    Ben-Tal, A., J.M. Borwein, and M. Teboulle, “A Dual Approach to Multidimensional Lp Spectral Estimation Problems” (submitted).Google Scholar
  3. [3]
    Borwein, J.M. and A. Lewis, “Infinite Dimensional Convex Programming Problems with Finite Dimensional Duals” (in preparation).Google Scholar
  4. [4]
    Borwein, J.M. and H. Wolkowicz, “A Simple Constraint Qualification in Infinite Dimensional Programming,” Mathematical Programming 35 (1986), 83–96.CrossRefGoogle Scholar
  5. [5]
    Brockett, P.L., A. Charries, and K.H. Paick, “Computation of a Minimum Cross Entropy Spectral Estimates: An Unconstrained Dual Convex Programming Method,” IEEE Transactions on Information Theory IT 32 (1986), 236–242.CrossRefGoogle Scholar
  6. [6]
    Burg, J.P., Maximum Entropy Spectral Analysis, Ph.D. dissertation, Stanford University, Stanford, CA, 1975.Google Scholar
  7. [7]
    Charms, A. and W.W. Cooper, “Constrained Kuilback—Leibler Estimation; Generalized Cobb—Douglas Balance, and Unconstrained Convex Programming,” Accademia Nationale Dei Lincei 83 (1975), 568–576.Google Scholar
  8. [8]
    Csiszar, I., “information-Type Measures of Difference of Probability Distributions and Indirect Observations,” Studia Scientifica Mathematica Hungary 2 (1967), 299–318.Google Scholar
  9. [9]
    Edward, J.A. and M.M. Fitelson, “Notes on Maximum Entropy-Processing,” IEEE Transactions on information Theory IT 19 (1973), 232–234.CrossRefGoogle Scholar
  10. [10]
    Goodrich, B.K. and A. Steinhardt, “L 2 Spectral Estimation,“ SIAM Journal of Applied Mathematics 46 (1986), 417–428.CrossRefGoogle Scholar
  11. [11]
    Irvine, L.D., S.P. Marin, and P.W. Smith, “Constrained lnter-polation and Smoothing,” Constructive Approximation 2 (1986), 129–151.CrossRefGoogle Scholar
  12. [12]
    Johnson, R.W. and J.E. Shore, “Which is the Better Entropy Expression for Speech Processing: s log s or log s?”, IEEE Transactions on Acoustics, Speech and Signal Processing ASSP 32 (1984) 129–136.CrossRefGoogle Scholar
  13. [13]
    Karlin, S. and W. Studden, Tchebycheff Systems with Applications in Analysis and Statistics, Interscience, New York, 1966.Google Scholar
  14. [14]
    Rockafellar, R.T., Convex Analysis, Princeton University Press, Princeton, NJ, 1970.Google Scholar
  15. [15]
    Rockafellar, R.T., “Integral Functionals, Normal lntegrands and Measurable Selections,” in Lecture Notes in Mathematics, Vol. 543, Springer Verlag, New York, 1976, pp. 157–207.Google Scholar

Copyright information

© Springer Science+Business Media New York 1992

Authors and Affiliations

  • Aharon Ben-Tal
  • Jonathan M. Borwein
  • Marc Teboulle

There are no affiliations available

Personalised recommendations