Optimization via Chebyshev polynomials
From MaRDI portal
Publication:1743371
Abstract: This paper presents for the first time a robust exact line-search method based on a full pseudospectral (PS) numerical scheme employing orthogonal polynomials. The proposed method takes on an adaptive search procedure and combines the superior accuracy of Chebyshev PS approximations with the high-order approximations obtained through Chebyshev PS differentiation matrices (CPSDMs). In addition, the method exhibits quadratic convergence rate by enforcing an adaptive Newton search iterative scheme. A rigorous error analysis of the proposed method is presented along with a detailed set of pseudocodes for the established computational algorithms. Several numerical experiments are conducted on one- and multi-dimensional optimization test problems to illustrate the advantages of the proposed strategy.
Recommendations
- An optimization of Chebyshev's method
- The Chebyshev hyperplane optimization problem
- scientific article; zbMATH DE number 475484
- A note on total degree polynomial optimization by Chebyshev grids
- Optimization of Polynomial Functions
- Polynomial optimization problems
- Polynomial optimization, sums of squares, and applications
- Optimization over trace polynomials
- Optimization over polynomials: selected topics
Cites work
- scientific article; zbMATH DE number 193036 (Why is no real title available?)
- scientific article; zbMATH DE number 3640828 (Why is no real title available?)
- scientific article; zbMATH DE number 2013850 (Why is no real title available?)
- scientific article; zbMATH DE number 1862742 (Why is no real title available?)
- scientific article; zbMATH DE number 5060482 (Why is no real title available?)
- scientific article; zbMATH DE number 3277020 (Why is no real title available?)
- A method for numerical integration on an automatic computer
- A new robust line search technique based on Chebyshev polynomials
- An introduction to optimization
- Fast, accurate, and small-scale direct trajectory optimization using a Gegenbauer transcription method
- From Electrostatics to Almost Optimal Nodal Sets for Polynomial Interpolation in a Simplex
- High-order numerical solution of second-order one-dimensional hyperbolic telegraph equation using a shifted Gegenbauer pseudospectral method
- Higher order pseudospectral differentiation matrices
- Implementing Spectral Methods for Partial Differential Equations
- Improving the accuracy of the matrix differentiation method for arbitrary collocation points
- On the computation of high order pseudospectral derivatives
- Optimal Gegenbauer quadrature over arbitrary integration nodes
- Roots of Polynomials Expressed in Terms of Orthogonal Polynomials
- Solving boundary value problems, integral, and integro-differential equations using Gegenbauer integration matrices
- Spectral Differencing with a Twist
- Zeros of linear combinations of orthogonal polynomials
Cited in
(5)- An optimization of Chebyshev's method
- Chebyshev optimization of circular arrays
- High-order Gegenbauer integral spectral element method integrated with an adaptive Chebyshev optimization strategy for solving linear singularly perturbed differential equations
- A new robust line search technique based on Chebyshev polynomials
- High-order integral nodal discontinuous Gegenbauer-Galerkin method for solving viscous Burgers' equation
This page was built for publication: Optimization via Chebyshev polynomials
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1743371)
