Advertisement

Squared Functional Systems and Optimization Problems

  • Yurii Nesterov
Part of the Applied Optimization book series (APOP, volume 33)

Abstract

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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [1]
    Hettich, R., and K.O. Kortanek. “Semi-infinite programming: theory, methods and applications,” SIAM Review, 35, No 3, 380–429, 1993.MathSciNetzbMATHCrossRefGoogle Scholar
  2. [2]
    Karlin, S., and W.J. Studden. Tchebyshev Systems: with Applications in Analysis and Statistics, Interscience Publishers, John Wiley & Sons, New York, 1966.Google Scholar
  3. [3]
    Lukacs, A “Verscharfung der ersten Mittelwertsatzes der Integralrechnung für rationale Polynome”, Math. Zeitschrift, 2, 229–305, 1918.MathSciNetCrossRefGoogle Scholar
  4. [4]
    Maithuber, J.C. “On Haar’s theorem concerning Chebyshev approximation problems having unique solutions”, Proc. amer. Math. Soc. 7, 609–615, 1956.MathSciNetGoogle Scholar
  5. [5]
    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
  6. [6]
    Nesterov, Yu., and A. Nemirovsky. Interior Point Polynomial Algorithms in Convex Programming, SIAM, Philadelphia, 1994.zbMATHCrossRefGoogle Scholar
  7. [7]
    Nesterov, Yu., and M. J. Todd. “Self-scaled Barriers and Interior-Point Methods for Convex Programming”, Mathematics of Operation Research, 22, 1–42, 1997.MathSciNetzbMATHCrossRefGoogle Scholar
  8. [8]
    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
  9. [9]
    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

Copyright information

© Springer Science+Business Media Dordrecht 2000

Authors and Affiliations

  • Yurii Nesterov

There are no affiliations available

Personalised recommendations