--- _id: '50066' author: - first_name: Feng full_name: Dou, Feng last_name: Dou - first_name: Lin full_name: Wang, Lin id: '102868' last_name: Wang - first_name: Shutong full_name: Chen, Shutong last_name: Chen - first_name: Fangming full_name: Liu, Fangming last_name: Liu citation: ama: 'Dou F, Wang L, Chen S, Liu F. X-Stream: A Flexible, Adaptive Video Transformer for Privacy-Preserving Video Stream Analytics. In: Proceedings of the IEEE International Conference on Computer Communications (INFOCOM). IEEE.' apa: 'Dou, F., Wang, L., Chen, S., & Liu, F. (n.d.). X-Stream: A Flexible, Adaptive Video Transformer for Privacy-Preserving Video Stream Analytics. Proceedings of the IEEE International Conference on Computer Communications (INFOCOM). IEEE International Conference on Computer Communications (INFOCOM), Vancouver, Canada.' bibtex: '@inproceedings{Dou_Wang_Chen_Liu, title={X-Stream: A Flexible, Adaptive Video Transformer for Privacy-Preserving Video Stream Analytics}, booktitle={Proceedings of the IEEE International Conference on Computer Communications (INFOCOM)}, publisher={IEEE}, author={Dou, Feng and Wang, Lin and Chen, Shutong and Liu, Fangming} }' chicago: 'Dou, Feng, Lin Wang, Shutong Chen, and Fangming Liu. “X-Stream: A Flexible, Adaptive Video Transformer for Privacy-Preserving Video Stream Analytics.” In Proceedings of the IEEE International Conference on Computer Communications (INFOCOM). IEEE, n.d.' ieee: 'F. Dou, L. Wang, S. Chen, and F. Liu, “X-Stream: A Flexible, Adaptive Video Transformer for Privacy-Preserving Video Stream Analytics,” presented at the IEEE International Conference on Computer Communications (INFOCOM), Vancouver, Canada.' mla: 'Dou, Feng, et al. “X-Stream: A Flexible, Adaptive Video Transformer for Privacy-Preserving Video Stream Analytics.” Proceedings of the IEEE International Conference on Computer Communications (INFOCOM), IEEE.' short: 'F. Dou, L. Wang, S. Chen, F. Liu, in: Proceedings of the IEEE International Conference on Computer Communications (INFOCOM), IEEE, n.d.' conference: end_date: 2024-05-23 location: Vancouver, Canada name: IEEE International Conference on Computer Communications (INFOCOM) start_date: 2024-05-20 date_created: 2023-12-22T20:24:27Z date_updated: 2024-01-23T20:35:02Z department: - _id: '34' - _id: '7' - _id: '75' language: - iso: eng publication: Proceedings of the IEEE International Conference on Computer Communications (INFOCOM) publication_status: accepted publisher: IEEE status: public title: 'X-Stream: A Flexible, Adaptive Video Transformer for Privacy-Preserving Video Stream Analytics' type: conference user_id: '102868' year: '2024' ... --- _id: '50065' author: - first_name: Marcel full_name: Blöcher, Marcel last_name: Blöcher - first_name: Nils full_name: Nedderhut, Nils last_name: Nedderhut - first_name: Pavel full_name: Chuprikov, Pavel last_name: Chuprikov - first_name: Ramin full_name: Khalili, Ramin last_name: Khalili - first_name: Patrick full_name: Eugster, Patrick last_name: Eugster - first_name: Lin full_name: Wang, Lin id: '102868' last_name: Wang citation: ama: 'Blöcher M, Nedderhut N, Chuprikov P, Khalili R, Eugster P, Wang L. Train Once Apply Anywhere: Effective Scheduling for Network Function Chains Running on FUMES. In: Proceedings of the IEEE International Conference on Computer Communications (INFOCOM). IEEE.' apa: 'Blöcher, M., Nedderhut, N., Chuprikov, P., Khalili, R., Eugster, P., & Wang, L. (n.d.). Train Once Apply Anywhere: Effective Scheduling for Network Function Chains Running on FUMES. Proceedings of the IEEE International Conference on Computer Communications (INFOCOM). IEEE International Conference on Computer Communications (INFOCOM), Vancouver, Canada.' bibtex: '@inproceedings{Blöcher_Nedderhut_Chuprikov_Khalili_Eugster_Wang, title={Train Once Apply Anywhere: Effective Scheduling for Network Function Chains Running on FUMES}, booktitle={Proceedings of the IEEE International Conference on Computer Communications (INFOCOM)}, publisher={IEEE}, author={Blöcher, Marcel and Nedderhut, Nils and Chuprikov, Pavel and Khalili, Ramin and Eugster, Patrick and Wang, Lin} }' chicago: 'Blöcher, Marcel, Nils Nedderhut, Pavel Chuprikov, Ramin Khalili, Patrick Eugster, and Lin Wang. “Train Once Apply Anywhere: Effective Scheduling for Network Function Chains Running on FUMES.” In Proceedings of the IEEE International Conference on Computer Communications (INFOCOM). IEEE, n.d.' ieee: 'M. Blöcher, N. Nedderhut, P. Chuprikov, R. Khalili, P. Eugster, and L. Wang, “Train Once Apply Anywhere: Effective Scheduling for Network Function Chains Running on FUMES,” presented at the IEEE International Conference on Computer Communications (INFOCOM), Vancouver, Canada.' mla: 'Blöcher, Marcel, et al. “Train Once Apply Anywhere: Effective Scheduling for Network Function Chains Running on FUMES.” Proceedings of the IEEE International Conference on Computer Communications (INFOCOM), IEEE.' short: 'M. Blöcher, N. Nedderhut, P. Chuprikov, R. Khalili, P. Eugster, L. Wang, in: Proceedings of the IEEE International Conference on Computer Communications (INFOCOM), IEEE, n.d.' conference: end_date: 2024-05-23 location: Vancouver, Canada name: IEEE International Conference on Computer Communications (INFOCOM) start_date: 2024-05-20 date_created: 2023-12-22T20:06:42Z date_updated: 2024-01-23T20:35:09Z department: - _id: '75' language: - iso: eng publication: Proceedings of the IEEE International Conference on Computer Communications (INFOCOM) publication_status: accepted publisher: IEEE status: public title: 'Train Once Apply Anywhere: Effective Scheduling for Network Function Chains Running on FUMES' type: conference user_id: '102868' year: '2024' ... --- _id: '50807' author: - first_name: Haichuan full_name: Hu, Haichuan last_name: Hu - first_name: Fangming full_name: Liu, Fangming last_name: Liu - first_name: Qiangyu full_name: Pei, Qiangyu last_name: Pei - first_name: Yongjie full_name: Yuan, Yongjie last_name: Yuan - first_name: Zichen full_name: Xu, Zichen last_name: Xu - first_name: Lin full_name: Wang, Lin id: '102868' last_name: Wang citation: ama: "Hu H, Liu F, Pei Q, Yuan Y, Xu Z, Wang L. \U0001D706Grapher: A Resource-Efficient Serverless System for GNN Serving through Graph Sharing. In: Proceedings of the ACM Web Conference (WWW). ACM; 2024." apa: "Hu, H., Liu, F., Pei, Q., Yuan, Y., Xu, Z., & Wang, L. (2024). \U0001D706Grapher: A Resource-Efficient Serverless System for GNN Serving through Graph Sharing. Proceedings of the ACM Web Conference (WWW). ACM Web Conference (WWW), Singapore." bibtex: "@inproceedings{Hu_Liu_Pei_Yuan_Xu_Wang_2024, title={\U0001D706Grapher: A Resource-Efficient Serverless System for GNN Serving through Graph Sharing}, booktitle={Proceedings of the ACM Web Conference (WWW)}, publisher={ACM}, author={Hu, Haichuan and Liu, Fangming and Pei, Qiangyu and Yuan, Yongjie and Xu, Zichen and Wang, Lin}, year={2024} }" chicago: "Hu, Haichuan, Fangming Liu, Qiangyu Pei, Yongjie Yuan, Zichen Xu, and Lin Wang. “\U0001D706Grapher: A Resource-Efficient Serverless System for GNN Serving through Graph Sharing.” In Proceedings of the ACM Web Conference (WWW). ACM, 2024." ieee: "H. Hu, F. Liu, Q. Pei, Y. Yuan, Z. Xu, and L. Wang, “\U0001D706Grapher: A Resource-Efficient Serverless System for GNN Serving through Graph Sharing,” presented at the ACM Web Conference (WWW), Singapore, 2024." mla: "Hu, Haichuan, et al. “\U0001D706Grapher: A Resource-Efficient Serverless System for GNN Serving through Graph Sharing.” Proceedings of the ACM Web Conference (WWW), ACM, 2024." short: 'H. Hu, F. Liu, Q. Pei, Y. Yuan, Z. Xu, L. Wang, in: Proceedings of the ACM Web Conference (WWW), ACM, 2024.' conference: end_date: 2024-05-17 location: Singapore name: ACM Web Conference (WWW) start_date: 2024-05-13 date_created: 2024-01-23T20:34:27Z date_updated: 2024-01-23T20:35:20Z department: - _id: '34' - _id: '7' - _id: '75' language: - iso: eng publication: Proceedings of the ACM Web Conference (WWW) publisher: ACM status: public title: "\U0001D706Grapher: A Resource-Efficient Serverless System for GNN Serving through Graph Sharing" type: conference user_id: '102868' year: '2024' ... --- _id: '51160' abstract: - lang: eng text: "We rigorously derive novel and sharp finite-data error bounds for highly\r\nsample-efficient Extended Dynamic Mode Decomposition (EDMD) for both i.i.d. and\r\nergodic sampling. In particular, we show all results in a very general setting\r\nremoving most of the typically imposed assumptions such that, among others,\r\ndiscrete- and continuous-time stochastic processes as well as nonlinear partial\r\ndifferential equations are contained in the considered system class. Besides\r\nshowing an exponential rate for i.i.d. sampling, we prove, to the best of our\r\nknowledge, the first superlinear convergence rates for ergodic sampling of\r\ndeterministic systems. We verify sharpness of the derived error bounds by\r\nconducting numerical simulations for highly-complex applications from molecular\r\ndynamics and chaotic flame propagation." author: - first_name: Friedrich M. full_name: Philipp, Friedrich M. last_name: Philipp - first_name: Manuel full_name: Schaller, Manuel last_name: Schaller - first_name: Septimus full_name: Boshoff, Septimus last_name: Boshoff - first_name: Sebastian full_name: Peitz, Sebastian id: '47427' last_name: Peitz orcid: 0000-0002-3389-793X - first_name: Feliks full_name: Nüske, Feliks last_name: Nüske - first_name: Karl full_name: Worthmann, Karl last_name: Worthmann citation: ama: 'Philipp FM, Schaller M, Boshoff S, Peitz S, Nüske F, Worthmann K. Extended Dynamic Mode Decomposition: Sharp bounds on the sample  efficiency. arXiv:240202494. Published online 2024.' apa: 'Philipp, F. M., Schaller, M., Boshoff, S., Peitz, S., Nüske, F., & Worthmann, K. (2024). Extended Dynamic Mode Decomposition: Sharp bounds on the sample  efficiency. In arXiv:2402.02494.' bibtex: '@article{Philipp_Schaller_Boshoff_Peitz_Nüske_Worthmann_2024, title={Extended Dynamic Mode Decomposition: Sharp bounds on the sample  efficiency}, journal={arXiv:2402.02494}, author={Philipp, Friedrich M. and Schaller, Manuel and Boshoff, Septimus and Peitz, Sebastian and Nüske, Feliks and Worthmann, Karl}, year={2024} }' chicago: 'Philipp, Friedrich M., Manuel Schaller, Septimus Boshoff, Sebastian Peitz, Feliks Nüske, and Karl Worthmann. “Extended Dynamic Mode Decomposition: Sharp Bounds on the Sample  Efficiency.” ArXiv:2402.02494, 2024.' ieee: 'F. M. Philipp, M. Schaller, S. Boshoff, S. Peitz, F. Nüske, and K. Worthmann, “Extended Dynamic Mode Decomposition: Sharp bounds on the sample  efficiency,” arXiv:2402.02494. 2024.' mla: 'Philipp, Friedrich M., et al. “Extended Dynamic Mode Decomposition: Sharp Bounds on the Sample  Efficiency.” ArXiv:2402.02494, 2024.' short: F.M. Philipp, M. Schaller, S. Boshoff, S. Peitz, F. Nüske, K. Worthmann, ArXiv:2402.02494 (2024). date_created: 2024-02-06T08:52:21Z date_updated: 2024-02-06T08:52:44Z department: - _id: '655' external_id: arxiv: - '2402.02494' language: - iso: eng main_file_link: - open_access: '1' url: https://arxiv.org/pdf/2402.02494.pdf oa: '1' publication: arXiv:2402.02494 status: public title: 'Extended Dynamic Mode Decomposition: Sharp bounds on the sample efficiency' type: preprint user_id: '47427' year: '2024' ... --- _id: '51208' abstract: - lang: eng text: AbstractApproximation of subdifferentials is one of the main tasks when computing descent directions for nonsmooth optimization problems. In this article, we propose a bisection method for weakly lower semismooth functions which is able to compute new subgradients that improve a given approximation in case a direction with insufficient descent was computed. Combined with a recently proposed deterministic gradient sampling approach, this yields a deterministic and provably convergent way to approximate subdifferentials for computing descent directions. author: - first_name: Bennet full_name: Gebken, Bennet id: '32643' last_name: Gebken citation: ama: Gebken B. A note on the convergence of deterministic gradient sampling in nonsmooth optimization. Computational Optimization and Applications. Published online 2024. doi:10.1007/s10589-024-00552-0 apa: Gebken, B. (2024). A note on the convergence of deterministic gradient sampling in nonsmooth optimization. Computational Optimization and Applications. https://doi.org/10.1007/s10589-024-00552-0 bibtex: '@article{Gebken_2024, title={A note on the convergence of deterministic gradient sampling in nonsmooth optimization}, DOI={10.1007/s10589-024-00552-0}, journal={Computational Optimization and Applications}, publisher={Springer Science and Business Media LLC}, author={Gebken, Bennet}, year={2024} }' chicago: Gebken, Bennet. “A Note on the Convergence of Deterministic Gradient Sampling in Nonsmooth Optimization.” Computational Optimization and Applications, 2024. https://doi.org/10.1007/s10589-024-00552-0. ieee: 'B. Gebken, “A note on the convergence of deterministic gradient sampling in nonsmooth optimization,” Computational Optimization and Applications, 2024, doi: 10.1007/s10589-024-00552-0.' mla: Gebken, Bennet. “A Note on the Convergence of Deterministic Gradient Sampling in Nonsmooth Optimization.” Computational Optimization and Applications, Springer Science and Business Media LLC, 2024, doi:10.1007/s10589-024-00552-0. short: B. Gebken, Computational Optimization and Applications (2024). date_created: 2024-02-07T07:23:23Z date_updated: 2024-02-08T08:05:54Z department: - _id: '101' doi: 10.1007/s10589-024-00552-0 keyword: - Applied Mathematics - Computational Mathematics - Control and Optimization language: - iso: eng publication: Computational Optimization and Applications publication_identifier: issn: - 0926-6003 - 1573-2894 publication_status: published publisher: Springer Science and Business Media LLC status: public title: A note on the convergence of deterministic gradient sampling in nonsmooth optimization type: journal_article user_id: '32643' year: '2024' ... --- _id: '51204' abstract: - lang: eng text: "Given a real semisimple connected Lie group $G$ and a discrete torsion-free\r\nsubgroup $\\Gamma < G$ we prove a precise connection between growth rates of the\r\ngroup $\\Gamma$, polyhedral bounds on the joint spectrum of the ring of\r\ninvariant differential operators, and the decay of matrix coefficients. In\r\nparticular, this allows us to completely characterize temperedness of\r\n$L^2(\\Gamma\\backslash G)$ in this general setting." author: - first_name: Christopher full_name: Lutsko, Christopher last_name: Lutsko - first_name: Tobias full_name: Weich, Tobias last_name: Weich - first_name: Lasse Lennart full_name: Wolf, Lasse Lennart id: '45027' last_name: Wolf citation: ama: Lutsko C, Weich T, Wolf LL. Polyhedral bounds on the joint spectrum and temperedness of locally  symmetric spaces. arXiv:240202530. Published online 2024. apa: Lutsko, C., Weich, T., & Wolf, L. L. (2024). Polyhedral bounds on the joint spectrum and temperedness of locally  symmetric spaces. In arXiv:2402.02530. bibtex: '@article{Lutsko_Weich_Wolf_2024, title={Polyhedral bounds on the joint spectrum and temperedness of locally  symmetric spaces}, journal={arXiv:2402.02530}, author={Lutsko, Christopher and Weich, Tobias and Wolf, Lasse Lennart}, year={2024} }' chicago: Lutsko, Christopher, Tobias Weich, and Lasse Lennart Wolf. “Polyhedral Bounds on the Joint Spectrum and Temperedness of Locally  Symmetric Spaces.” ArXiv:2402.02530, 2024. ieee: C. Lutsko, T. Weich, and L. L. Wolf, “Polyhedral bounds on the joint spectrum and temperedness of locally  symmetric spaces,” arXiv:2402.02530. 2024. mla: Lutsko, Christopher, et al. “Polyhedral Bounds on the Joint Spectrum and Temperedness of Locally  Symmetric Spaces.” ArXiv:2402.02530, 2024. short: C. Lutsko, T. Weich, L.L. Wolf, ArXiv:2402.02530 (2024). date_created: 2024-02-06T20:35:36Z date_updated: 2024-02-11T19:56:35Z department: - _id: '10' - _id: '623' - _id: '548' external_id: arxiv: - '2402.02530' language: - iso: eng publication: arXiv:2402.02530 status: public title: Polyhedral bounds on the joint spectrum and temperedness of locally symmetric spaces type: preprint user_id: '49178' year: '2024' ... --- _id: '51374' article_number: '110319' author: - first_name: David full_name: Hasler, David last_name: Hasler - first_name: Benjamin full_name: Hinrichs, Benjamin id: '99427' last_name: Hinrichs orcid: 0000-0001-9074-1205 - first_name: Oliver full_name: Siebert, Oliver last_name: Siebert citation: ama: Hasler D, Hinrichs B, Siebert O. Non-Fock ground states in the translation-invariant Nelson model revisited non-perturbatively. Journal of Functional Analysis. 2024;286(7). doi:10.1016/j.jfa.2024.110319 apa: Hasler, D., Hinrichs, B., & Siebert, O. (2024). Non-Fock ground states in the translation-invariant Nelson model revisited non-perturbatively. Journal of Functional Analysis, 286(7), Article 110319. https://doi.org/10.1016/j.jfa.2024.110319 bibtex: '@article{Hasler_Hinrichs_Siebert_2024, title={Non-Fock ground states in the translation-invariant Nelson model revisited non-perturbatively}, volume={286}, DOI={10.1016/j.jfa.2024.110319}, number={7110319}, journal={Journal of Functional Analysis}, publisher={Elsevier BV}, author={Hasler, David and Hinrichs, Benjamin and Siebert, Oliver}, year={2024} }' chicago: Hasler, David, Benjamin Hinrichs, and Oliver Siebert. “Non-Fock Ground States in the Translation-Invariant Nelson Model Revisited Non-Perturbatively.” Journal of Functional Analysis 286, no. 7 (2024). https://doi.org/10.1016/j.jfa.2024.110319. ieee: 'D. Hasler, B. Hinrichs, and O. Siebert, “Non-Fock ground states in the translation-invariant Nelson model revisited non-perturbatively,” Journal of Functional Analysis, vol. 286, no. 7, Art. no. 110319, 2024, doi: 10.1016/j.jfa.2024.110319.' mla: Hasler, David, et al. “Non-Fock Ground States in the Translation-Invariant Nelson Model Revisited Non-Perturbatively.” Journal of Functional Analysis, vol. 286, no. 7, 110319, Elsevier BV, 2024, doi:10.1016/j.jfa.2024.110319. short: D. Hasler, B. Hinrichs, O. Siebert, Journal of Functional Analysis 286 (2024). date_created: 2024-02-18T12:31:28Z date_updated: 2024-02-18T12:32:23Z department: - _id: '799' doi: 10.1016/j.jfa.2024.110319 extern: '1' external_id: arxiv: - '2302.06998' intvolume: ' 286' issue: '7' keyword: - Analysis language: - iso: eng publication: Journal of Functional Analysis publication_identifier: issn: - 0022-1236 publication_status: published publisher: Elsevier BV status: public title: Non-Fock ground states in the translation-invariant Nelson model revisited non-perturbatively type: journal_article user_id: '99427' volume: 286 year: '2024' ... --- _id: '32101' author: - first_name: Tobias full_name: Weich, Tobias id: '49178' last_name: Weich orcid: 0000-0002-9648-6919 - first_name: Yannick full_name: Guedes Bonthonneau, Yannick last_name: Guedes Bonthonneau - first_name: Colin full_name: Guillarmou, Colin last_name: Guillarmou - first_name: Joachim full_name: Hilgert, Joachim id: '220' last_name: Hilgert citation: ama: Weich T, Guedes Bonthonneau Y, Guillarmou C, Hilgert J. Ruelle-Taylor resonaces of Anosov actions. J Europ Math Soc. Published online 2024:1-36. apa: Weich, T., Guedes Bonthonneau, Y., Guillarmou, C., & Hilgert, J. (2024). Ruelle-Taylor resonaces of Anosov actions. J. Europ. Math. Soc., 1–36. bibtex: '@article{Weich_Guedes Bonthonneau_Guillarmou_Hilgert_2024, title={Ruelle-Taylor resonaces of Anosov actions}, journal={J. Europ. Math. Soc.}, author={Weich, Tobias and Guedes Bonthonneau, Yannick and Guillarmou, Colin and Hilgert, Joachim}, year={2024}, pages={1–36} }' chicago: Weich, Tobias, Yannick Guedes Bonthonneau, Colin Guillarmou, and Joachim Hilgert. “Ruelle-Taylor Resonaces of Anosov Actions.” J. Europ. Math. Soc., 2024, 1–36. ieee: T. Weich, Y. Guedes Bonthonneau, C. Guillarmou, and J. Hilgert, “Ruelle-Taylor resonaces of Anosov actions,” J. Europ. Math. Soc., pp. 1–36, 2024. mla: Weich, Tobias, et al. “Ruelle-Taylor Resonaces of Anosov Actions.” J. Europ. Math. Soc., 2024, pp. 1–36. short: T. Weich, Y. Guedes Bonthonneau, C. Guillarmou, J. Hilgert, J. Europ. Math. Soc. (2024) 1–36. date_created: 2022-06-22T09:56:51Z date_updated: 2024-02-19T06:25:13Z ddc: - '510' department: - _id: '10' - _id: '623' - _id: '548' - _id: '91' file: - access_level: open_access content_type: application/pdf creator: weich date_created: 2022-06-22T09:56:47Z date_updated: 2022-06-22T09:56:47Z file_id: '32102' file_name: 2007.14275.pdf file_size: 796410 relation: main_file file_date_updated: 2022-06-22T09:56:47Z has_accepted_license: '1' language: - iso: eng oa: '1' page: 1-36 publication: J. Europ. Math. Soc. publication_status: published status: public title: Ruelle-Taylor resonaces of Anosov actions type: journal_article user_id: '49063' year: '2024' ... --- _id: '51501' author: - first_name: Joachim full_name: Hilgert, Joachim id: '220' last_name: Hilgert citation: ama: Hilgert J. Quantum-Classical Correspondences for Locally Symmetric Spaces. Published online 2024. apa: Hilgert, J. (2024). Quantum-Classical Correspondences for Locally Symmetric Spaces. bibtex: '@article{Hilgert_2024, title={Quantum-Classical Correspondences for Locally Symmetric Spaces}, author={Hilgert, Joachim}, year={2024} }' chicago: Hilgert, Joachim. “Quantum-Classical Correspondences for Locally Symmetric Spaces,” 2024. ieee: J. Hilgert, “Quantum-Classical Correspondences for Locally Symmetric Spaces.” 2024. mla: Hilgert, Joachim. Quantum-Classical Correspondences for Locally Symmetric Spaces. 2024. short: J. Hilgert, (2024). date_created: 2024-02-19T10:31:51Z date_updated: 2024-02-19T10:32:07Z department: - _id: '91' language: - iso: eng main_file_link: - open_access: '1' url: https://arxiv.org/pdf/2303.00578.pdf oa: '1' publication_status: published status: public title: Quantum-Classical Correspondences for Locally Symmetric Spaces type: preprint user_id: '49063' year: '2024' ... --- _id: '46019' abstract: - lang: eng text: We derive efficient algorithms to compute weakly Pareto optimal solutions for smooth, convex and unconstrained multiobjective optimization problems in general Hilbert spaces. To this end, we define a novel inertial gradient-like dynamical system in the multiobjective setting, which trajectories converge weakly to Pareto optimal solutions. Discretization of this system yields an inertial multiobjective algorithm which generates sequences that converge weakly to Pareto optimal solutions. We employ Nesterov acceleration to define an algorithm with an improved convergence rate compared to the plain multiobjective steepest descent method (Algorithm 1). A further improvement in terms of efficiency is achieved by avoiding the solution of a quadratic subproblem to compute a common step direction for all objective functions, which is usually required in first-order methods. Using a different discretization of our inertial gradient-like dynamical system, we obtain an accelerated multiobjective gradient method that does not require the solution of a subproblem in each step (Algorithm 2). While this algorithm does not converge in general, it yields good results on test problems while being faster than standard steepest descent. author: - first_name: Konstantin full_name: Sonntag, Konstantin id: '56399' last_name: Sonntag orcid: https://orcid.org/0000-0003-3384-3496 - first_name: Sebastian full_name: Peitz, Sebastian id: '47427' last_name: Peitz orcid: 0000-0002-3389-793X citation: ama: Sonntag K, Peitz S. Fast Multiobjective Gradient Methods with Nesterov Acceleration via Inertial Gradient-Like Systems. Journal of Optimization Theory and Applications. Published online 2024. doi:10.1007/s10957-024-02389-3 apa: Sonntag, K., & Peitz, S. (2024). Fast Multiobjective Gradient Methods with Nesterov Acceleration via Inertial Gradient-Like Systems. Journal of Optimization Theory and Applications. https://doi.org/10.1007/s10957-024-02389-3 bibtex: '@article{Sonntag_Peitz_2024, title={Fast Multiobjective Gradient Methods with Nesterov Acceleration via Inertial Gradient-Like Systems}, DOI={10.1007/s10957-024-02389-3}, journal={Journal of Optimization Theory and Applications}, publisher={Springer}, author={Sonntag, Konstantin and Peitz, Sebastian}, year={2024} }' chicago: Sonntag, Konstantin, and Sebastian Peitz. “Fast Multiobjective Gradient Methods with Nesterov Acceleration via Inertial Gradient-Like Systems.” Journal of Optimization Theory and Applications, 2024. https://doi.org/10.1007/s10957-024-02389-3. ieee: 'K. Sonntag and S. Peitz, “Fast Multiobjective Gradient Methods with Nesterov Acceleration via Inertial Gradient-Like Systems,” Journal of Optimization Theory and Applications, 2024, doi: 10.1007/s10957-024-02389-3.' mla: Sonntag, Konstantin, and Sebastian Peitz. “Fast Multiobjective Gradient Methods with Nesterov Acceleration via Inertial Gradient-Like Systems.” Journal of Optimization Theory and Applications, Springer, 2024, doi:10.1007/s10957-024-02389-3. short: K. Sonntag, S. Peitz, Journal of Optimization Theory and Applications (2024). date_created: 2023-07-12T06:35:58Z date_updated: 2024-02-21T10:13:33Z department: - _id: '101' - _id: '655' doi: 10.1007/s10957-024-02389-3 language: - iso: eng main_file_link: - open_access: '1' url: https://link.springer.com/content/pdf/10.1007/s10957-024-02389-3.pdf oa: '1' publication: Journal of Optimization Theory and Applications publication_status: published publisher: Springer status: public title: Fast Multiobjective Gradient Methods with Nesterov Acceleration via Inertial Gradient-Like Systems type: journal_article user_id: '56399' year: '2024' ...