A Taylor-Bernstein inner approximation algorithm for path-constrained dynamic optimization

DOI10.1016/J.CAM.2026.118140MaRDI QIDQ7363608zbMATH OpenFDO

Authors Yuan Chang, L. Z. Jiang, Tai-Fang Li, Jun Fu

Publication date 30 September 2026

Published in Journal of Computational and Applied Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/J.CAM.2026.118140

Mathematics Subject Classification ID

Numerical analysis (65-XX) Operations research, mathematical programming (90-XX)

Cites work

• \(\alpha BB\): A global optimization method for general constrained nonconvex problems
• A Novel Penalty Approach for Nonlinear Dynamic Optimization Problems With Inequality Path Constraints
• A unified framework for the numerical solution of optimal control problems using pseudospectral methods
• Accurately computing the log-sum-exp and softmax functions
• An algorithm for global optimization using the Taylor-Bernstein form as inclusion function
• An exact penalty function method for continuous inequality constrained optimal control problem
• An inner approximation algorithm for dynamic optimization with strict satisfaction of path constraints
• Bernstein polynomial for solving third kind VIEs with nonlinear vanishing delays
• Bounds for the range of a complex polynomial over a rectangular region
• Computation and application of Taylor polynomials with interval remainder bounds
• Dynamic optimization of nonlinear systems with guaranteed feasibility of inequality-path-constraints
• Dynamic optimization of state-dependent switched systems with free switching sequences
• Higher order convergence for multidimensional functions with a new Taylor-Bernstein form as inclusion function
• scientific article; zbMATH DE number 880287 (Why is no real title available?)
• Interval approximation of higher order to the ranges of functions
• Introduction to Interval Analysis
• Lipschitz gradients for global optimization in a one-point-based partitioning scheme
• Local optimization of dynamic programs with guaranteed satisfaction of path constraints
• Numerical technique based on Bernstein polynomials approach for solving auto-convolution VIEs and the initial value problem of auto-convolution VIDEs
• On Taylor Model Based Integration of ODEs
• Optimal control problems with a continuous inequality constraint on the state and the control
• Semi-infinite programming, duality, discretization and optimality conditions†
• The control parameterization method for nonlinear optimal control: a survey

This page was built for publication: A Taylor-Bernstein inner approximation algorithm for path-constrained dynamic optimization

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7363608)