Tight Bounds on Polynomials and Its Application to Dynamic Optimization Problems
IEEE Transactions on Automatic Control · 2026-08 · 71 (8) · 5612-5619
DOI: 10.1109/tac.2026.3678437 ↗Kurz gefasst
Fachartikel in der Zeitschrift IEEE Transactions on Automatic Control, 2026-08. Verfasst von Eduardo M. G. Vila und 2 weiteren Autor:innen. Die Arbeit nennt 16 Literaturangaben. Gefördert von: Science and Technology Facilities Council.
Abstract (Originalsprache)
This article presents a pseudospectral method for dynamic optimization problems (DOPs) that allows for tight polynomial bounds to be achieved via flexible subintervals. The proposed method not only rigorously enforces inequality constraints, but also allows for a lower cost in comparison with nonflexible discretizations. Two examples are provided to demonstrate the feasibility of the proposed method to solve optimal control problems. Solutions to the example problems exhibited up to a tenfold reduction in relative cost.
Förderung
- Science and Technology Facilities Council
Zitieren
APA
Vila, E. M. G., Kerrigan, E. C., & Bruce, P. (2026). Tight Bounds on Polynomials and Its Application to Dynamic Optimization Problems. IEEE Transactions on Automatic Control, 71(8), 5612-5619. https://doi.org/10.1109/tac.2026.3678437
Vancouver
Vila EMG, Kerrigan EC, Bruce P. Tight Bounds on Polynomials and Its Application to Dynamic Optimization Problems. IEEE Transactions on Automatic Control. 2026;71(8):5612-5619. doi:10.1109/tac.2026.3678437
BibTeX
@article{Vila2026,
author = {Vila, Eduardo M. G. and Kerrigan, Eric C. and Bruce, Paul},
title = {Tight Bounds on Polynomials and Its Application to Dynamic Optimization Problems},
journal = {IEEE Transactions on Automatic Control},
year = {2026},
volume = {71},
number = {8},
pages = {5612--5619},
doi = {10.1109/tac.2026.3678437}
}
EUVIMED