Identification of Linear Control Systems via Gradient Descent
| dc.contributor.advisor | Ramakrishna, Viswanath | |
| dc.contributor.advisor | Bensoussan , Alain | |
| dc.contributor.advisor | Rugg, Elizabeth | |
| dc.contributor.committeeMember | Dabkowski, Mieczyslaw K. | |
| dc.contributor.committeeMember | Choudhary, Pankaj K. | |
| dc.contributor.committeeMember | Dragovic, Vladimir | |
| dc.creator | Gelir, Fatih | |
| dc.date.accessioned | 2024-03-19T19:04:27Z | |
| dc.date.available | 2024-03-19T19:04:27Z | |
| dc.date.created | 2021-12 | |
| dc.date.issued | December 2021 | |
| dc.date.submitted | December 2021 | |
| dc.date.updated | 2024-03-19T19:04:27Z | |
| dc.description.abstract | In this dissertation we use gradient descent and its variations, in the spirit of machine learning to identify a linear control system. When the full state is observable, the most natural least square cost function is convex. However, when the state is partially observable, this is no longer the case. We propose two algorithms for later problem and show that the cost function decreases as the iteration proceeds. The simulations are provided to support that theoretical results. We also perform recursivity analysis when the amount of data increases. Finally we provide an asymptotic analysis when a certain natural parameter goes to infinity. | |
| dc.format.mimetype | application/pdf | |
| dc.identifier.uri | ||
| dc.identifier.uri | https://hdl.handle.net/10735.1/10070 | |
| dc.language.iso | en | |
| dc.subject | Mathematics | |
| dc.title | Identification of Linear Control Systems via Gradient Descent | |
| dc.type | Thesis | |
| dc.type.material | text | |
| local.embargo.lift | 2023-12-01 | |
| local.embargo.terms | 2023-12-01 | |
| thesis.degree.college | School of Natural Sciences and Mathematics | |
| thesis.degree.department | Mathematics | |
| thesis.degree.grantor | The University of Texas at Dallas | |
| thesis.degree.name | PHD |
Files
Original bundle
1 - 1 of 1