001045815 001__ 1045815
001045815 005__ 20251104202045.0
001045815 0247_ $$2datacite_doi$$a10.34734/FZJ-2025-03614
001045815 037__ $$aFZJ-2025-03614
001045815 041__ $$aEnglish
001045815 1001_ $$0P:(DE-Juel1)185771$$aNoffke, René$$b0$$eCorresponding author
001045815 245__ $$aWitsenhausen’s Counterexample – A Refined Approach using Variational Analysis$$f - 2025-08-29
001045815 260__ $$c2025
001045815 300__ $$a97 p.
001045815 3367_ $$2DataCite$$aOutput Types/Supervised Student Publication
001045815 3367_ $$02$$2EndNote$$aThesis
001045815 3367_ $$2BibTeX$$aMASTERSTHESIS
001045815 3367_ $$2DRIVER$$amasterThesis
001045815 3367_ $$0PUB:(DE-HGF)19$$2PUB:(DE-HGF)$$aMaster Thesis$$bmaster$$mmaster$$s1762256207_16981
001045815 3367_ $$2ORCID$$aSUPERVISED_STUDENT_PUBLICATION
001045815 502__ $$aMasterarbeit, FH Aachen, 2025$$bMasterarbeit$$cFH Aachen$$d2025$$o2025-08-29
001045815 520__ $$aWitsenhausen’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.
001045815 536__ $$0G:(DE-HGF)POF4-5112$$a5112 - Cross-Domain Algorithms, Tools, Methods Labs (ATMLs) and Research Groups (POF4-511)$$cPOF4-511$$fPOF IV$$x0
001045815 8564_ $$uhttps://juser.fz-juelich.de/record/1045815/files/master_final_unterschrieben.pdf$$yOpenAccess
001045815 909CO $$ooai:juser.fz-juelich.de:1045815$$popenaire$$popen_access$$pVDB$$pdriver$$pdnbdelivery
001045815 9101_ $$0I:(DE-588b)5008462-8$$6P:(DE-Juel1)185771$$aForschungszentrum Jülich$$b0$$kFZJ
001045815 9131_ $$0G:(DE-HGF)POF4-511$$1G:(DE-HGF)POF4-510$$2G:(DE-HGF)POF4-500$$3G:(DE-HGF)POF4$$4G:(DE-HGF)POF$$9G:(DE-HGF)POF4-5112$$aDE-HGF$$bKey Technologies$$lEngineering Digital Futures – Supercomputing, Data Management and Information Security for Knowledge and Action$$vEnabling Computational- & Data-Intensive Science and Engineering$$x0
001045815 9141_ $$y2025
001045815 915__ $$0StatID:(DE-HGF)0510$$2StatID$$aOpenAccess
001045815 920__ $$lyes
001045815 9201_ $$0I:(DE-Juel1)JSC-20090406$$kJSC$$lJülich Supercomputing Center$$x0
001045815 980__ $$amaster
001045815 980__ $$aVDB
001045815 980__ $$aUNRESTRICTED
001045815 980__ $$aI:(DE-Juel1)JSC-20090406
001045815 9801_ $$aFullTexts