Squared Functional Systems and Optimization Problems
In this paper we give an explicit description of the cones of polynomials represent able as a sum of squared functions. We prove that such cones can be always seen as a linear image of the cone of positive semidefinite matrices. As a consequence of the result, we get a description of the cones of univariate polynomials, which are non-negative on a ray and on an interval, and a description of non-negative trigonometric polynomials. We discuss some applications of the results to multi-variate polynomials.
Unable to display preview. Download preview PDF.
- Karlin, S., and W.J. Studden. Tchebyshev Systems: with Applications in Analysis and Statistics, Interscience Publishers, John Wiley & Sons, New York, 1966.Google Scholar
- Markov, A.A. Lecture notes on functions with the least deviation from zero, 1906. Reprinted in Markov A.A. Selected Papers(ed. N. Achiezer), GosTechlzdat, 244–291, 1948, Moscow (in Russian).Google Scholar
- Nesterov, Yu., and M. J. Todd. “Primal-Dual Interior-Point Methods for Self-scaled Cones”, To be published in SIAM Journal of Optimization, 1995.Google Scholar
- Wu, S.-R., S. Boyd and L. Vandenberghe. “FIR Filter Design via Special Factorization and Convex Optimization”, to appear in Chapter 1, Applied Computational Control, Signal and Communications, Beswa Datta ed., Birkhauser, 1997.Google Scholar