Skip to main content
Log in

Bilinear optimality constraints for the cone of positive polynomials

  • Full Length Paper
  • Series B
  • Published:
Mathematical Programming Submit manuscript

Abstract

For a proper cone \({{\mathcal K}\subset\mathbb{R}^n}\) and its dual cone \({{\mathcal K}^*}\) the complementary slackness condition \({\langle{\rm {\bf x}},{\rm {\bf s}}\rangle=0}\) defines an n-dimensional manifold \({C({\mathcal K})}\) in the space \({{\mathbb R}^{2n}}\) . When \({{\mathcal K}}\) is a symmetric cone, points in \({C({\mathcal K})}\) must satisfy at least n linearly independent bilinear identities. This fact proves to be useful when optimizing over such cones, therefore it is natural to look for similar bilinear relations for non-symmetric cones. In this paper we define the bilinearity rank of a cone, which is the number of linearly independent bilinear identities valid for points in \({C({\mathcal K})}\) . We examine several well-known cones, in particular the cone of positive polynomials \({{\mathcal P}_{2n+1}}\) and its dual, and show that there are exactly four linearly independent bilinear identities which hold for all \({({\rm {\bf x}},{\rm {\bf s}})\in C({\mathcal P}_{2n+1})}\), regardless of the dimension of the cones. For nonnegative polynomials over an interval or half-line there are only two linearly independent bilinear identities. These results are extended to trigonometric and exponential polynomials. We prove similar results for Müntz polynomials.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. Alizadeh F., Eckstein J., Noyan N., Rudolf G.: Arrival rate approximation by nonnegative cubic splines. Oper. Res. 56, 140–156 (2008)

    Article  MathSciNet  MATH  Google Scholar 

  2. Alizadeh F., Schmieta S.H.: Symmetric cones, potential reduction methods and word-by-word extensions. In: Saigal, R., Vandenberghe, L., Wolkowicz, H. (eds) Handbook of Semidefinite Programming, Theory, Algorithms and Applications, pp. 195–233. Kluwer, Dordrecht (2000)

    Chapter  Google Scholar 

  3. Dette H., Studden W.J.: The Theory of Canonical Moments with Applications in Statistics, Probability, and Analysis. Wiley Interscience Publishers, New York (1997)

    MATH  Google Scholar 

  4. Faraut J., Korányi A.: Analysis on Symmetric Cones. Oxford University Press, Oxford, UK (1994)

    MATH  Google Scholar 

  5. Faybusovich L.: Euclidean Jordan algebras and interior-point algorithms. Positivity 1(4), 331–357 (1997)

    Article  MathSciNet  MATH  Google Scholar 

  6. Güler, O.: Personal communication (1997)

  7. Karlin S., Studden W.J.: Tchebycheff Systems, with Applications in Analysis and Statistics. Wiley Interscience Publishers, New York (1966)

    MATH  Google Scholar 

  8. Koecher M.: The Minnesota Notes on Jordan Algebras and Their Applications. In: Kreig, A., Walcher, S. (eds) Based on Lectures given in The University of Minnesota, 1960, Springer, Berlin (1999)

    Google Scholar 

  9. Nesterov Y.: Squared functional systems and optimization problems. In: Frenk, H., Roos, K., Terlaky, T., Zhang, S. (eds) High Performance Optimization. Appl. Optim., pp. 405–440. Kluwer, Dordrecht (2000)

    Google Scholar 

  10. Noyan, N., Papp, D., Rudolf, G., Alizadeh, F.: Bilinearity rank of the cone of positive polynomials and related cones. Tech. Report 7-2009, Rutgers Center for Operations Research, Rutgers University, Piscataway, NJ (2009)

  11. Noyan, N., Rudolf, G., Alizadeh, F.: Optimality constraints for the cone of positive polynomials. Tech. Report 1-2005, Rutgers Center for Operations Research, Rutgers University, Piscataway, NJ (2005)

  12. Papp, D., Alizadeh, F.: Linear and second order cone programming approaches to statistical estimation problems. Tech. Report RRR 13-2008, RUTCOR, Rutgers Center For Operations Research (2008, submitted)

  13. Schafer R.D.: An Introuduction to Nonassociative Algebras. Academic Press, New York (1966)

    Google Scholar 

  14. Schmieta S.H., Alizadeh F.: Extension of commutative class of primal–dual interior point algorithms to symmetric cones. Math. Program. 96, 409–438 (2003)

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Gábor Rudolf.

Additional information

The research of authors are partly supported by National Science Foundations grants numbers CCR-0306558 and CMMI-0935305.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Rudolf, G., Noyan, N., Papp, D. et al. Bilinear optimality constraints for the cone of positive polynomials. Math. Program. 129, 5–31 (2011). https://doi.org/10.1007/s10107-011-0458-y

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10107-011-0458-y

Keywords

Mathematics Subject Classification (2000)

Navigation