Skip to main content
SpringerLink
Log in

A note on total degree polynomial optimization by Chebyshev grids

  • Original Paper
  • Published:
Optimization Letters Aims and scope Submit manuscript

Abstract

Using the approximation theory notions of polynomial mesh and Dubiner distance in a compact set, we derive error estimates for total degree polynomial optimization on Chebyshev grids of the hypercube.

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

Access this article

Log in via an institution

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

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Baran, M., Bialas-Ciez, L.: Hölder continuity of the Green function and Markov brothers’ inequality. Constr. Approx. 40, 121–140 (2014)

    Article  MathSciNet  MATH  Google Scholar 

  2. Bos, L.: A simple recipe for modelling a \(d\)-cube by Lissajous curves. Dolomit. Res. Notes Approx. DRNA 10, 1–4 (2017)

    MathSciNet  MATH  Google Scholar 

  3. Bos, L., Calvi, J.-P., Levenberg, N., Sommariva, A., Vianello, M.: Geometric weakly admissible meshes, discrete least squares approximation and approximate Fekete points. Math. Comput. 80, 1601–1621 (2011)

    Article  MathSciNet  MATH  Google Scholar 

  4. Bos, L., Levenberg, N., Waldron, S.: Metrics associated to multivariate polynomial inequalities. In: Neamtu, M., Saff, E. (eds.) Advances in Constructive Approximation: Vanderbilt 2003, pp. 133–147. Nashboro Press, Brentwood (2004)

  5. Bos, L., Levenberg, N., Waldron, S.: Pseudometrics, distances and multivariate polynomial inequalities. J. Approx. Theory 153, 80–96 (2008)

    Article  MathSciNet  MATH  Google Scholar 

  6. Bos, L., Vianello, M.: Low cardinality admissible meshes on quadrangles, triangles and disks. Math. Inequal. Appl. 15, 229–235 (2012)

    MathSciNet  MATH  Google Scholar 

  7. Calvi, J.P., Levenberg, N.: Uniform approximation by discrete least squares polynomials. J. Approx. Theory 152, 82–100 (2008)

    Article  MathSciNet  MATH  Google Scholar 

  8. Coleman, T.F., Li, Y.: An interior trust region approach for nonlinear minimization subject to bounds. SIAM J. Optim. 6, 418–445 (1996)

    Article  MathSciNet  MATH  Google Scholar 

  9. de Klerk, E.: The complexity of optimizing over a simplex, hypercube or sphere: a short survey. CEJOR Cent. Eur. J. Oper. Res. 16, 111–125 (2008)

    Article  MathSciNet  MATH  Google Scholar 

  10. de Klerk, E., Lasserre, J.B., Laurent, M., Sun, Z.: Bound-constrained polynomial optimization using only elementary calculations. Math. Oper. Res. (2017) (published online on March 15, 2017)

  11. de Klerk, E., Laurent, M.: Error bounds for some semidefinite programming approaches to polynomial optimization on the hypercube. SIAM J. Optim. 20, 3104–3120 (2010)

    Article  MathSciNet  MATH  Google Scholar 

  12. de Klerk, E., Laurent, M., Sun, Z.: An error analysis for polynomial optimization over the simplex based on the multivariate hypergeometric distribution. SIAM J. Optim. 25, 1498–1514 (2015)

    Article  MathSciNet  MATH  Google Scholar 

  13. de Klerk, E., Laurent, M., Sun, Z., Vera, J.C.: On the convergence rate of grid search for polynomial optimization over the simplex. Optim. Lett. 11, 597–608 (2017)

    Article  MathSciNet  MATH  Google Scholar 

  14. Dubiner, M.: The theory of multidimensional polynomial approximation. J. Anal. Math. 67, 39–116 (1995)

    Article  MathSciNet  MATH  Google Scholar 

  15. Ehlich, H., Zeller, K.: Schwankung von polynomen zwischen Gitter punkten. Math. Z. 86, 41–44 (1964)

    Article  MathSciNet  MATH  Google Scholar 

  16. Gärtel, U.: Error estimations for second-order vector-valued boundary tasks, in particular for problems from chemical reaction diffusion theory, Ph.D. Thesis, University of Cologne, 1987 (in German)

  17. Hashemi, B., Trefethen, L.N.: Chebfun in three dimensions. SIAM J. Sci. Comput. (accepted for publication)

  18. Kroó, A.: On optimal polynomial meshes. J. Approx. Theory 163, 1107–1124 (2011)

    Article  MathSciNet  MATH  Google Scholar 

  19. Piazzon, F.: Optimal polynomial admissible meshes on some classes of compact subsets of \(\mathbb{R}^d\). J. Approx. Theory 207, 241–264 (2016)

    Article  MathSciNet  MATH  Google Scholar 

  20. Piazzon, F., Vianello, M.: Small perturbations of polynomial meshes. Appl. Anal. 92, 1063–1073 (2013)

    Article  MathSciNet  MATH  Google Scholar 

  21. Piazzon, F., Vianello, M.: Constructing optimal polynomial meshes on planar starlike domains. Dolomit. Res. Notes Approx. DRNA 7, 22–25 (2014)

    MATH  Google Scholar 

  22. Townsend, A., Trefethen, L.N.: An extension of Chebfun to two dimensions. SIAM J. Sci. Comput. 35, C495–C518 (2013)

    Article  MathSciNet  MATH  Google Scholar 

  23. Zhang, J.F., Kwong, C.P.: Some applications of a polynomial inequality to global optimization. J. Optim. Theory Appl. 127, 193–205 (2005)

    Article  MathSciNet  MATH  Google Scholar 

Download references

Acknowledgements

Work partially supported by the DOR funds and the biennial Projects CPDA143275 and BIRD163015 of the University of Padova, and by the GNCS-INdAM.

Author information

Authors and Affiliations

  1. Department of Mathematics, University of Padova, Padova, Italy

    Federico Piazzon & Marco Vianello

Authors
  1. Federico Piazzon
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Marco Vianello
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Marco Vianello.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Piazzon, F., Vianello, M. A note on total degree polynomial optimization by Chebyshev grids. Optim Lett 12, 63–71 (2018). https://doi.org/10.1007/s11590-017-1166-1

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11590-017-1166-1

Keywords

Search

Navigation