On the regularization of classical optimality conditions in a convex optimal control problem with state constraints
From MaRDI portal
Publication:5012426
DOI10.20310/2686-9667-2020-25-131-263-273zbMath1477.49006OpenAlexW3093538275MaRDI QIDQ5012426
Publication date: 24 November 2021
Published in: Russian Universities Reports. Mathematics (Search for Journal in Brave)
Full work available at URL: http://mathnet.ru/eng/vtamu183
Convex programming (90C25) Existence theories for optimal control problems involving ordinary differential equations (49J15)
Cites Work
- Stable iterative Lagrange principle in convex programming as a tool for solving unstable problems
- Regularized parametric Kuhn-Tucker theorem in a Hilbert space
- Stable sequential convex programming in a Hilbert space and its application for solving unstable problems
- Duality-based regularization in a linear convex mathematical programming problem
- The regularized iterative Pontryagin maximum principle in optimal control. I. Optimization of a lumped system
- The regularized iterative Pontryagin maximum principle in optimal control. II. Optimization of a distributed system
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: On the regularization of classical optimality conditions in a convex optimal control problem with state constraints
