[{"publication":"Discrete Applied Mathematics","type":"journal_article","keyword":["Applied Mathematics","Discrete Mathematics and Combinatorics"],"department":[{"_id":"542"}],"date_created":"2022-10-28T06:51:31Z","publication_status":"published","date_updated":"2023-05-16T10:36:51Z","intvolume":"       322","title":"Frustration-critical signed graphs","year":"2022","publication_identifier":{"issn":["0166-218X"]},"author":[{"full_name":"Cappello, Chiara","first_name":"Chiara","last_name":"Cappello","id":"72874"},{"id":"15548","full_name":"Steffen, Eckhard","last_name":"Steffen","first_name":"Eckhard","orcid":"0000-0002-9808-7401"}],"doi":"10.1016/j.dam.2022.08.010","language":[{"iso":"eng"}],"citation":{"apa":"Cappello, C., &#38; Steffen, E. (2022). Frustration-critical signed graphs. <i>Discrete Applied Mathematics</i>, <i>322</i>, 183–193. <a href=\"https://doi.org/10.1016/j.dam.2022.08.010\">https://doi.org/10.1016/j.dam.2022.08.010</a>","ieee":"C. Cappello and E. Steffen, “Frustration-critical signed graphs,” <i>Discrete Applied Mathematics</i>, vol. 322, pp. 183–193, 2022, doi: <a href=\"https://doi.org/10.1016/j.dam.2022.08.010\">10.1016/j.dam.2022.08.010</a>.","chicago":"Cappello, Chiara, and Eckhard Steffen. “Frustration-Critical Signed Graphs.” <i>Discrete Applied Mathematics</i> 322 (2022): 183–93. <a href=\"https://doi.org/10.1016/j.dam.2022.08.010\">https://doi.org/10.1016/j.dam.2022.08.010</a>.","short":"C. Cappello, E. Steffen, Discrete Applied Mathematics 322 (2022) 183–193.","mla":"Cappello, Chiara, and Eckhard Steffen. “Frustration-Critical Signed Graphs.” <i>Discrete Applied Mathematics</i>, vol. 322, Elsevier BV, 2022, pp. 183–93, doi:<a href=\"https://doi.org/10.1016/j.dam.2022.08.010\">10.1016/j.dam.2022.08.010</a>.","ama":"Cappello C, Steffen E. Frustration-critical signed graphs. <i>Discrete Applied Mathematics</i>. 2022;322:183-193. doi:<a href=\"https://doi.org/10.1016/j.dam.2022.08.010\">10.1016/j.dam.2022.08.010</a>","bibtex":"@article{Cappello_Steffen_2022, title={Frustration-critical signed graphs}, volume={322}, DOI={<a href=\"https://doi.org/10.1016/j.dam.2022.08.010\">10.1016/j.dam.2022.08.010</a>}, journal={Discrete Applied Mathematics}, publisher={Elsevier BV}, author={Cappello, Chiara and Steffen, Eckhard}, year={2022}, pages={183–193} }"},"external_id":{"arxiv":["2112.02664"]},"status":"public","user_id":"15540","volume":322,"page":"183-193","_id":"33950","publisher":"Elsevier BV"},{"citation":{"ieee":"M. Kirschmer and G. Nebe, “Binary Hermitian Lattices over Number Fields,” <i>Experimental Mathematics</i>, vol. 31, no. 1, pp. 280–301, 2022, doi: <a href=\"https://doi.org/10.1080/10586458.2019.1618756\">10.1080/10586458.2019.1618756</a>.","apa":"Kirschmer, M., &#38; Nebe, G. (2022). Binary Hermitian Lattices over Number Fields. <i>Experimental Mathematics</i>, <i>31</i>(1), 280–301. <a href=\"https://doi.org/10.1080/10586458.2019.1618756\">https://doi.org/10.1080/10586458.2019.1618756</a>","chicago":"Kirschmer, Markus, and Gabriele Nebe. “Binary Hermitian Lattices over Number Fields.” <i>Experimental Mathematics</i> 31, no. 1 (2022): 280–301. <a href=\"https://doi.org/10.1080/10586458.2019.1618756\">https://doi.org/10.1080/10586458.2019.1618756</a>.","short":"M. Kirschmer, G. Nebe, Experimental Mathematics 31 (2022) 280–301.","mla":"Kirschmer, Markus, and Gabriele Nebe. “Binary Hermitian Lattices over Number Fields.” <i>Experimental Mathematics</i>, vol. 31, no. 1, Informa UK Limited, 2022, pp. 280–301, doi:<a href=\"https://doi.org/10.1080/10586458.2019.1618756\">10.1080/10586458.2019.1618756</a>.","bibtex":"@article{Kirschmer_Nebe_2022, title={Binary Hermitian Lattices over Number Fields}, volume={31}, DOI={<a href=\"https://doi.org/10.1080/10586458.2019.1618756\">10.1080/10586458.2019.1618756</a>}, number={1}, journal={Experimental Mathematics}, publisher={Informa UK Limited}, author={Kirschmer, Markus and Nebe, Gabriele}, year={2022}, pages={280–301} }","ama":"Kirschmer M, Nebe G. Binary Hermitian Lattices over Number Fields. <i>Experimental Mathematics</i>. 2022;31(1):280-301. doi:<a href=\"https://doi.org/10.1080/10586458.2019.1618756\">10.1080/10586458.2019.1618756</a>"},"page":"280-301","publisher":"Informa UK Limited","_id":"45854","user_id":"93826","volume":31,"status":"public","date_created":"2023-07-04T08:28:04Z","keyword":["General Mathematics"],"type":"journal_article","department":[{"_id":"102"}],"publication":"Experimental Mathematics","issue":"1","abstract":[{"lang":"eng","text":"In a previous paper the authors developed an algorithm to classify certain quaternary quadratic lattices over totally real fields. The present article applies this algorithm to the classification of binary Hermitian lattices over totally imaginary fields. We use it in particular to classify the 48-dimensional extremal even unimodular lattices over the integers that admit a semilarge automorphism."}],"language":[{"iso":"eng"}],"doi":"10.1080/10586458.2019.1618756","year":"2022","title":"Binary Hermitian Lattices over Number Fields","publication_identifier":{"issn":["1058-6458","1944-950X"]},"author":[{"full_name":"Kirschmer, Markus","first_name":"Markus","last_name":"Kirschmer","id":"82258"},{"first_name":"Gabriele","last_name":"Nebe","full_name":"Nebe, Gabriele"}],"publication_status":"published","date_updated":"2023-07-04T08:29:22Z","intvolume":"        31"},{"status":"public","has_accepted_license":"1","page":"447 - 471","_id":"19941","publisher":"AIMS","ddc":["510"],"user_id":"85279","volume":14,"file_date_updated":"2022-06-13T09:11:38Z","citation":{"ieee":"R. I. McLachlan and C. Offen, “Backward error analysis for variational discretisations of partial  differential equations,” <i>Journal of Geometric Mechanics</i>, vol. 14, no. 3, pp. 447–471, 2022, doi: <a href=\"https://doi.org/10.3934/jgm.2022014\">10.3934/jgm.2022014</a>.","apa":"McLachlan, R. I., &#38; Offen, C. (2022). Backward error analysis for variational discretisations of partial  differential equations. <i>Journal of Geometric Mechanics</i>, <i>14</i>(3), 447–471. <a href=\"https://doi.org/10.3934/jgm.2022014\">https://doi.org/10.3934/jgm.2022014</a>","chicago":"McLachlan, Robert I, and Christian Offen. “Backward Error Analysis for Variational Discretisations of Partial  Differential Equations.” <i>Journal of Geometric Mechanics</i> 14, no. 3 (2022): 447–71. <a href=\"https://doi.org/10.3934/jgm.2022014\">https://doi.org/10.3934/jgm.2022014</a>.","short":"R.I. McLachlan, C. Offen, Journal of Geometric Mechanics 14 (2022) 447–471.","mla":"McLachlan, Robert I., and Christian Offen. “Backward Error Analysis for Variational Discretisations of Partial  Differential Equations.” <i>Journal of Geometric Mechanics</i>, vol. 14, no. 3, AIMS, 2022, pp. 447–71, doi:<a href=\"https://doi.org/10.3934/jgm.2022014\">10.3934/jgm.2022014</a>.","bibtex":"@article{McLachlan_Offen_2022, title={Backward error analysis for variational discretisations of partial  differential equations}, volume={14}, DOI={<a href=\"https://doi.org/10.3934/jgm.2022014\">10.3934/jgm.2022014</a>}, number={3}, journal={Journal of Geometric Mechanics}, publisher={AIMS}, author={McLachlan, Robert I and Offen, Christian}, year={2022}, pages={447–471} }","ama":"McLachlan RI, Offen C. Backward error analysis for variational discretisations of partial  differential equations. <i>Journal of Geometric Mechanics</i>. 2022;14(3):447-471. doi:<a href=\"https://doi.org/10.3934/jgm.2022014\">10.3934/jgm.2022014</a>"},"external_id":{"arxiv":["2006.14172"]},"oa":"1","title":"Backward error analysis for variational discretisations of partial  differential equations","year":"2022","author":[{"last_name":"McLachlan","first_name":"Robert I","full_name":"McLachlan, Robert I"},{"id":"85279","first_name":"Christian","last_name":"Offen","orcid":"https://orcid.org/0000-0002-5940-8057","full_name":"Offen, Christian"}],"date_updated":"2023-08-10T08:44:55Z","publication_status":"published","intvolume":"        14","article_type":"original","language":[{"iso":"eng"}],"doi":"10.3934/jgm.2022014","issue":"3","publication":"Journal of Geometric Mechanics","related_material":{"link":[{"url":"https://github.com/Christian-Offen/multisymplectic","relation":"software"}]},"abstract":[{"text":"In backward error analysis, an approximate solution to an equation is compared to the exact solution to a nearby ‘modified’ equation. In numerical ordinary differential equations, the two agree up to any power of the step size. If the differential equation has a geometric property then the modified equation may share it. In this way, known properties of differential equations can be applied to the approximation. But for partial differential equations, the known modified equations are of higher order, limiting applicability of the theory. Therefore, we study symmetric solutions of discretized\r\npartial differential equations that arise from a discrete variational principle. These symmetric solutions obey infinite-dimensional functional equations. We show that these equations admit second-order modified equations which are Hamiltonian and also possess first-order Lagrangians in modified coordinates. The modified equation and its associated structures are computed explicitly for the case of rotating travelling waves in the nonlinear wave equation.","lang":"eng"}],"file":[{"date_created":"2022-06-13T09:11:38Z","description":"In backward error analysis, an approximate solution to an equa-\ntion is compared to the exact solution to a nearby ‘modified’ equation. In\nnumerical ordinary differential equations, the two agree up to any power of\nthe step size. If the differential equation has a geometric property then the\nmodified equation may share it. In this way, known properties of differential\nequations can be applied to the approximation. But for partial differential\nequations, the known modified equations are of higher order, limiting appli-\ncability of the theory. Therefore, we study symmetric solutions of discretized\npartial differential equations that arise from a discrete variational principle.\nThese symmetric solutions obey infinite-dimensional functional equations. We\nshow that these equations admit second-order modified equations which are\nHamiltonian and also possess first-order Lagrangians in modified coordinates.\nThe modified equation and its associated structures are computed explicitly\nfor the case of rotating travelling waves in the nonlinear wave equation.","creator":"coffen","file_id":"31859","content_type":"application/pdf","title":"Backward error analysis for variational discretisations of PDEs","file_name":"2_BlendedBEASymmPDE.pdf","access_level":"open_access","file_size":1507248,"relation":"main_file","date_updated":"2022-06-13T09:11:38Z"}],"date_created":"2020-10-06T16:33:19Z","type":"journal_article","department":[{"_id":"636"}]},{"status":"public","has_accepted_license":"1","publisher":"AIP","_id":"23382","volume":"32(1)","user_id":"85279","ddc":["510"],"citation":{"chicago":"Offen, Christian, and Sina Ober-Blöbaum. “Symplectic Integration of Learned Hamiltonian Systems.” <i>Chaos: An Interdisciplinary Journal of Nonlinear Science</i> 32(1) (2022). <a href=\"https://doi.org/10.1063/5.0065913\">https://doi.org/10.1063/5.0065913</a>.","short":"C. Offen, S. Ober-Blöbaum, Chaos: An Interdisciplinary Journal of Nonlinear Science 32(1) (2022).","ama":"Offen C, Ober-Blöbaum S. Symplectic integration of learned Hamiltonian systems. <i>Chaos: An Interdisciplinary Journal of Nonlinear Science</i>. 2022;32(1). doi:<a href=\"https://doi.org/10.1063/5.0065913\">10.1063/5.0065913</a>","bibtex":"@article{Offen_Ober-Blöbaum_2022, title={Symplectic integration of learned Hamiltonian systems}, volume={32(1)}, DOI={<a href=\"https://doi.org/10.1063/5.0065913\">10.1063/5.0065913</a>}, journal={Chaos: An Interdisciplinary Journal of Nonlinear Science}, publisher={AIP}, author={Offen, Christian and Ober-Blöbaum, Sina}, year={2022} }","mla":"Offen, Christian, and Sina Ober-Blöbaum. “Symplectic Integration of Learned Hamiltonian Systems.” <i>Chaos: An Interdisciplinary Journal of Nonlinear Science</i>, vol. 32(1), AIP, 2022, doi:<a href=\"https://doi.org/10.1063/5.0065913\">10.1063/5.0065913</a>.","apa":"Offen, C., &#38; Ober-Blöbaum, S. (2022). Symplectic integration of learned Hamiltonian systems. <i>Chaos: An Interdisciplinary Journal of Nonlinear Science</i>, <i>32(1)</i>. <a href=\"https://doi.org/10.1063/5.0065913\">https://doi.org/10.1063/5.0065913</a>","ieee":"C. Offen and S. Ober-Blöbaum, “Symplectic integration of learned Hamiltonian systems,” <i>Chaos: An Interdisciplinary Journal of Nonlinear Science</i>, vol. 32(1), 2022, doi: <a href=\"https://doi.org/10.1063/5.0065913\">10.1063/5.0065913</a>."},"file_date_updated":"2021-12-13T14:56:15Z","quality_controlled":"1","external_id":{"arxiv":["2108.02492"]},"oa":"1","author":[{"id":"85279","first_name":"Christian","orcid":"0000-0002-5940-8057","last_name":"Offen","full_name":"Offen, Christian"},{"full_name":"Ober-Blöbaum, Sina","first_name":"Sina","last_name":"Ober-Blöbaum","id":"16494"}],"year":"2022","title":"Symplectic integration of learned Hamiltonian systems","article_type":"original","publication_status":"published","date_updated":"2023-08-10T08:48:14Z","language":[{"iso":"eng"}],"main_file_link":[{"open_access":"1","url":"https://aip.scitation.org/doi/abs/10.1063/5.0065913"}],"doi":"10.1063/5.0065913","publication":"Chaos: An Interdisciplinary Journal of Nonlinear Science","related_material":{"link":[{"relation":"software","url":"https://github.com/Christian-Offen/symplectic-shadow-integration","description":"GitHub"}]},"abstract":[{"text":"Hamiltonian systems are differential equations which describe systems in classical mechanics, plasma physics, and sampling problems. They exhibit many structural properties, such as a lack of attractors and the presence of conservation laws. To predict Hamiltonian dynamics based on discrete trajectory observations, incorporation of prior knowledge about Hamiltonian structure greatly improves predictions. This is typically done by learning the system's Hamiltonian and then integrating the Hamiltonian vector field with a symplectic integrator. For this, however, Hamiltonian data needs to be approximated based on the trajectory observations. Moreover, the numerical integrator introduces an additional discretisation error. In this paper, we show that an inverse modified Hamiltonian structure adapted to the geometric integrator can be learned directly from observations. A separate approximation step for the Hamiltonian data avoided. The inverse modified data compensates for the discretisation error such that the discretisation error is eliminated. The technique is developed for Gaussian Processes.","lang":"eng"}],"date_created":"2021-08-11T08:24:02Z","file":[{"date_created":"2021-12-13T14:56:15Z","creator":"coffen","file_id":"28734","content_type":"application/pdf","file_name":"SymplecticShadowIntegration_AIP.pdf","access_level":"open_access","file_size":2285059,"relation":"main_file","date_updated":"2021-12-13T14:56:15Z"}],"department":[{"_id":"636"}],"type":"journal_article"},{"doi":"10.1016/j.physd.2021.133018","user_id":"81513","_id":"24169","language":[{"iso":"eng"}],"article_number":"133018","date_updated":"2022-01-06T06:56:08Z","publication_status":"published","author":[{"id":"81513","first_name":"Feliks","last_name":"Nüske","orcid":"0000-0003-2444-7889","full_name":"Nüske, Feliks"},{"full_name":"Gelß, Patrick","first_name":"Patrick","last_name":"Gelß"},{"first_name":"Stefan","last_name":"Klus","full_name":"Klus, Stefan"},{"last_name":"Clementi","first_name":"Cecilia","full_name":"Clementi, Cecilia"}],"publication_identifier":{"issn":["0167-2789"]},"title":"Tensor-based computation of metastable and coherent sets","status":"public","year":"2021","department":[{"_id":"101"}],"type":"journal_article","date_created":"2021-09-12T08:51:24Z","citation":{"mla":"Nüske, Feliks, et al. “Tensor-Based Computation of Metastable and Coherent Sets.” <i>Physica D: Nonlinear Phenomena</i>, 133018, 2021, doi:<a href=\"https://doi.org/10.1016/j.physd.2021.133018\">10.1016/j.physd.2021.133018</a>.","ama":"Nüske F, Gelß P, Klus S, Clementi C. Tensor-based computation of metastable and coherent sets. <i>Physica D: Nonlinear Phenomena</i>. Published online 2021. doi:<a href=\"https://doi.org/10.1016/j.physd.2021.133018\">10.1016/j.physd.2021.133018</a>","bibtex":"@article{Nüske_Gelß_Klus_Clementi_2021, title={Tensor-based computation of metastable and coherent sets}, DOI={<a href=\"https://doi.org/10.1016/j.physd.2021.133018\">10.1016/j.physd.2021.133018</a>}, number={133018}, journal={Physica D: Nonlinear Phenomena}, author={Nüske, Feliks and Gelß, Patrick and Klus, Stefan and Clementi, Cecilia}, year={2021} }","apa":"Nüske, F., Gelß, P., Klus, S., &#38; Clementi, C. (2021). Tensor-based computation of metastable and coherent sets. <i>Physica D: Nonlinear Phenomena</i>, Article 133018. <a href=\"https://doi.org/10.1016/j.physd.2021.133018\">https://doi.org/10.1016/j.physd.2021.133018</a>","ieee":"F. Nüske, P. Gelß, S. Klus, and C. Clementi, “Tensor-based computation of metastable and coherent sets,” <i>Physica D: Nonlinear Phenomena</i>, Art. no. 133018, 2021, doi: <a href=\"https://doi.org/10.1016/j.physd.2021.133018\">10.1016/j.physd.2021.133018</a>.","short":"F. Nüske, P. Gelß, S. Klus, C. Clementi, Physica D: Nonlinear Phenomena (2021).","chicago":"Nüske, Feliks, Patrick Gelß, Stefan Klus, and Cecilia Clementi. “Tensor-Based Computation of Metastable and Coherent Sets.” <i>Physica D: Nonlinear Phenomena</i>, 2021. <a href=\"https://doi.org/10.1016/j.physd.2021.133018\">https://doi.org/10.1016/j.physd.2021.133018</a>."},"publication":"Physica D: Nonlinear Phenomena"},{"publication":"Machine Learning: Science and Technology","citation":{"mla":"Klus, Stefan, et al. “Symmetric and Antisymmetric Kernels for Machine Learning Problems in Quantum Physics and Chemistry.” <i>Machine Learning: Science and Technology</i>, 045016, 2021, doi:<a href=\"https://doi.org/10.1088/2632-2153/ac14ad\">10.1088/2632-2153/ac14ad</a>.","bibtex":"@article{Klus_Gelß_Nüske_Noé_2021, title={Symmetric and antisymmetric kernels for machine learning problems in quantum physics and chemistry}, DOI={<a href=\"https://doi.org/10.1088/2632-2153/ac14ad\">10.1088/2632-2153/ac14ad</a>}, number={045016}, journal={Machine Learning: Science and Technology}, author={Klus, Stefan and Gelß, Patrick and Nüske, Feliks and Noé, Frank}, year={2021} }","ama":"Klus S, Gelß P, Nüske F, Noé F. Symmetric and antisymmetric kernels for machine learning problems in quantum physics and chemistry. <i>Machine Learning: Science and Technology</i>. Published online 2021. doi:<a href=\"https://doi.org/10.1088/2632-2153/ac14ad\">10.1088/2632-2153/ac14ad</a>","ieee":"S. Klus, P. Gelß, F. Nüske, and F. Noé, “Symmetric and antisymmetric kernels for machine learning problems in quantum physics and chemistry,” <i>Machine Learning: Science and Technology</i>, Art. no. 045016, 2021, doi: <a href=\"https://doi.org/10.1088/2632-2153/ac14ad\">10.1088/2632-2153/ac14ad</a>.","apa":"Klus, S., Gelß, P., Nüske, F., &#38; Noé, F. (2021). Symmetric and antisymmetric kernels for machine learning problems in quantum physics and chemistry. <i>Machine Learning: Science and Technology</i>, Article 045016. <a href=\"https://doi.org/10.1088/2632-2153/ac14ad\">https://doi.org/10.1088/2632-2153/ac14ad</a>","chicago":"Klus, Stefan, Patrick Gelß, Feliks Nüske, and Frank Noé. “Symmetric and Antisymmetric Kernels for Machine Learning Problems in Quantum Physics and Chemistry.” <i>Machine Learning: Science and Technology</i>, 2021. <a href=\"https://doi.org/10.1088/2632-2153/ac14ad\">https://doi.org/10.1088/2632-2153/ac14ad</a>.","short":"S. Klus, P. Gelß, F. Nüske, F. Noé, Machine Learning: Science and Technology (2021)."},"type":"journal_article","department":[{"_id":"101"}],"date_created":"2021-09-12T08:52:57Z","publication_status":"published","date_updated":"2022-01-06T06:56:08Z","title":"Symmetric and antisymmetric kernels for machine learning problems in quantum physics and chemistry","year":"2021","status":"public","author":[{"full_name":"Klus, Stefan","first_name":"Stefan","last_name":"Klus"},{"last_name":"Gelß","first_name":"Patrick","full_name":"Gelß, Patrick"},{"first_name":"Feliks","last_name":"Nüske","orcid":"0000-0003-2444-7889","full_name":"Nüske, Feliks","id":"81513"},{"full_name":"Noé, Frank","first_name":"Frank","last_name":"Noé"}],"publication_identifier":{"issn":["2632-2153"]},"user_id":"81513","doi":"10.1088/2632-2153/ac14ad","article_number":"045016","language":[{"iso":"eng"}],"_id":"24170"},{"year":"2021","title":"Electrophysiological signatures of dedifferentiation differ between fit and less fit older adults","status":"public","author":[{"full_name":"Goelz, Christian","first_name":"Christian","last_name":"Goelz"},{"full_name":"Mora, Karin","last_name":"Mora","first_name":"Karin"},{"full_name":"Stroehlein, Julia Kristin","first_name":"Julia Kristin","last_name":"Stroehlein"},{"full_name":"Haase, Franziska Katharina","last_name":"Haase","first_name":"Franziska Katharina"},{"full_name":"Dellnitz, Michael","last_name":"Dellnitz","first_name":"Michael"},{"first_name":"Claus","last_name":"Reinsberger","full_name":"Reinsberger, Claus"},{"full_name":"Vieluf, Solveig","last_name":"Vieluf","first_name":"Solveig"}],"date_updated":"2022-01-06T06:54:49Z","main_file_link":[{"url":"https://link.springer.com/content/pdf/10.1007/s11571-020-09656-9.pdf"}],"language":[{"iso":"eng"}],"_id":"21195","doi":"10.1007/s11571-020-09656-9","user_id":"32643","publication":"Cognitive Neurodynamics","citation":{"chicago":"Goelz, Christian, Karin Mora, Julia Kristin Stroehlein, Franziska Katharina Haase, Michael Dellnitz, Claus Reinsberger, and Solveig Vieluf. “Electrophysiological Signatures of Dedifferentiation Differ between Fit and Less Fit Older Adults.” <i>Cognitive Neurodynamics</i>, 2021. <a href=\"https://doi.org/10.1007/s11571-020-09656-9\">https://doi.org/10.1007/s11571-020-09656-9</a>.","short":"C. Goelz, K. Mora, J.K. Stroehlein, F.K. Haase, M. Dellnitz, C. Reinsberger, S. Vieluf, Cognitive Neurodynamics (2021).","apa":"Goelz, C., Mora, K., Stroehlein, J. K., Haase, F. K., Dellnitz, M., Reinsberger, C., &#38; Vieluf, S. (2021). Electrophysiological signatures of dedifferentiation differ between fit and less fit older adults. <i>Cognitive Neurodynamics</i>. <a href=\"https://doi.org/10.1007/s11571-020-09656-9\">https://doi.org/10.1007/s11571-020-09656-9</a>","ieee":"C. Goelz <i>et al.</i>, “Electrophysiological signatures of dedifferentiation differ between fit and less fit older adults,” <i>Cognitive Neurodynamics</i>, 2021.","ama":"Goelz C, Mora K, Stroehlein JK, et al. Electrophysiological signatures of dedifferentiation differ between fit and less fit older adults. <i>Cognitive Neurodynamics</i>. 2021. doi:<a href=\"https://doi.org/10.1007/s11571-020-09656-9\">10.1007/s11571-020-09656-9</a>","bibtex":"@article{Goelz_Mora_Stroehlein_Haase_Dellnitz_Reinsberger_Vieluf_2021, title={Electrophysiological signatures of dedifferentiation differ between fit and less fit older adults}, DOI={<a href=\"https://doi.org/10.1007/s11571-020-09656-9\">10.1007/s11571-020-09656-9</a>}, journal={Cognitive Neurodynamics}, author={Goelz, Christian and Mora, Karin and Stroehlein, Julia Kristin and Haase, Franziska Katharina and Dellnitz, Michael and Reinsberger, Claus and Vieluf, Solveig}, year={2021} }","mla":"Goelz, Christian, et al. “Electrophysiological Signatures of Dedifferentiation Differ between Fit and Less Fit Older Adults.” <i>Cognitive Neurodynamics</i>, 2021, doi:<a href=\"https://doi.org/10.1007/s11571-020-09656-9\">10.1007/s11571-020-09656-9</a>."},"date_created":"2021-02-08T13:16:07Z","type":"journal_article","department":[{"_id":"101"}]},{"publication_status":"published","date_updated":"2022-01-06T06:54:55Z","intvolume":"        26","title":"Derivative-Free Multiobjective Trust Region Descent Method Using Radial  Basis Function Surrogate Models","year":"2021","author":[{"id":"51701","full_name":"Berkemeier, Manuel Bastian","first_name":"Manuel Bastian","last_name":"Berkemeier"},{"id":"47427","full_name":"Peitz, Sebastian","last_name":"Peitz","orcid":"0000-0002-3389-793X","first_name":"Sebastian"}],"publication_identifier":{"eissn":["2297-8747"]},"doi":"10.3390/mca26020031","article_number":"31","main_file_link":[{"url":"https://www.mdpi.com/2297-8747/26/2/31/pdf","open_access":"1"}],"language":[{"iso":"eng"}],"abstract":[{"lang":"eng","text":"We present a flexible trust region descend algorithm for unconstrained and\r\nconvexly constrained multiobjective optimization problems. It is targeted at\r\nheterogeneous and expensive problems, i.e., problems that have at least one\r\nobjective function that is computationally expensive. The method is\r\nderivative-free in the sense that neither need derivative information be\r\navailable for the expensive objectives nor are gradients approximated using\r\nrepeated function evaluations as is the case in finite-difference methods.\r\nInstead, a multiobjective trust region approach is used that works similarly to\r\nits well-known scalar pendants. Local surrogate models constructed from\r\nevaluation data of the true objective functions are employed to compute\r\npossible descent directions. In contrast to existing multiobjective trust\r\nregion algorithms, these surrogates are not polynomial but carefully\r\nconstructed radial basis function networks. This has the important advantage\r\nthat the number of data points scales linearly with the parameter space\r\ndimension. The local models qualify as fully linear and the corresponding\r\ngeneral scalar framework is adapted for problems with multiple objectives.\r\nConvergence to Pareto critical points is proven and numerical examples\r\nillustrate our findings."}],"publication":"Mathematical and Computational Applications","issue":"2","type":"journal_article","department":[{"_id":"101"},{"_id":"655"}],"date_created":"2021-03-01T10:46:48Z","status":"public","user_id":"47427","volume":26,"_id":"21337","citation":{"mla":"Berkemeier, Manuel Bastian, and Sebastian Peitz. “Derivative-Free Multiobjective Trust Region Descent Method Using Radial  Basis Function Surrogate Models.” <i>Mathematical and Computational Applications</i>, vol. 26, no. 2, 31, 2021, doi:<a href=\"https://doi.org/10.3390/mca26020031\">10.3390/mca26020031</a>.","bibtex":"@article{Berkemeier_Peitz_2021, title={Derivative-Free Multiobjective Trust Region Descent Method Using Radial  Basis Function Surrogate Models}, volume={26}, DOI={<a href=\"https://doi.org/10.3390/mca26020031\">10.3390/mca26020031</a>}, number={231}, journal={Mathematical and Computational Applications}, author={Berkemeier, Manuel Bastian and Peitz, Sebastian}, year={2021} }","ama":"Berkemeier MB, Peitz S. Derivative-Free Multiobjective Trust Region Descent Method Using Radial  Basis Function Surrogate Models. <i>Mathematical and Computational Applications</i>. 2021;26(2). doi:<a href=\"https://doi.org/10.3390/mca26020031\">10.3390/mca26020031</a>","ieee":"M. B. Berkemeier and S. Peitz, “Derivative-Free Multiobjective Trust Region Descent Method Using Radial  Basis Function Surrogate Models,” <i>Mathematical and Computational Applications</i>, vol. 26, no. 2, 2021.","apa":"Berkemeier, M. B., &#38; Peitz, S. (2021). Derivative-Free Multiobjective Trust Region Descent Method Using Radial  Basis Function Surrogate Models. <i>Mathematical and Computational Applications</i>, <i>26</i>(2). <a href=\"https://doi.org/10.3390/mca26020031\">https://doi.org/10.3390/mca26020031</a>","chicago":"Berkemeier, Manuel Bastian, and Sebastian Peitz. “Derivative-Free Multiobjective Trust Region Descent Method Using Radial  Basis Function Surrogate Models.” <i>Mathematical and Computational Applications</i> 26, no. 2 (2021). <a href=\"https://doi.org/10.3390/mca26020031\">https://doi.org/10.3390/mca26020031</a>.","short":"M.B. Berkemeier, S. Peitz, Mathematical and Computational Applications 26 (2021)."},"oa":"1"},{"user_id":"81513","doi":"10.3390/e23020134","language":[{"iso":"eng"}],"_id":"21820","article_number":"134","main_file_link":[{"url":"https://www.mdpi.com/1099-4300/23/2/134","open_access":"1"}],"publication_status":"published","date_updated":"2022-01-06T06:55:16Z","publication_identifier":{"issn":["1099-4300"]},"author":[{"last_name":"Nüske","first_name":"Feliks","orcid":"0000-0003-2444-7889","full_name":"Nüske, Feliks","id":"81513"},{"full_name":"Koltai, Péter","last_name":"Koltai","first_name":"Péter"},{"full_name":"Boninsegna, Lorenzo","last_name":"Boninsegna","first_name":"Lorenzo"},{"first_name":"Cecilia","last_name":"Clementi","full_name":"Clementi, Cecilia"}],"status":"public","title":"Spectral Properties of Effective Dynamics from Conditional Expectations","year":"2021","department":[{"_id":"101"}],"oa":"1","type":"journal_article","date_created":"2021-04-28T18:07:56Z","abstract":[{"text":"<jats:p>The reduction of high-dimensional systems to effective models on a smaller set of variables is an essential task in many areas of science. For stochastic dynamics governed by diffusion processes, a general procedure to find effective equations is the conditioning approach. In this paper, we are interested in the spectrum of the generator of the resulting effective dynamics, and how it compares to the spectrum of the full generator. We prove a new relative error bound in terms of the eigenfunction approximation error for reversible systems. We also present numerical examples indicating that, if Kramers–Moyal (KM) type approximations are used to compute the spectrum of the reduced generator, it seems largely insensitive to the time window used for the KM estimators. We analyze the implications of these observations for systems driven by underdamped Langevin dynamics, and show how meaningful effective dynamics can be defined in this setting.</jats:p>","lang":"eng"}],"citation":{"mla":"Nüske, Feliks, et al. “Spectral Properties of Effective Dynamics from Conditional Expectations.” <i>Entropy</i>, 134, 2021, doi:<a href=\"https://doi.org/10.3390/e23020134\">10.3390/e23020134</a>.","bibtex":"@article{Nüske_Koltai_Boninsegna_Clementi_2021, title={Spectral Properties of Effective Dynamics from Conditional Expectations}, DOI={<a href=\"https://doi.org/10.3390/e23020134\">10.3390/e23020134</a>}, number={134}, journal={Entropy}, author={Nüske, Feliks and Koltai, Péter and Boninsegna, Lorenzo and Clementi, Cecilia}, year={2021} }","ama":"Nüske F, Koltai P, Boninsegna L, Clementi C. Spectral Properties of Effective Dynamics from Conditional Expectations. <i>Entropy</i>. 2021. doi:<a href=\"https://doi.org/10.3390/e23020134\">10.3390/e23020134</a>","ieee":"F. Nüske, P. Koltai, L. Boninsegna, and C. Clementi, “Spectral Properties of Effective Dynamics from Conditional Expectations,” <i>Entropy</i>, 2021.","apa":"Nüske, F., Koltai, P., Boninsegna, L., &#38; Clementi, C. (2021). Spectral Properties of Effective Dynamics from Conditional Expectations. <i>Entropy</i>. <a href=\"https://doi.org/10.3390/e23020134\">https://doi.org/10.3390/e23020134</a>","short":"F. Nüske, P. Koltai, L. Boninsegna, C. Clementi, Entropy (2021).","chicago":"Nüske, Feliks, Péter Koltai, Lorenzo Boninsegna, and Cecilia Clementi. “Spectral Properties of Effective Dynamics from Conditional Expectations.” <i>Entropy</i>, 2021. <a href=\"https://doi.org/10.3390/e23020134\">https://doi.org/10.3390/e23020134</a>."},"publication":"Entropy"},{"citation":{"chicago":"Gebken, Bennet, and Sebastian Peitz. “An Efficient Descent Method for Locally Lipschitz Multiobjective Optimization Problems.” <i>Journal of Optimization Theory and Applications</i> 188 (2021): 696–723. <a href=\"https://doi.org/10.1007/s10957-020-01803-w\">https://doi.org/10.1007/s10957-020-01803-w</a>.","short":"B. Gebken, S. Peitz, Journal of Optimization Theory and Applications 188 (2021) 696–723.","apa":"Gebken, B., &#38; Peitz, S. (2021). An efficient descent method for locally Lipschitz multiobjective optimization problems. <i>Journal of Optimization Theory and Applications</i>, <i>188</i>, 696–723. <a href=\"https://doi.org/10.1007/s10957-020-01803-w\">https://doi.org/10.1007/s10957-020-01803-w</a>","ieee":"B. Gebken and S. Peitz, “An efficient descent method for locally Lipschitz multiobjective optimization problems,” <i>Journal of Optimization Theory and Applications</i>, vol. 188, pp. 696–723, 2021.","ama":"Gebken B, Peitz S. An efficient descent method for locally Lipschitz multiobjective optimization problems. <i>Journal of Optimization Theory and Applications</i>. 2021;188:696-723. doi:<a href=\"https://doi.org/10.1007/s10957-020-01803-w\">10.1007/s10957-020-01803-w</a>","bibtex":"@article{Gebken_Peitz_2021, title={An efficient descent method for locally Lipschitz multiobjective optimization problems}, volume={188}, DOI={<a href=\"https://doi.org/10.1007/s10957-020-01803-w\">10.1007/s10957-020-01803-w</a>}, journal={Journal of Optimization Theory and Applications}, author={Gebken, Bennet and Peitz, Sebastian}, year={2021}, pages={696–723} }","mla":"Gebken, Bennet, and Sebastian Peitz. “An Efficient Descent Method for Locally Lipschitz Multiobjective Optimization Problems.” <i>Journal of Optimization Theory and Applications</i>, vol. 188, 2021, pp. 696–723, doi:<a href=\"https://doi.org/10.1007/s10957-020-01803-w\">10.1007/s10957-020-01803-w</a>."},"oa":"1","status":"public","user_id":"47427","volume":188,"page":"696-723","_id":"16867","abstract":[{"text":"In this article, we present an efficient descent method for locally Lipschitz\r\ncontinuous multiobjective optimization problems (MOPs). The method is realized\r\nby combining a theoretical result regarding the computation of descent\r\ndirections for nonsmooth MOPs with a practical method to approximate the\r\nsubdifferentials of the objective functions. We show convergence to points\r\nwhich satisfy a necessary condition for Pareto optimality. Using a set of test\r\nproblems, we compare our method to the multiobjective proximal bundle method by\r\nM\\\"akel\\\"a. The results indicate that our method is competitive while being\r\neasier to implement. While the number of objective function evaluations is\r\nlarger, the overall number of subgradient evaluations is lower. Finally, we\r\nshow that our method can be combined with a subdivision algorithm to compute\r\nentire Pareto sets of nonsmooth MOPs.","lang":"eng"}],"publication":"Journal of Optimization Theory and Applications","type":"journal_article","department":[{"_id":"101"}],"date_created":"2020-04-27T09:11:22Z","publication_status":"published","date_updated":"2022-01-06T06:52:57Z","intvolume":"       188","title":"An efficient descent method for locally Lipschitz multiobjective optimization problems","year":"2021","author":[{"full_name":"Gebken, Bennet","first_name":"Bennet","last_name":"Gebken","id":"32643"},{"id":"47427","first_name":"Sebastian","last_name":"Peitz","orcid":"0000-0002-3389-793X","full_name":"Peitz, Sebastian"}],"doi":"10.1007/s10957-020-01803-w","main_file_link":[{"url":"https://link.springer.com/content/pdf/10.1007/s10957-020-01803-w.pdf","open_access":"1"}],"language":[{"iso":"eng"}]},{"oa":"1","citation":{"ieee":"B. Gebken and S. Peitz, “Inverse multiobjective optimization: Inferring decision criteria from data,” <i>Journal of Global Optimization</i>, vol. 80, pp. 3–29, 2021.","apa":"Gebken, B., &#38; Peitz, S. (2021). Inverse multiobjective optimization: Inferring decision criteria from data. <i>Journal of Global Optimization</i>, <i>80</i>, 3–29. <a href=\"https://doi.org/10.1007/s10898-020-00983-z\">https://doi.org/10.1007/s10898-020-00983-z</a>","chicago":"Gebken, Bennet, and Sebastian Peitz. “Inverse Multiobjective Optimization: Inferring Decision Criteria from Data.” <i>Journal of Global Optimization</i> 80 (2021): 3–29. <a href=\"https://doi.org/10.1007/s10898-020-00983-z\">https://doi.org/10.1007/s10898-020-00983-z</a>.","short":"B. Gebken, S. Peitz, Journal of Global Optimization 80 (2021) 3–29.","mla":"Gebken, Bennet, and Sebastian Peitz. “Inverse Multiobjective Optimization: Inferring Decision Criteria from Data.” <i>Journal of Global Optimization</i>, vol. 80, Springer, 2021, pp. 3–29, doi:<a href=\"https://doi.org/10.1007/s10898-020-00983-z\">10.1007/s10898-020-00983-z</a>.","bibtex":"@article{Gebken_Peitz_2021, title={Inverse multiobjective optimization: Inferring decision criteria from data}, volume={80}, DOI={<a href=\"https://doi.org/10.1007/s10898-020-00983-z\">10.1007/s10898-020-00983-z</a>}, journal={Journal of Global Optimization}, publisher={Springer}, author={Gebken, Bennet and Peitz, Sebastian}, year={2021}, pages={3–29} }","ama":"Gebken B, Peitz S. Inverse multiobjective optimization: Inferring decision criteria from data. <i>Journal of Global Optimization</i>. 2021;80:3-29. doi:<a href=\"https://doi.org/10.1007/s10898-020-00983-z\">10.1007/s10898-020-00983-z</a>"},"publisher":"Springer","_id":"16295","page":"3-29","volume":80,"user_id":"47427","status":"public","date_created":"2020-03-13T12:45:05Z","department":[{"_id":"101"}],"type":"journal_article","publication":"Journal of Global Optimization","abstract":[{"lang":"eng","text":"It is a challenging task to identify the objectives on which a certain decision was based, in particular if several, potentially conflicting criteria are equally important and a continuous set of optimal compromise decisions exists. This task can be understood as the inverse problem of multiobjective optimization, where the goal is to find the objective function vector of a given Pareto set. To this end, we present a method to construct the objective function vector of an unconstrained multiobjective optimization problem (MOP) such that the Pareto critical set contains a given set of data points with prescribed KKT multipliers. If such an MOP can not be found, then the method instead produces an MOP whose Pareto critical set is at least close to the data points. The key idea is to consider the objective function vector in the multiobjective KKT conditions as variable and then search for the objectives that minimize the Euclidean norm of the resulting system of equations. By expressing the objectives in a finite-dimensional basis, we transform this problem into a homogeneous, linear system of equations that can be solved efficiently. Potential applications of this approach include the identification of objectives (both from clean and noisy data) and the construction of surrogate models for expensive MOPs."}],"language":[{"iso":"eng"}],"main_file_link":[{"open_access":"1","url":"https://link.springer.com/content/pdf/10.1007/s10898-020-00983-z.pdf"}],"doi":"10.1007/s10898-020-00983-z","author":[{"id":"32643","first_name":"Bennet","last_name":"Gebken","full_name":"Gebken, Bennet"},{"id":"47427","first_name":"Sebastian","orcid":"https://orcid.org/0000-0002-3389-793X","last_name":"Peitz","full_name":"Peitz, Sebastian"}],"title":"Inverse multiobjective optimization: Inferring decision criteria from data","year":"2021","intvolume":"        80","date_updated":"2022-01-06T06:52:48Z"},{"abstract":[{"text":"Ein zentraler Aspekt bei der Untersuchung dynamischer Systeme ist die Analyse ihrer invarianten Mengen wie des globalen Attraktors und (in)stabiler Mannigfaltigkeiten. Insbesondere wenn das zugrunde liegende System von einem Parameter abhängt, ist es entscheidend, sie im Bezug auf diesen Parameter effizient zu verfolgen. Für die Berechnung invarianter Mengen stützen wir uns für ihre Approximation auf numerische Algorithmen. Typischerweise können diese Methoden jedoch nur auf endlich-dimensionale dynamische Systeme angewendet werden. In dieser Arbeit präsentieren wir daher einen numerischen Rahmen für die globale dynamische Analyse unendlich-dimensionaler Systeme. Wir werden Einbettungstechniken verwenden, um das core dynamical system (CDS) zu definieren, welches ein dynamisch äquivalentes endlich-dimensionales System ist.Das CDS wird dann verwendet, um eingebettete invariante Mengen, also eins-zu-eins Bilder, mittels Mengen-orientierten numerischen Methoden zu approximieren. Bei der Konstruktion des CDS ist es entscheidend, eine geeignete Beobachtungsabbildung auszuwählen und die geeignete inverse Abbildung zu entwerfen. Dazu werden wir geeignete numerische Implementierungen des CDS für DDEs und PDEs vorstellen. Für eine nachfolgende geometrische Analyse der eingebetteten invarianten Menge betrachten wir eine Lerntechnik namens diffusion maps, die ihre intrinsische Geometrie enthüllt sowie ihre Dimension schätzt. Schließlich wenden wir unsere entwickelten numerischen Methoden an einigen bekannten unendlich-dimensionale dynamischen Systeme an, wie die Mackey-Glass-Gleichung, die Kuramoto-Sivashinsky-Gleichung und die Navier-Stokes-Gleichung.","lang":"ger"},{"lang":"eng","text":"One central aspect in the study of dynamical systems is the analysis of its invariant sets such as the global attractor and (un)stable manifolds. In particular, when the underlying system depends on a parameter it is crucial to efficiently track those set with respect to this parameter. For the computation of invariant sets we rely on numerical algorithms for their approximation but typically those tools can only be applied to finite-dimensional dynamical systems. Thus, in thesis we present a numerical framework for the global dynamical analysis of infinite-dimensional systems. We will use embedding techniques for the definition of the core dynamical system (CDS) which is a dynamically equivalent finite-dimensional system. The CDS is then used for the approximation of related embedded invariant sets, i.e, one-to-one images, by set-oriented numerical methods. For the construction of the CDS it is crucial to choose an appropriate observation map and to design its corresponding inverse. Therefore, we will present suitable numerical realizations of the CDS for DDEs and PDEs. For a subsequent geometric analysis of the embedded invariant set we will consider a manifold learning technique called diffusion maps which reveals its intrinsic geometry and estimates its dimension. Finally, we apply our develop numerical tools on some well-known infinite-dimensional dynamical systems such as the Mackey-Glass equation, the Kuramoto-Sivashinsky equation and the Navier-Stokes equation."}],"supervisor":[{"first_name":"Michael","last_name":"Dellnitz ","full_name":"Dellnitz , Michael"},{"full_name":"Koltai, Péter","last_name":"Koltai","first_name":"Péter"}],"citation":{"bibtex":"@book{Gerlach_2021, title={The Computation and Analysis of Invariant Sets of Infinite-Dimensional Systems}, DOI={<a href=\"https://doi.org/10.17619/UNIPB/1-1278\">10.17619/UNIPB/1-1278</a>}, author={Gerlach, Raphael}, year={2021} }","ama":"Gerlach R. <i>The Computation and Analysis of Invariant Sets of Infinite-Dimensional Systems</i>.; 2021. doi:<a href=\"https://doi.org/10.17619/UNIPB/1-1278\">10.17619/UNIPB/1-1278</a>","mla":"Gerlach, Raphael. <i>The Computation and Analysis of Invariant Sets of Infinite-Dimensional Systems</i>. 2021, doi:<a href=\"https://doi.org/10.17619/UNIPB/1-1278\">10.17619/UNIPB/1-1278</a>.","chicago":"Gerlach, Raphael. <i>The Computation and Analysis of Invariant Sets of Infinite-Dimensional Systems</i>, 2021. <a href=\"https://doi.org/10.17619/UNIPB/1-1278\">https://doi.org/10.17619/UNIPB/1-1278</a>.","short":"R. Gerlach, The Computation and Analysis of Invariant Sets of Infinite-Dimensional Systems, 2021.","ieee":"R. Gerlach, <i>The Computation and Analysis of Invariant Sets of Infinite-Dimensional Systems</i>. 2021.","apa":"Gerlach, R. (2021). <i>The Computation and Analysis of Invariant Sets of Infinite-Dimensional Systems</i>. <a href=\"https://doi.org/10.17619/UNIPB/1-1278\">https://doi.org/10.17619/UNIPB/1-1278</a>"},"type":"dissertation","oa":"1","department":[{"_id":"101"}],"date_created":"2022-06-20T09:54:24Z","date_updated":"2022-06-20T13:40:30Z","title":"The Computation and Analysis of Invariant Sets of Infinite-Dimensional Systems","year":"2021","status":"public","author":[{"full_name":"Gerlach, Raphael","first_name":"Raphael","last_name":"Gerlach","id":"32655"}],"doi":"10.17619/UNIPB/1-1278","user_id":"32643","main_file_link":[{"url":"https://digital.ub.uni-paderborn.de/hs/download/pdf/6214949","open_access":"1"}],"language":[{"iso":"eng"}],"_id":"32057"},{"citation":{"bibtex":"@article{Li_Ma_Miao_Shi_Wang_Zhang_2021, title={Nowhere-zero 3-flows in toroidal graphs}, volume={153}, DOI={<a href=\"https://doi.org/10.1016/j.jctb.2021.11.001\">10.1016/j.jctb.2021.11.001</a>}, journal={Journal of Combinatorial Theory, Series B}, publisher={Elsevier BV}, author={Li, Jiaao and Ma, Yulai and Miao, Zhengke and Shi, Yongtang and Wang, Weifan and Zhang, Cun-Quan}, year={2021}, pages={61–80} }","chicago":"Li, Jiaao, Yulai Ma, Zhengke Miao, Yongtang Shi, Weifan Wang, and Cun-Quan Zhang. “Nowhere-Zero 3-Flows in Toroidal Graphs.” <i>Journal of Combinatorial Theory, Series B</i> 153 (2021): 61–80. <a href=\"https://doi.org/10.1016/j.jctb.2021.11.001\">https://doi.org/10.1016/j.jctb.2021.11.001</a>.","ama":"Li J, Ma Y, Miao Z, Shi Y, Wang W, Zhang C-Q. Nowhere-zero 3-flows in toroidal graphs. <i>Journal of Combinatorial Theory, Series B</i>. 2021;153:61-80. doi:<a href=\"https://doi.org/10.1016/j.jctb.2021.11.001\">10.1016/j.jctb.2021.11.001</a>","short":"J. Li, Y. Ma, Z. Miao, Y. Shi, W. Wang, C.-Q. Zhang, Journal of Combinatorial Theory, Series B 153 (2021) 61–80.","ieee":"J. Li, Y. Ma, Z. Miao, Y. Shi, W. Wang, and C.-Q. Zhang, “Nowhere-zero 3-flows in toroidal graphs,” <i>Journal of Combinatorial Theory, Series B</i>, vol. 153, pp. 61–80, 2021, doi: <a href=\"https://doi.org/10.1016/j.jctb.2021.11.001\">10.1016/j.jctb.2021.11.001</a>.","apa":"Li, J., Ma, Y., Miao, Z., Shi, Y., Wang, W., &#38; Zhang, C.-Q. (2021). Nowhere-zero 3-flows in toroidal graphs. <i>Journal of Combinatorial Theory, Series B</i>, <i>153</i>, 61–80. <a href=\"https://doi.org/10.1016/j.jctb.2021.11.001\">https://doi.org/10.1016/j.jctb.2021.11.001</a>","mla":"Li, Jiaao, et al. “Nowhere-Zero 3-Flows in Toroidal Graphs.” <i>Journal of Combinatorial Theory, Series B</i>, vol. 153, Elsevier BV, 2021, pp. 61–80, doi:<a href=\"https://doi.org/10.1016/j.jctb.2021.11.001\">10.1016/j.jctb.2021.11.001</a>."},"user_id":"15540","volume":153,"page":"61-80","publisher":"Elsevier BV","_id":"34042","status":"public","type":"journal_article","keyword":["Computational Theory and Mathematics","Discrete Mathematics and Combinatorics","Theoretical Computer Science"],"department":[{"_id":"542"}],"date_created":"2022-11-09T08:43:55Z","publication":"Journal of Combinatorial Theory, Series B","doi":"10.1016/j.jctb.2021.11.001","language":[{"iso":"eng"}],"publication_status":"published","date_updated":"2022-11-09T08:44:37Z","intvolume":"       153","title":"Nowhere-zero 3-flows in toroidal graphs","year":"2021","author":[{"full_name":"Li, Jiaao","first_name":"Jiaao","last_name":"Li"},{"id":"92748","full_name":"Ma, Yulai","first_name":"Yulai","last_name":"Ma"},{"last_name":"Miao","first_name":"Zhengke","full_name":"Miao, Zhengke"},{"last_name":"Shi","first_name":"Yongtang","full_name":"Shi, Yongtang"},{"full_name":"Wang, Weifan","last_name":"Wang","first_name":"Weifan"},{"last_name":"Zhang","first_name":"Cun-Quan","full_name":"Zhang, Cun-Quan"}],"publication_identifier":{"issn":["0095-8956"]}},{"author":[{"first_name":"Sina","last_name":"Ober-Blöbaum","full_name":"Ober-Blöbaum, Sina","id":"16494"},{"full_name":"Vermeeren, M.","last_name":"Vermeeren","first_name":"M."}],"corporate_editor":["IFAC-PapersOnLine"],"status":"public","title":"Superconvergence of galerkin variational integrators","year":"2021","date_updated":"2022-01-21T13:36:53Z","_id":"29421","language":[{"iso":"eng"}],"page":"327-333","volume":"54(19)","user_id":"15694","citation":{"ama":"Ober-Blöbaum S, Vermeeren M. Superconvergence of galerkin variational integrators. In: IFAC-PapersOnLine, ed. <i>7th IIFAC Workshop on Lagrangian and Hamiltonian Methods for Nonlinear Control LHMNC</i>. Vol 54(19). ; 2021:327-333.","bibtex":"@inproceedings{Ober-Blöbaum_Vermeeren_2021, title={Superconvergence of galerkin variational integrators}, volume={54(19)}, booktitle={7th IIFAC Workshop on Lagrangian and Hamiltonian Methods for Nonlinear Control LHMNC}, author={Ober-Blöbaum, Sina and Vermeeren, M.}, editor={IFAC-PapersOnLine}, year={2021}, pages={327–333} }","mla":"Ober-Blöbaum, Sina, and M. Vermeeren. “Superconvergence of Galerkin Variational Integrators.” <i>7th IIFAC Workshop on Lagrangian and Hamiltonian Methods for Nonlinear Control LHMNC</i>, edited by IFAC-PapersOnLine, vol. 54(19), 2021, pp. 327–33.","chicago":"Ober-Blöbaum, Sina, and M. Vermeeren. “Superconvergence of Galerkin Variational Integrators.” In <i>7th IIFAC Workshop on Lagrangian and Hamiltonian Methods for Nonlinear Control LHMNC</i>, edited by IFAC-PapersOnLine, 54(19):327–33, 2021.","short":"S. Ober-Blöbaum, M. Vermeeren, in: IFAC-PapersOnLine (Ed.), 7th IIFAC Workshop on Lagrangian and Hamiltonian Methods for Nonlinear Control LHMNC, 2021, pp. 327–333.","apa":"Ober-Blöbaum, S., &#38; Vermeeren, M. (2021). Superconvergence of galerkin variational integrators. In IFAC-PapersOnLine (Ed.), <i>7th IIFAC Workshop on Lagrangian and Hamiltonian Methods for Nonlinear Control LHMNC: Vol. 54(19)</i> (pp. 327–333).","ieee":"S. Ober-Blöbaum and M. Vermeeren, “Superconvergence of galerkin variational integrators,” in <i>7th IIFAC Workshop on Lagrangian and Hamiltonian Methods for Nonlinear Control LHMNC</i>, 2021, vol. 54(19), pp. 327–333."},"publication":"7th IIFAC Workshop on Lagrangian and Hamiltonian Methods for Nonlinear Control LHMNC","date_created":"2022-01-18T14:27:56Z","department":[{"_id":"636"}],"type":"conference"},{"date_created":"2020-03-13T12:44:36Z","type":"journal_article","department":[{"_id":"101"}],"oa":"1","publication":"International Journal of Robust and Nonlinear Control","citation":{"chicago":"Ober-Blöbaum, Sina, and Sebastian Peitz. “Explicit Multiobjective Model Predictive Control for Nonlinear Systems  with Symmetries.” <i>International Journal of Robust and Nonlinear Control</i> 31(2) (2021): 380–403. <a href=\"https://doi.org/10.1002/rnc.5281\">https://doi.org/10.1002/rnc.5281</a>.","short":"S. Ober-Blöbaum, S. Peitz, International Journal of Robust and Nonlinear Control 31(2) (2021) 380–403.","apa":"Ober-Blöbaum, S., &#38; Peitz, S. (2021). Explicit multiobjective model predictive control for nonlinear systems  with symmetries. <i>International Journal of Robust and Nonlinear Control</i>, <i>31(2)</i>, 380–403. <a href=\"https://doi.org/10.1002/rnc.5281\">https://doi.org/10.1002/rnc.5281</a>","ieee":"S. Ober-Blöbaum and S. Peitz, “Explicit multiobjective model predictive control for nonlinear systems  with symmetries,” <i>International Journal of Robust and Nonlinear Control</i>, vol. 31(2), pp. 380–403, 2021, doi: <a href=\"https://doi.org/10.1002/rnc.5281\">10.1002/rnc.5281</a>.","ama":"Ober-Blöbaum S, Peitz S. Explicit multiobjective model predictive control for nonlinear systems  with symmetries. <i>International Journal of Robust and Nonlinear Control</i>. 2021;31(2):380-403. doi:<a href=\"https://doi.org/10.1002/rnc.5281\">10.1002/rnc.5281</a>","bibtex":"@article{Ober-Blöbaum_Peitz_2021, title={Explicit multiobjective model predictive control for nonlinear systems  with symmetries}, volume={31(2)}, DOI={<a href=\"https://doi.org/10.1002/rnc.5281\">10.1002/rnc.5281</a>}, journal={International Journal of Robust and Nonlinear Control}, author={Ober-Blöbaum, Sina and Peitz, Sebastian}, year={2021}, pages={380–403} }","mla":"Ober-Blöbaum, Sina, and Sebastian Peitz. “Explicit Multiobjective Model Predictive Control for Nonlinear Systems  with Symmetries.” <i>International Journal of Robust and Nonlinear Control</i>, vol. 31(2), 2021, pp. 380–403, doi:<a href=\"https://doi.org/10.1002/rnc.5281\">10.1002/rnc.5281</a>."},"abstract":[{"lang":"eng","text":"Model predictive control is a prominent approach to construct a feedback\r\ncontrol loop for dynamical systems. Due to real-time constraints, the major\r\nchallenge in MPC is to solve model-based optimal control problems in a very\r\nshort amount of time. For linear-quadratic problems, Bemporad et al. have\r\nproposed an explicit formulation where the underlying optimization problems are\r\nsolved a priori in an offline phase. In this article, we present an extension\r\nof this concept in two significant ways. We consider nonlinear problems and -\r\nmore importantly - problems with multiple conflicting objective functions. In\r\nthe offline phase, we build a library of Pareto optimal solutions from which we\r\nthen obtain a valid compromise solution in the online phase according to a\r\ndecision maker's preference. Since the standard multi-parametric programming\r\napproach is no longer valid in this situation, we instead use interpolation\r\nbetween different entries of the library. To reduce the number of problems that\r\nhave to be solved in the offline phase, we exploit symmetries in the dynamical\r\nsystem and the corresponding multiobjective optimal control problem. The\r\nresults are verified using two different examples from autonomous driving."}],"project":[{"_id":"52","name":"Computing Resources Provided by the Paderborn Center for Parallel Computing"}],"page":"380-403","main_file_link":[{"url":"https://onlinelibrary.wiley.com/doi/epdf/10.1002/rnc.5281","open_access":"1"}],"language":[{"iso":"eng"}],"_id":"16294","user_id":"15694","doi":"10.1002/rnc.5281","volume":"31(2)","year":"2021","title":"Explicit multiobjective model predictive control for nonlinear systems  with symmetries","status":"public","author":[{"id":"16494","last_name":"Ober-Blöbaum","first_name":"Sina","full_name":"Ober-Blöbaum, Sina"},{"id":"47427","last_name":"Peitz","orcid":"https://orcid.org/0000-0002-3389-793X","first_name":"Sebastian","full_name":"Peitz, Sebastian"}],"date_updated":"2022-01-24T13:27:50Z"},{"type":"journal_article","keyword":["Electrical and Electronic Engineering","Control and Systems Engineering"],"department":[{"_id":"636"}],"date_created":"2022-01-26T13:13:06Z","publication":"Automatica","doi":"10.1016/j.automatica.2021.109804","article_number":"109804","language":[{"iso":"eng"}],"date_updated":"2022-01-26T13:15:33Z","publication_status":"published","intvolume":"       132","title":"Turnpike features in optimal selection of species represented by quota models","year":"2021","publication_identifier":{"issn":["0005-1098"]},"author":[{"last_name":"Djema","first_name":"Walid","full_name":"Djema, Walid"},{"full_name":"Giraldi, Laetitia","first_name":"Laetitia","last_name":"Giraldi"},{"id":"87909","full_name":"Maslovskaya, Sofya","first_name":"Sofya","last_name":"Maslovskaya"},{"full_name":"Bernard, Olivier","last_name":"Bernard","first_name":"Olivier"}],"citation":{"mla":"Djema, Walid, et al. “Turnpike Features in Optimal Selection of Species Represented by Quota Models.” <i>Automatica</i>, vol. 132, 109804, Elsevier BV, 2021, doi:<a href=\"https://doi.org/10.1016/j.automatica.2021.109804\">10.1016/j.automatica.2021.109804</a>.","apa":"Djema, W., Giraldi, L., Maslovskaya, S., &#38; Bernard, O. (2021). Turnpike features in optimal selection of species represented by quota models. <i>Automatica</i>, <i>132</i>, Article 109804. <a href=\"https://doi.org/10.1016/j.automatica.2021.109804\">https://doi.org/10.1016/j.automatica.2021.109804</a>","ieee":"W. Djema, L. Giraldi, S. Maslovskaya, and O. Bernard, “Turnpike features in optimal selection of species represented by quota models,” <i>Automatica</i>, vol. 132, Art. no. 109804, 2021, doi: <a href=\"https://doi.org/10.1016/j.automatica.2021.109804\">10.1016/j.automatica.2021.109804</a>.","chicago":"Djema, Walid, Laetitia Giraldi, Sofya Maslovskaya, and Olivier Bernard. “Turnpike Features in Optimal Selection of Species Represented by Quota Models.” <i>Automatica</i> 132 (2021). <a href=\"https://doi.org/10.1016/j.automatica.2021.109804\">https://doi.org/10.1016/j.automatica.2021.109804</a>.","ama":"Djema W, Giraldi L, Maslovskaya S, Bernard O. Turnpike features in optimal selection of species represented by quota models. <i>Automatica</i>. 2021;132. doi:<a href=\"https://doi.org/10.1016/j.automatica.2021.109804\">10.1016/j.automatica.2021.109804</a>","short":"W. Djema, L. Giraldi, S. Maslovskaya, O. Bernard, Automatica 132 (2021).","bibtex":"@article{Djema_Giraldi_Maslovskaya_Bernard_2021, title={Turnpike features in optimal selection of species represented by quota models}, volume={132}, DOI={<a href=\"https://doi.org/10.1016/j.automatica.2021.109804\">10.1016/j.automatica.2021.109804</a>}, number={109804}, journal={Automatica}, publisher={Elsevier BV}, author={Djema, Walid and Giraldi, Laetitia and Maslovskaya, Sofya and Bernard, Olivier}, year={2021} }"},"user_id":"87909","volume":132,"_id":"29543","publisher":"Elsevier BV","status":"public"},{"volume":100,"user_id":"15540","publisher":"Elsevier BV","_id":"32810","status":"public","citation":{"ama":"Li J, Ma Y, Shi Y, Wang W, Wu Y. On 3-flow-critical graphs. <i>European Journal of Combinatorics</i>. 2021;100. doi:<a href=\"https://doi.org/10.1016/j.ejc.2021.103451\">10.1016/j.ejc.2021.103451</a>","bibtex":"@article{Li_Ma_Shi_Wang_Wu_2021, title={On 3-flow-critical graphs}, volume={100}, DOI={<a href=\"https://doi.org/10.1016/j.ejc.2021.103451\">10.1016/j.ejc.2021.103451</a>}, number={103451}, journal={European Journal of Combinatorics}, publisher={Elsevier BV}, author={Li, Jiaao and Ma, Yulai and Shi, Yongtang and Wang, Weifan and Wu, Yezhou}, year={2021} }","mla":"Li, Jiaao, et al. “On 3-Flow-Critical Graphs.” <i>European Journal of Combinatorics</i>, vol. 100, 103451, Elsevier BV, 2021, doi:<a href=\"https://doi.org/10.1016/j.ejc.2021.103451\">10.1016/j.ejc.2021.103451</a>.","chicago":"Li, Jiaao, Yulai Ma, Yongtang Shi, Weifan Wang, and Yezhou Wu. “On 3-Flow-Critical Graphs.” <i>European Journal of Combinatorics</i> 100 (2021). <a href=\"https://doi.org/10.1016/j.ejc.2021.103451\">https://doi.org/10.1016/j.ejc.2021.103451</a>.","short":"J. Li, Y. Ma, Y. Shi, W. Wang, Y. Wu, European Journal of Combinatorics 100 (2021).","apa":"Li, J., Ma, Y., Shi, Y., Wang, W., &#38; Wu, Y. (2021). On 3-flow-critical graphs. <i>European Journal of Combinatorics</i>, <i>100</i>, Article 103451. <a href=\"https://doi.org/10.1016/j.ejc.2021.103451\">https://doi.org/10.1016/j.ejc.2021.103451</a>","ieee":"J. Li, Y. Ma, Y. Shi, W. Wang, and Y. Wu, “On 3-flow-critical graphs,” <i>European Journal of Combinatorics</i>, vol. 100, Art. no. 103451, 2021, doi: <a href=\"https://doi.org/10.1016/j.ejc.2021.103451\">10.1016/j.ejc.2021.103451</a>."},"doi":"10.1016/j.ejc.2021.103451","language":[{"iso":"eng"}],"article_number":"103451","intvolume":"       100","date_updated":"2022-08-15T09:35:32Z","publication_status":"published","publication_identifier":{"issn":["0195-6698"]},"author":[{"last_name":"Li","first_name":"Jiaao","full_name":"Li, Jiaao"},{"full_name":"Ma, Yulai","last_name":"Ma","first_name":"Yulai","id":"92748"},{"first_name":"Yongtang","last_name":"Shi","full_name":"Shi, Yongtang"},{"first_name":"Weifan","last_name":"Wang","full_name":"Wang, Weifan"},{"first_name":"Yezhou","last_name":"Wu","full_name":"Wu, Yezhou"}],"year":"2021","title":"On 3-flow-critical graphs","department":[{"_id":"542"}],"type":"journal_article","keyword":["Discrete Mathematics and Combinatorics"],"date_created":"2022-08-15T09:35:02Z","publication":"European Journal of Combinatorics"},{"has_accepted_license":"1","status":"public","conference":{"end_date":"2021-10-13","location":"Berlin, Germany","name":"7th IFAC Workshop on Lagrangian and Hamiltonian Methods for Nonlinear Control, LHMNC 2021","start_date":"2021-10-11"},"user_id":"15694","ddc":["510"],"volume":"54(19)","page":"334-339","_id":"22894","quality_controlled":"1","file_date_updated":"2021-07-29T09:37:49Z","citation":{"apa":"Offen, C., &#38; Ober-Blöbaum, S. (2021). <i>Bifurcation preserving discretisations of optimal control problems: Vol. 54(19)</i> (pp. 334–339). <a href=\"https://doi.org/10.1016/j.ifacol.2021.11.099\">https://doi.org/10.1016/j.ifacol.2021.11.099</a>","ieee":"C. Offen and S. Ober-Blöbaum, “Bifurcation preserving discretisations of optimal control problems,” vol. 54(19). pp. 334–339, 2021, doi: <a href=\"https://doi.org/10.1016/j.ifacol.2021.11.099\">https://doi.org/10.1016/j.ifacol.2021.11.099</a>.","short":"C. Offen, S. Ober-Blöbaum, 54(19) (2021) 334–339.","chicago":"Offen, Christian, and Sina Ober-Blöbaum. “Bifurcation Preserving Discretisations of Optimal Control Problems.” IFAC-PapersOnLine, 2021. <a href=\"https://doi.org/10.1016/j.ifacol.2021.11.099\">https://doi.org/10.1016/j.ifacol.2021.11.099</a>.","mla":"Offen, Christian, and Sina Ober-Blöbaum. <i>Bifurcation Preserving Discretisations of Optimal Control Problems</i>. 2021, pp. 334–39, doi:<a href=\"https://doi.org/10.1016/j.ifacol.2021.11.099\">https://doi.org/10.1016/j.ifacol.2021.11.099</a>.","ama":"Offen C, Ober-Blöbaum S. Bifurcation preserving discretisations of optimal control problems. 2021;54(19):334-339. doi:<a href=\"https://doi.org/10.1016/j.ifacol.2021.11.099\">https://doi.org/10.1016/j.ifacol.2021.11.099</a>","bibtex":"@article{Offen_Ober-Blöbaum_2021, series={IFAC-PapersOnLine}, title={Bifurcation preserving discretisations of optimal control problems}, volume={54(19)}, DOI={<a href=\"https://doi.org/10.1016/j.ifacol.2021.11.099\">https://doi.org/10.1016/j.ifacol.2021.11.099</a>}, author={Offen, Christian and Ober-Blöbaum, Sina}, year={2021}, pages={334–339}, collection={IFAC-PapersOnLine} }"},"oa":"1","external_id":{"arxiv":["2107.13853"]},"publication_status":"published","date_updated":"2023-11-29T10:19:41Z","year":"2021","title":"Bifurcation preserving discretisations of optimal control problems","author":[{"first_name":"Christian","last_name":"Offen","orcid":"0000-0002-5940-8057","full_name":"Offen, Christian","id":"85279"},{"id":"16494","last_name":"Ober-Blöbaum","first_name":"Sina","full_name":"Ober-Blöbaum, Sina"}],"publication_identifier":{"issn":["2405-8963"]},"doi":"https://doi.org/10.1016/j.ifacol.2021.11.099","main_file_link":[{"open_access":"1","url":"https://www.sciencedirect.com/science/article/pii/S2405896321021236"}],"series_title":"IFAC-PapersOnLine","language":[{"iso":"eng"}],"related_material":{"link":[{"description":"GitHub/Zenodo","relation":"software","url":"https://doi.org/10.5281/zenodo.4562664"}]},"abstract":[{"lang":"eng","text":"The first order optimality conditions of optimal control problems (OCPs) can\r\nbe regarded as boundary value problems for Hamiltonian systems. Variational or\r\nsymplectic discretisation methods are classically known for their excellent\r\nlong term behaviour. As boundary value problems are posed on intervals of\r\nfixed, moderate length, it is not immediately clear whether methods can profit\r\nfrom structure preservation in this context. When parameters are present,\r\nsolutions can undergo bifurcations, for instance, two solutions can merge and\r\nannihilate one another as parameters are varied. We will show that generic\r\nbifurcations of an OCP are preserved under discretisation when the OCP is\r\neither directly discretised to a discrete OCP (direct method) or translated\r\ninto a Hamiltonian boundary value problem using first order necessary\r\nconditions of optimality which is then solved using a symplectic integrator\r\n(indirect method). Moreover, certain bifurcations break when a non-symplectic\r\nscheme is used. The general phenomenon is illustrated on the example of a cut\r\nlocus of an ellipsoid."}],"type":"conference","keyword":["optimal control","catastrophe theory","bifurcations","variational methods","symplectic integrators"],"department":[{"_id":"636"}],"file":[{"date_created":"2021-07-29T09:37:49Z","creator":"coffen","file_id":"22895","content_type":"application/pdf","file_name":"ifacconf.pdf","access_level":"open_access","file_size":3125220,"relation":"main_file","date_updated":"2021-07-29T09:37:49Z"}],"date_created":"2021-07-29T09:38:32Z"},{"department":[{"_id":"636"}],"type":"conference","date_created":"2021-03-30T10:27:44Z","related_material":{"link":[{"description":"GitHub","relation":"software","url":"https://github.com/Crown421/StructureGPs-paper"}]},"publication":"2021 60th IEEE Conference on Decision and Control (CDC)","doi":"10.1109/CDC45484.2021.9683426","language":[{"iso":"eng"}],"publication_status":"published","date_updated":"2023-11-29T10:24:55Z","author":[{"last_name":"Ridderbusch","first_name":"Steffen","full_name":"Ridderbusch, Steffen"},{"id":"85279","first_name":"Christian","orcid":"0000-0002-5940-8057","last_name":"Offen","full_name":"Offen, Christian"},{"full_name":"Ober-Blöbaum, Sina","first_name":"Sina","last_name":"Ober-Blöbaum","id":"16494"},{"full_name":"Goulart, Paul","last_name":"Goulart","first_name":"Paul"}],"publication_identifier":{"eisbn":["978-1-6654-3659-5"]},"year":"2021","title":"Learning ODE Models with Qualitative Structure Using Gaussian Processes ","external_id":{"arxiv":["2011.05364"]},"citation":{"mla":"Ridderbusch, Steffen, et al. “Learning ODE Models with Qualitative Structure Using Gaussian Processes .” <i>2021 60th IEEE Conference on Decision and Control (CDC)</i>, IEEE, 2021, p. 2896, doi:<a href=\"https://doi.org/10.1109/CDC45484.2021.9683426\">10.1109/CDC45484.2021.9683426</a>.","ama":"Ridderbusch S, Offen C, Ober-Blöbaum S, Goulart P. Learning ODE Models with Qualitative Structure Using Gaussian Processes . In: <i>2021 60th IEEE Conference on Decision and Control (CDC)</i>. IEEE; 2021:2896. doi:<a href=\"https://doi.org/10.1109/CDC45484.2021.9683426\">10.1109/CDC45484.2021.9683426</a>","bibtex":"@inproceedings{Ridderbusch_Offen_Ober-Blöbaum_Goulart_2021, title={Learning ODE Models with Qualitative Structure Using Gaussian Processes }, DOI={<a href=\"https://doi.org/10.1109/CDC45484.2021.9683426\">10.1109/CDC45484.2021.9683426</a>}, booktitle={2021 60th IEEE Conference on Decision and Control (CDC)}, publisher={IEEE}, author={Ridderbusch, Steffen and Offen, Christian and Ober-Blöbaum, Sina and Goulart, Paul}, year={2021}, pages={2896} }","apa":"Ridderbusch, S., Offen, C., Ober-Blöbaum, S., &#38; Goulart, P. (2021). Learning ODE Models with Qualitative Structure Using Gaussian Processes . <i>2021 60th IEEE Conference on Decision and Control (CDC)</i>, 2896. <a href=\"https://doi.org/10.1109/CDC45484.2021.9683426\">https://doi.org/10.1109/CDC45484.2021.9683426</a>","ieee":"S. Ridderbusch, C. Offen, S. Ober-Blöbaum, and P. Goulart, “Learning ODE Models with Qualitative Structure Using Gaussian Processes ,” in <i>2021 60th IEEE Conference on Decision and Control (CDC)</i>, Austin, TX, USA, 2021, p. 2896, doi: <a href=\"https://doi.org/10.1109/CDC45484.2021.9683426\">10.1109/CDC45484.2021.9683426</a>.","short":"S. Ridderbusch, C. Offen, S. Ober-Blöbaum, P. Goulart, in: 2021 60th IEEE Conference on Decision and Control (CDC), IEEE, 2021, p. 2896.","chicago":"Ridderbusch, Steffen, Christian Offen, Sina Ober-Blöbaum, and Paul Goulart. “Learning ODE Models with Qualitative Structure Using Gaussian Processes .” In <i>2021 60th IEEE Conference on Decision and Control (CDC)</i>, 2896. IEEE, 2021. <a href=\"https://doi.org/10.1109/CDC45484.2021.9683426\">https://doi.org/10.1109/CDC45484.2021.9683426</a>."},"user_id":"15694","_id":"21572","publisher":"IEEE","page":"2896","conference":{"location":"Austin, TX, USA","start_date":"2021-12-14","name":"60th IEEE Conference on Decision and Control (CDC)","end_date":"2021-12-17"},"status":"public"},{"user_id":"15694","language":[{"iso":"eng"}],"_id":"21592","page":"1975-1980","publication_status":"accepted","date_updated":"2023-11-29T10:26:49Z","author":[{"id":"87056","first_name":"Nikolaus","last_name":"Vertovec","full_name":"Vertovec, Nikolaus"},{"full_name":"Ober-Blöbaum, Sina","first_name":"Sina","last_name":"Ober-Blöbaum","id":"16494"},{"full_name":"Margellos, Kostas","first_name":"Kostas","last_name":"Margellos"}],"conference":{"name":"2021 European Control Conference (ECC)","start_date":"2021-06-29","location":"Rotterdam, the Netherlands","end_date":"2021-07-02"},"status":"public","year":"2021","title":"Multi-objective minimum time optimal control for low-thrust trajectory design","department":[{"_id":"636"}],"type":"conference","date_created":"2021-04-03T03:00:35Z","external_id":{"arxiv":["2103.08813"]},"abstract":[{"text":"We propose a reachability approach for infinite and finite horizon multi-objective optimization problems for low-thrust spacecraft trajectory design. The main advantage of the proposed method is that the Pareto front can be efficiently constructed from the zero level set of the solution to a Hamilton-Jacobi-Bellman equation. We demonstrate the proposed method by applying it to a low-thrust spacecraft trajectory design problem. By deriving the analytic expression for the Hamiltonian and the optimal control policy, we are able to efficiently compute the backward reachable set and reconstruct the optimal trajectories. Furthermore, we show that any reconstructed trajectory will be guaranteed to be weakly Pareto optimal. The proposed method can be used as a benchmark for future research of applying reachability analysis to low-thrust spacecraft trajectory design.","lang":"eng"}],"citation":{"ieee":"N. Vertovec, S. Ober-Blöbaum, and K. Margellos, “Multi-objective minimum time optimal control for low-thrust trajectory design,” Rotterdam, the Netherlands, pp. 1975–1980.","mla":"Vertovec, Nikolaus, et al. <i>Multi-Objective Minimum Time Optimal Control for Low-Thrust Trajectory Design</i>. pp. 1975–80.","apa":"Vertovec, N., Ober-Blöbaum, S., &#38; Margellos, K. (n.d.). <i>Multi-objective minimum time optimal control for low-thrust trajectory design</i>. 1975–1980.","bibtex":"@inproceedings{Vertovec_Ober-Blöbaum_Margellos, title={Multi-objective minimum time optimal control for low-thrust trajectory design}, author={Vertovec, Nikolaus and Ober-Blöbaum, Sina and Margellos, Kostas}, pages={1975–1980} }","short":"N. Vertovec, S. Ober-Blöbaum, K. Margellos, in: n.d., pp. 1975–1980.","ama":"Vertovec N, Ober-Blöbaum S, Margellos K. Multi-objective minimum time optimal control for low-thrust trajectory design. In: ; :1975-1980.","chicago":"Vertovec, Nikolaus, Sina Ober-Blöbaum, and Kostas Margellos. “Multi-Objective Minimum Time Optimal Control for Low-Thrust Trajectory Design,” 1975–80, n.d."}}]