Euler appoximation of the feasible set
- 1 January 1994
- journal article
- research article
- Published by Taylor & Francis in Numerical Functional Analysis and Optimization
- Vol. 15 (3-4) , 245-261
- https://doi.org/10.1080/01630569408816564
Abstract
We estimate the distance between solutions of a boundary value problem with a control and of its discrete approximation provided by the Euler scheme. Our analysis is based on an abstract inverse-mapping-type theorem for sequences of set-valued maps. As an application we obtain an estimate of the discretization error for the cost functional in optimal control.Keywords
This publication has 10 references indexed in Scilit:
- Well-Posed Optimization ProblemsLecture Notes in Mathematics, 1993
- Difference Methods for Differential Inclusions: A SurveySIAM Review, 1992
- Metric regularity, openness and Lipschitzian behavior of multifunctionsNonlinear Analysis, 1989
- Stability and regular points of inequality systemsJournal of Optimization Theory and Applications, 1986
- Lipschitzian properties of multifunctionsNonlinear Analysis, 1985
- Lipschitz Behavior of Solutions to Convex Minimization ProblemsMathematics of Operations Research, 1984
- On difference approximations of optimal control systems: PMM vol. 42, n≗ 3, 1978, pp. 43–440Journal of Applied Mathematics and Mechanics, 1978
- Stability Theory for Systems of Inequalities, Part II: Differentiable Nonlinear SystemsSIAM Journal on Numerical Analysis, 1976
- Multifunctions with convex closed graphCzechoslovak Mathematical Journal, 1975
- Finite-Dimensional Approximations of State-Constrained Continuous Optimal Control ProblemsSIAM Journal on Control, 1972