Hauptseite > Publikationsdatenbank > Witsenhausen’s Counterexample – A Refined Approach using Variational Analysis > print

001     1045815
005     20251104202045.0
024 7 _ |a 10.34734/FZJ-2025-03614
|2 datacite_doi
037 _ _ |a FZJ-2025-03614
041 _ _ |a English
100 1 _ |a Noffke, René
|0 P:(DE-Juel1)185771
|b 0
|e Corresponding author
245 _ _ |a Witsenhausen’s Counterexample – A Refined Approach using Variational Analysis
|f - 2025-08-29
260 _ _ |c 2025
300 _ _ |a 97 p.
336 7 _ |a Output Types/Supervised Student Publication
|2 DataCite
336 7 _ |a Thesis
|0 2
|2 EndNote
336 7 _ |a MASTERSTHESIS
|2 BibTeX
336 7 _ |a masterThesis
|2 DRIVER
336 7 _ |a Master Thesis
|b master
|m master
|0 PUB:(DE-HGF)19
|s 1762256207_16981
|2 PUB:(DE-HGF)
336 7 _ |a SUPERVISED_STUDENT_PUBLICATION
|2 ORCID
502 _ _ |a Masterarbeit, FH Aachen, 2025
|c FH Aachen
|b Masterarbeit
|d 2025
|o 2025-08-29
520 _ _ |a Witsenhausen’s counterexample is a well known problem from control theory illustrating, linear controllers are not always the best choice. Studies on theoretical and numerical results have been conducted for now more than 50 years and mathematicians are still searching for new attempts gaining better controllers for the problem. The performance of these controllers is compared on a benchmark based on the problem’s underlying cost functional. In this thesis first a new method to evaluate the named cost functional was developed. Hereby the method was built as it works adaptively, requiring only as much computing capacity as is necessary. Moreover, the method includes a discontinuity detection to handle step functions which are often used for Witsenhausen’s counterexample. Next, it was shown that Witsenhausen’s counterexample is a problem from variational analysis and a necessary criterion for optimality, based on the Euler-Lagrange, equation was derived. Based on this result, a basis function fulfilling the gained criterion was computed. In the first performed optimization step, the described basis functions were combined to gain an approximation for an optimal controller. The next optimization step was created based on the insights from previous papers indicating that adding a curve to each step improves the results. The result on the one hand was an evaluation method computing the cost for an analytically known result in less than a second for a precision of $10^{-8}$. Moreover, this method was able to determine the value up to a precision of $10^{-14}$. On the other hand, the optimization yielded the fourth best value known up to now, with an absolute difference of $3.159\cdotp 10^{-5}$ to the best known.
536 _ _ |a 5112 - Cross-Domain Algorithms, Tools, Methods Labs (ATMLs) and Research Groups (POF4-511)
|0 G:(DE-HGF)POF4-5112
|c POF4-511
|f POF IV
|x 0
856 4 _ |u https://juser.fz-juelich.de/record/1045815/files/master_final_unterschrieben.pdf
|y OpenAccess
909 C O |o oai:juser.fz-juelich.de:1045815
|p openaire
|p open_access
|p VDB
|p driver
|p dnbdelivery
910 1 _ |a Forschungszentrum Jülich
|0 I:(DE-588b)5008462-8
|k FZJ
|b 0
|6 P:(DE-Juel1)185771
913 1 _ |a DE-HGF
|b Key Technologies
|l Engineering Digital Futures – Supercomputing, Data Management and Information Security for Knowledge and Action
|1 G:(DE-HGF)POF4-510
|0 G:(DE-HGF)POF4-511
|3 G:(DE-HGF)POF4
|2 G:(DE-HGF)POF4-500
|4 G:(DE-HGF)POF
|v Enabling Computational- & Data-Intensive Science and Engineering
|9 G:(DE-HGF)POF4-5112
|x 0
914 1 _ |y 2025
915 _ _ |a OpenAccess
|0 StatID:(DE-HGF)0510
|2 StatID
920 _ _ |l yes
920 1 _ |0 I:(DE-Juel1)JSC-20090406
|k JSC
|l Jülich Supercomputing Center
|x 0
980 _ _ |a master
980 _ _ |a VDB
980 _ _ |a UNRESTRICTED
980 _ _ |a I:(DE-Juel1)JSC-20090406
980 1 _ |a FullTexts

LibraryCollectionCLSMajorCLSMinorLanguageAuthor
Marc 21