About One Sweep Algorithm for Solving Linear-Quadratic Optimization Problem with Unseparated Two-Point Boundary Conditions
Journal: Sahand Communications in Mathematical Analysis (Vol.17, No. 1)Publication Date: 2020-01-01
Authors : Fikret A. Aliev; Mutallim M. Mutallimov; Ilkin A. Maharramov; Nargiz Sh. Huseynova; Leyla I. Amirova;
Page : 99-107
Keywords : Sweep Algorithm; Optimization; unseparated two-point boundary conditions; Riccati equations;
Abstract
In the paper a linear-quadratic optimization problem (LCTOR) with unseparated two-point boundary conditions is considered. To solve this problem is proposed a new sweep algorithm which increases doubles the dimension of the original system. In contrast to the well-known methods, here it refuses to solve linear matrix and nonlinear Riccati equations, since the solution of such multi-point optimization problems encounters serious difficulties in passing through nodal points. The results are illustrated with a specific numerical example.
Other Latest Articles
- A Common Fixed Point Theorem Using an Iterative Method
- On Approximate Solutions of the Generalized Radical Cubic Functional Equation in Quasi-$beta$-Banach Spaces
- On $F$-Weak Contraction of Generalized Multivalued Integral Type Mappings with $alpha $-admissible
- Continuous $k$-Fusion Frames in Hilbert Spaces
- A Version of Favard's Inequality for the Sugeno Integral
Last modified: 2020-06-16 17:02:43