{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,5]],"date-time":"2025-11-05T13:55:55Z","timestamp":1762350955428,"version":"build-2065373602"},"reference-count":50,"publisher":"Walter de Gruyter GmbH","issue":"3","license":[{"start":{"date-parts":[[2025,1,15]],"date-time":"2025-01-15T00:00:00Z","timestamp":1736899200000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/creativecommons.org\/licenses\/by\/4.0"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2025,9,25]]},"abstract":"<jats:title>Abstract<\/jats:title>\n                  <jats:p>\n                    We propose an approach for the\n                    <jats:inline-formula id=\"j_jnma-2023-0115_ineq_002\">\n                      <jats:alternatives>\n                        <m:math xmlns:m=\"http:\/\/www.w3.org\/1998\/Math\/MathML\">\n                          <m:msub>\n                            <m:mrow>\n                              <m:mi mathvariant=\"script\">L<\/m:mi>\n                            <\/m:mrow>\n                            <m:mrow>\n                              <m:mi>\u221e<\/m:mi>\n                            <\/m:mrow>\n                          <\/m:msub>\n                        <\/m:math>\n                        <jats:tex-math>${\\mathcal{L}}_{\\infty }$<\/jats:tex-math>\n                        <jats:inline-graphic xmlns:xlink=\"http:\/\/www.w3.org\/1999\/xlink\" xlink:href=\"graphic\/j_jnma-2023-0115_ineq_002.png\"\/>\n                      <\/jats:alternatives>\n                    <\/jats:inline-formula>\n                    model reduction of descriptor systems based on the minimization of the\n                    <jats:inline-formula id=\"j_jnma-2023-0115_ineq_003\">\n                      <jats:alternatives>\n                        <m:math xmlns:m=\"http:\/\/www.w3.org\/1998\/Math\/MathML\">\n                          <m:msub>\n                            <m:mrow>\n                              <m:mi mathvariant=\"script\">L<\/m:mi>\n                            <\/m:mrow>\n                            <m:mrow>\n                              <m:mi>\u221e<\/m:mi>\n                            <\/m:mrow>\n                          <\/m:msub>\n                        <\/m:math>\n                        <jats:tex-math>${\\mathcal{L}}_{\\infty }$<\/jats:tex-math>\n                        <jats:inline-graphic xmlns:xlink=\"http:\/\/www.w3.org\/1999\/xlink\" xlink:href=\"graphic\/j_jnma-2023-0115_ineq_003.png\"\/>\n                      <\/jats:alternatives>\n                    <\/jats:inline-formula>\n                    objective by means of smooth optimization techniques. Direct applications of smooth optimization techniques are not feasible even for systems of modest order, since the optimization techniques converge at best at a linear rate requiring too many evaluations of the costly\n                    <jats:inline-formula id=\"j_jnma-2023-0115_ineq_004\">\n                      <jats:alternatives>\n                        <m:math xmlns:m=\"http:\/\/www.w3.org\/1998\/Math\/MathML\">\n                          <m:msub>\n                            <m:mrow>\n                              <m:mi mathvariant=\"script\">L<\/m:mi>\n                            <\/m:mrow>\n                            <m:mrow>\n                              <m:mi>\u221e<\/m:mi>\n                            <\/m:mrow>\n                          <\/m:msub>\n                        <\/m:math>\n                        <jats:tex-math>${\\mathcal{L}}_{\\infty }$<\/jats:tex-math>\n                        <jats:inline-graphic xmlns:xlink=\"http:\/\/www.w3.org\/1999\/xlink\" xlink:href=\"graphic\/j_jnma-2023-0115_ineq_004.png\"\/>\n                      <\/jats:alternatives>\n                    <\/jats:inline-formula>\n                    -norm\u202fobjective to be practical. We replace the original system with a system of smaller order interpolating the original system at points on the imaginary axis, minimize the\n                    <jats:inline-formula id=\"j_jnma-2023-0115_ineq_005\">\n                      <jats:alternatives>\n                        <m:math xmlns:m=\"http:\/\/www.w3.org\/1998\/Math\/MathML\">\n                          <m:msub>\n                            <m:mrow>\n                              <m:mi mathvariant=\"script\">L<\/m:mi>\n                            <\/m:mrow>\n                            <m:mrow>\n                              <m:mi>\u221e<\/m:mi>\n                            <\/m:mrow>\n                          <\/m:msub>\n                        <\/m:math>\n                        <jats:tex-math>${\\mathcal{L}}_{\\infty }$<\/jats:tex-math>\n                        <jats:inline-graphic xmlns:xlink=\"http:\/\/www.w3.org\/1999\/xlink\" xlink:href=\"graphic\/j_jnma-2023-0115_ineq_005.png\"\/>\n                      <\/jats:alternatives>\n                    <\/jats:inline-formula>\n                    objective after this replacement, and refine the smaller system based on the minimization. We also describe how asymptotic stability constraints on the reduced system sought can be incorporated into our approach. The numerical experiments illustrate that the approach leads to locally optimal solutions to the\n                    <jats:inline-formula id=\"j_jnma-2023-0115_ineq_006\">\n                      <jats:alternatives>\n                        <m:math xmlns:m=\"http:\/\/www.w3.org\/1998\/Math\/MathML\">\n                          <m:msub>\n                            <m:mrow>\n                              <m:mi mathvariant=\"script\">L<\/m:mi>\n                            <\/m:mrow>\n                            <m:mrow>\n                              <m:mi>\u221e<\/m:mi>\n                            <\/m:mrow>\n                          <\/m:msub>\n                        <\/m:math>\n                        <jats:tex-math>${\\mathcal{L}}_{\\infty }$<\/jats:tex-math>\n                        <jats:inline-graphic xmlns:xlink=\"http:\/\/www.w3.org\/1999\/xlink\" xlink:href=\"graphic\/j_jnma-2023-0115_ineq_006.png\"\/>\n                      <\/jats:alternatives>\n                    <\/jats:inline-formula>\n                    model reduction problem, and its capability to deal with systems of order a few ten thousands.\n                  <\/jats:p>","DOI":"10.1515\/jnma-2023-0115","type":"journal-article","created":{"date-parts":[[2025,1,15]],"date-time":"2025-01-15T23:11:51Z","timestamp":1736982711000},"page":"211-239","source":"Crossref","is-referenced-by-count":0,"title":["A subspace framework for\n                    <i>L<\/i>\n                    <sub>\u221e<\/sub>\n                    model reduction"],"prefix":"10.1515","volume":"33","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-0788-0066","authenticated-orcid":false,"given":"Emre","family":"Mengi","sequence":"first","affiliation":[{"name":"Department of Mathematics , Ko\u00e7 University , Rumeli Feneri Yolu 34450, Sar\u0131yer , Istanbul , T\u00fcrkiye"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"374","published-online":{"date-parts":[[2025,1,15]]},"reference":[{"key":"2025110513502253802_j_jnma-2023-0115_ref_001","doi-asserted-by":"crossref","unstructured":"K. E. Brenan, S. L. Campbell, and L. R. Petzold, Numerical Solution of Initial-Value Problems in Differential-Algebraic Equations, 2nd ed. Philadelphia, PA, SIAM, 1996.","DOI":"10.1137\/1.9781611971224"},{"key":"2025110513502253802_j_jnma-2023-0115_ref_002","doi-asserted-by":"crossref","unstructured":"Y. Feng and M. Yagoubi, Robust Control of Linear Descriptor Systems, Singapore, Springer, 2017.","DOI":"10.1007\/978-981-10-3677-4"},{"key":"2025110513502253802_j_jnma-2023-0115_ref_003","doi-asserted-by":"crossref","unstructured":"P. Kunkel and V. Mehrmann, Differential-Algebraic Equations: Analysis and Numerical Solution, Zurich, Switzerland, EMS Press, 2006.","DOI":"10.4171\/017"},{"key":"2025110513502253802_j_jnma-2023-0115_ref_004","doi-asserted-by":"crossref","unstructured":"R. Riaza, Differential Algebraic Systems. Analytical Aspects and Circuit Applications. Notes on Mathematics and its Applications, Singapore, World Scientific, 2008.","DOI":"10.1142\/9789812791818"},{"key":"2025110513502253802_j_jnma-2023-0115_ref_005","doi-asserted-by":"crossref","unstructured":"A. C. Antoulas, Approximation of Large-Scale Dynamical Systems, Volume 6 of Adv. Des. Control, Philadelphia, PA, SIAM Publications, 2005.","DOI":"10.1137\/1.9780898718713"},{"key":"2025110513502253802_j_jnma-2023-0115_ref_006","doi-asserted-by":"crossref","unstructured":"V. Mehrmann and T. Stykel, \u201cBalanced truncation model reduction for large-scale systems in descriptor form,\u201d in Dimension Reduction of Large-Scale Systems, P. Benner, D. C. Sorensen, and V. Mehrmann, Eds., Berlin, Springer, vol. 45, 2005, pp.\u00a083\u2013115.","DOI":"10.1007\/3-540-27909-1_3"},{"key":"2025110513502253802_j_jnma-2023-0115_ref_007","doi-asserted-by":"crossref","unstructured":"B. Moore, \u201cPrincipal component analysis in linear systems: controllability, observability, and model reduction,\u201d IEEE Trans. Autom. Control, vol.\u00a026, no.\u00a01, pp.\u00a017\u201332, 1981. https:\/\/doi.org\/10.1109\/tac.1981.1102568.","DOI":"10.1109\/TAC.1981.1102568"},{"key":"2025110513502253802_j_jnma-2023-0115_ref_008","doi-asserted-by":"crossref","unstructured":"T. Stykel, \u201cGramian-based model reduction for descriptor systems,\u201d Math. Contol Signals Syst., vol.\u00a016, no.\u00a04, pp.\u00a0297\u2013319, 2004. https:\/\/doi.org\/10.1007\/s00498-004-0141-4.","DOI":"10.1007\/s00498-004-0141-4"},{"key":"2025110513502253802_j_jnma-2023-0115_ref_009","doi-asserted-by":"crossref","unstructured":"S. Gugercin and A. C. Antoulas, \u201cA survey of model reduction by balanced truncation and some new results,\u201d Int. J. Control, vol.\u00a077, no.\u00a08, pp.\u00a0748\u2013766, 2004. https:\/\/doi.org\/10.1080\/00207170410001713448.","DOI":"10.1080\/00207170410001713448"},{"key":"2025110513502253802_j_jnma-2023-0115_ref_010","doi-asserted-by":"crossref","unstructured":"S. Gugercin, D. C. Sorensen, and A. C. Antoulas, \u201cA modified low-rank Smith method for large-scale Lyapunov equations,\u201d Numer. Algorithm., vol.\u00a032, no.\u00a01, pp.\u00a027\u201355, 2003. https:\/\/doi.org\/10.1023\/a:1022205420182.","DOI":"10.1023\/A:1022205420182"},{"key":"2025110513502253802_j_jnma-2023-0115_ref_011","doi-asserted-by":"crossref","unstructured":"T. Penzl, \u201cA cyclic low-rank Smith method for large sparse Lyapunov equations,\u201d SIAM J. Sci. Comput., vol.\u00a021, no.\u00a04, pp.\u00a01401\u20131418, 1999. https:\/\/doi.org\/10.1137\/s1064827598347666.","DOI":"10.1137\/S1064827598347666"},{"key":"2025110513502253802_j_jnma-2023-0115_ref_012","doi-asserted-by":"crossref","unstructured":"K. Glover, \u201cAll optimal hankel-norm\u202fapproximations of linear multivariable systems and their L\u221e${\\mathcal{L}}_{\\infty }$-error bounds,\u201d Int. J. Control, vol.\u00a039, no.\u00a06, pp.\u00a01115\u20131193, 1984. https:\/\/doi.org\/10.1080\/00207178408933239.","DOI":"10.1080\/00207178408933239"},{"key":"2025110513502253802_j_jnma-2023-0115_ref_013","doi-asserted-by":"crossref","unstructured":"P. Benner and S. W. R. Werner, \u201cHankel-norm\u202fapproximation of large-scale descriptor systems,\u201d Adv. Comput. Math., vol.\u00a046, Art.no.\u00a040, 2020, https:\/\/doi.org\/10.1007\/s10444-020-09750-w.","DOI":"10.1007\/s10444-020-09750-w"},{"key":"2025110513502253802_j_jnma-2023-0115_ref_014","doi-asserted-by":"crossref","unstructured":"P. Benner, E. S. Quintana-Orti, and G. Quintana-Orti, \u201cComputing optimal hankel norm\u202fapproximations of large-scale systems,\u201d in Proceedings of 43rd IEEE Conference on Decision and Control, vol.\u00a03, 2004, pp.\u00a03078\u20133083.","DOI":"10.1109\/CDC.2004.1428939"},{"key":"2025110513502253802_j_jnma-2023-0115_ref_015","doi-asserted-by":"crossref","unstructured":"S. Gugercin, A. C. Antoulas, and C. Beattie, \u201c\n\n\n\n\nH\n\n\n2\n\n\n\n\n${\\mathcal{H}}_{2}$\n\n\n\n model reduction for large-scale linear dynamical systems,\u201d SIAM J. Matrix Anal. Appl., vol.\u00a030, no.\u00a02, pp.\u00a0609\u2013638, 2008. https:\/\/doi.org\/10.1137\/060666123.","DOI":"10.1137\/060666123"},{"key":"2025110513502253802_j_jnma-2023-0115_ref_016","doi-asserted-by":"crossref","unstructured":"G. Flagg, C. A. Beattie, and S. Gugercin, \u201cInterpolatory H\u221e model reduction,\u201d Syst. Control Lett., vol.\u00a062, no.\u00a07, pp.\u00a0567\u2013574, 2013. https:\/\/doi.org\/10.1016\/j.sysconle.2013.03.006.","DOI":"10.1016\/j.sysconle.2013.03.006"},{"key":"2025110513502253802_j_jnma-2023-0115_ref_017","unstructured":"C. K. Krzysztof, Methods of Descent for Nondifferentiable Optimization, Berlin, New York, Springer-Verlag, 1985."},{"key":"2025110513502253802_j_jnma-2023-0115_ref_018","doi-asserted-by":"crossref","unstructured":"M. M. M\u00e4kel\u00e4 and P. Neittaanm\u00e4ki, Nonsmooth Optimization: Analysis and Algorithms with Applications to Optimal Control, Singapore, World Scientific, 1992.","DOI":"10.1142\/1493"},{"key":"2025110513502253802_j_jnma-2023-0115_ref_019","doi-asserted-by":"crossref","unstructured":"J. V. Burke, A. S. Lewis, and M. L. Overton, \u201cTwo numerical methods for optimizing matrix stability,\u201d Linear Algebra Appl., vols. 351\u2013352, pp.\u00a0117\u2013145, 2002, https:\/\/doi.org\/10.1016\/s0024-3795(02)00260-4.","DOI":"10.1016\/S0024-3795(02)00260-4"},{"key":"2025110513502253802_j_jnma-2023-0115_ref_020","doi-asserted-by":"crossref","unstructured":"J. V. Burke, A. S. Lewis, and M. L. Overton, \u201cA robust gradient sampling algorithm for nonsmooth, nonconvex optimization,\u201d SIAM J. Opt., vol.\u00a015, no.\u00a03, pp.\u00a0751\u2013779, 2005. https:\/\/doi.org\/10.1137\/030601296.","DOI":"10.1137\/030601296"},{"key":"2025110513502253802_j_jnma-2023-0115_ref_021","doi-asserted-by":"crossref","unstructured":"S. W. R. Werner, M. L. Overton, and B. Peherstorfer, \u201cMultifidelity robust controller design with gradient sampling,\u201d SIAM J. Sci. Comput., vol.\u00a045, no.\u00a02, pp.\u00a0A933\u2013A957, 2023. https:\/\/doi.org\/10.1137\/22m1500137.","DOI":"10.1137\/22M1500137"},{"key":"2025110513502253802_j_jnma-2023-0115_ref_022","doi-asserted-by":"crossref","unstructured":"A. Asl and M. L. Overton, \u201cAnalysis of the gradient method with an Armijo\u2013Wolfe line search on a class of non-smooth convex functions,\u201d Optim. Method Softw., vol.\u00a035, no.\u00a02, pp.\u00a0223\u2013242, 2020. https:\/\/doi.org\/10.1080\/10556788.2019.1673388.","DOI":"10.1080\/10556788.2019.1673388"},{"key":"2025110513502253802_j_jnma-2023-0115_ref_023","doi-asserted-by":"crossref","unstructured":"A. S. Lewis and M. L. Overton, \u201cNonsmooth optimization via quasi-Newton methods,\u201d Math. Program., vol.\u00a0141, nos. 1\u20132, pp.\u00a0135\u2013163, 2013, https:\/\/doi.org\/10.1007\/s10107-012-0514-2.","DOI":"10.1007\/s10107-012-0514-2"},{"key":"2025110513502253802_j_jnma-2023-0115_ref_024","unstructured":"C. Lemar\u00e9chal, Numerical Experiments in Nonsmooth Optimization, Laxenburg, Austria, International Institute for Applied System Analysis (IIASA), 1982, pp.\u00a061\u201384."},{"key":"2025110513502253802_j_jnma-2023-0115_ref_025","doi-asserted-by":"crossref","unstructured":"J. V. Burke, F. E. Curtis, A. S. Lewis, M. L. Overton, and L. E. A. Sim\u00f5es, \u201cGradient sampling methods for nonsmooth optimization,\u201d in Numerical Nonsmooth Optimization: State of the Art Algorithms, A. M. Bagirov, M. Gaudioso, N. Karmitsa, M. M. M\u00e4kel\u00e4, and S. Taheri, Eds., Cham, Switzerland, Springer International Publishing, 2020, pp.\u00a0201\u2013225.","DOI":"10.1007\/978-3-030-34910-3_6"},{"key":"2025110513502253802_j_jnma-2023-0115_ref_026","doi-asserted-by":"crossref","unstructured":"P. Schwerdtner and M. Voigt, \u201cSOBMOR: structured optimization-based model order reduction,\u201d SIAM J. Sci. Comput., vol.\u00a045, no.\u00a02, pp.\u00a0A502\u2013A529, 2023. https:\/\/doi.org\/10.1137\/20m1380235.","DOI":"10.1137\/20M1380235"},{"key":"2025110513502253802_j_jnma-2023-0115_ref_027","doi-asserted-by":"crossref","unstructured":"A. Megretski, \u201cH-infinity model reduction with guaranteed suboptimality bound,\u201d in 2006 American Control Conference, 2006, p.\u00a06.","DOI":"10.1109\/ACC.2006.1655397"},{"key":"2025110513502253802_j_jnma-2023-0115_ref_028","doi-asserted-by":"crossref","unstructured":"A. Aliyev, P. Benner, E. Mengi, and M. Voigt, \u201cA subspace framework for H-infinity norm\u202fminimization,\u201d SIAM J. Matrix Anal. Appl., vol.\u00a041, no.\u00a02, pp.\u00a0928\u2013956, 2020. https:\/\/doi.org\/10.1137\/19m125892x.","DOI":"10.1137\/19M125892X"},{"key":"2025110513502253802_j_jnma-2023-0115_ref_029","doi-asserted-by":"crossref","unstructured":"S. Chellappa, L. Feng, V. de la Rubia, and P. Benner, \u201cAdaptive interpolatory mor by learning the error estimator in the parameter domain,\u201d in Model Reduction of Complex Dynamical Systems, P. Benner, T. Breiten, H. Fa\u00dfbender, M. Hinze, T. Stykel, and R. Zimmermann, Eds., Cham, Switzerland, Birkhauser, 2021, pp.\u00a097\u2013117.","DOI":"10.1007\/978-3-030-72983-7_5"},{"key":"2025110513502253802_j_jnma-2023-0115_ref_030","doi-asserted-by":"crossref","unstructured":"L. Feng and P. Benner, \u201cA new error estimator for reduced-order modeling of linear parametric systems,\u201d IEEE Trans. Microw. Theory, vol.\u00a067, no.\u00a012, pp.\u00a04848\u20134859, 2019. https:\/\/doi.org\/10.1109\/tmtt.2019.2948858.","DOI":"10.1109\/TMTT.2019.2948858"},{"key":"2025110513502253802_j_jnma-2023-0115_ref_031","doi-asserted-by":"crossref","unstructured":"F. E. Curtis, T. Mitchell, and M. L. Overton, \u201cA BFGS-SQP method for nonsmooth, nonconvex, constrained optimization and its evaluation using relative minimization profiles,\u201d Optim. Method Softw., vol.\u00a032, no.\u00a01, pp.\u00a0148\u2013181, 2017. https:\/\/doi.org\/10.1080\/10556788.2016.1208749.","DOI":"10.1080\/10556788.2016.1208749"},{"key":"2025110513502253802_j_jnma-2023-0115_ref_032","doi-asserted-by":"crossref","unstructured":"F. E. Curtis and M. L. Overton, \u201cA sequential quadratic programming algorithm for nonconvex, nonsmooth constrained optimization,\u201d SIAM J. Opt., vol.\u00a022, no.\u00a02, pp.\u00a0474\u2013500, 2012. https:\/\/doi.org\/10.1137\/090780201.","DOI":"10.1137\/090780201"},{"key":"2025110513502253802_j_jnma-2023-0115_ref_033","doi-asserted-by":"crossref","unstructured":"P. Lancaster, \u201cOn eigenvalues of matrices dependent on a parameter,\u201d Numer. Math., vol.\u00a06, no.\u00a01, pp.\u00a0377\u2013387, 1964. https:\/\/doi.org\/10.1007\/bf01386087.","DOI":"10.1007\/BF01386087"},{"key":"2025110513502253802_j_jnma-2023-0115_ref_034","doi-asserted-by":"crossref","unstructured":"E. Mengi, E. A. Yildirim, and M. Kili\u00e7, \u201cNumerical optimization of eigenvalues of Hermitian matrix functions,\u201d SIAM J. Matrix Anal. Appl., vol.\u00a035, no.\u00a02, pp.\u00a0699\u2013724, 2014. https:\/\/doi.org\/10.1137\/130933472.","DOI":"10.1137\/130933472"},{"key":"2025110513502253802_j_jnma-2023-0115_ref_035","doi-asserted-by":"crossref","unstructured":"C. Beattie and S. Gugercin, \u201cInterpolatory projection methods for structure-preserving model reduction,\u201d Syst. Control Lett., vol.\u00a058, no.\u00a03, pp.\u00a0225\u2013232, 2009. https:\/\/doi.org\/10.1016\/j.sysconle.2008.10.016.","DOI":"10.1016\/j.sysconle.2008.10.016"},{"key":"2025110513502253802_j_jnma-2023-0115_ref_036","doi-asserted-by":"crossref","unstructured":"E. Mengi, \u201cLarge-scale estimation of dominant poles of a transfer function by an interpolatory framework,\u201d SIAM J. Sci. Comput., vol.\u00a044, no.\u00a04, pp.\u00a0A2412\u2013A2438, 2022. https:\/\/doi.org\/10.1137\/21m1434349.","DOI":"10.1137\/21M1434349"},{"key":"2025110513502253802_j_jnma-2023-0115_ref_037","doi-asserted-by":"crossref","unstructured":"S. Boyd and V. Balakrishnan, \u201cA regularity result for the singular values of a transfer matrix and a quadratically convergent algorithm for computing its L\u221e-norm,\u201d Syst. Control Lett., vol.\u00a015, no.\u00a01, pp.\u00a01\u20137, 1990. https:\/\/doi.org\/10.1016\/0167-6911(90)90037-u.","DOI":"10.1016\/0167-6911(90)90037-U"},{"key":"2025110513502253802_j_jnma-2023-0115_ref_038","doi-asserted-by":"crossref","unstructured":"N. A. Bruinsma and M. Steinbuch, \u201cA fast algorithm to compute the H\u221e-norm\u202fof a transfer function matrix,\u201d Syst. Control Lett., vol.\u00a014, no.\u00a04, pp.\u00a0287\u2013293, 1990. https:\/\/doi.org\/10.1016\/0167-6911(90)90049-z.","DOI":"10.1016\/0167-6911(90)90049-Z"},{"key":"2025110513502253802_j_jnma-2023-0115_ref_039","doi-asserted-by":"crossref","unstructured":"E. Mengi, \u201cLarge-scale and global maximization of the distance to instability,\u201d SIAM J. Matrix Anal. Appl., vol.\u00a039, no.\u00a04, pp.\u00a01776\u20131809, 2018. https:\/\/doi.org\/10.1137\/18m1177019.","DOI":"10.1137\/18M1177019"},{"key":"2025110513502253802_j_jnma-2023-0115_ref_040","doi-asserted-by":"crossref","unstructured":"K. Carlberg, R. Tuminaro, and P. Boggs, \u201cPreserving Lagrangian structure in nonlinear model reduction with application to structural dynamics,\u201d SIAM J. Sci. Comput., vol.\u00a037, no.\u00a02, pp.\u00a0B153\u2013B184, 2015. https:\/\/doi.org\/10.1137\/140959602.","DOI":"10.1137\/140959602"},{"key":"2025110513502253802_j_jnma-2023-0115_ref_041","doi-asserted-by":"crossref","unstructured":"I. Kalashnikova, B. van Bloemen Waanders, S. Arunajatesan, and M. Barone, \u201cStabilization of projection-based reduced order models for linear time-invariant systems via optimization-based eigenvalue reassignment,\u201d Comput. Methods Appl. Mech. Eng., vol.\u00a0272, pp.\u00a0251\u2013270, 2014, https:\/\/doi.org\/10.1016\/j.cma.2014.01.011.","DOI":"10.1016\/j.cma.2014.01.011"},{"key":"2025110513502253802_j_jnma-2023-0115_ref_042","doi-asserted-by":"crossref","unstructured":"G. Serre, P. Lafon, X. Gloerfelt, and C. Bailly, \u201cReliable reduced-order models for time-dependent linearized Euler equations,\u201d J. Comput. Phys., vol.\u00a0231, no.\u00a015, pp.\u00a05176\u20135194, 2012. https:\/\/doi.org\/10.1016\/j.jcp.2012.04.019.","DOI":"10.1016\/j.jcp.2012.04.019"},{"key":"2025110513502253802_j_jnma-2023-0115_ref_043","unstructured":"F. R. Gantmacher, The Theory of Matrices, vol.\u00a0II, New York, NY, USA, Chelsea Publishing Company, 1959."},{"key":"2025110513502253802_j_jnma-2023-0115_ref_044","doi-asserted-by":"crossref","unstructured":"A. Aliyev, P. Benner, E. Mengi, P. Schwerdtner, and M. Voigt, \u201cLarge-scale computation of L\u221e${\\mathcal{L}}_{\\infty }$-norms by a greedy subspace method,\u201d SIAM J. Matrix Anal. Appl., vol.\u00a038, no.\u00a04, pp.\u00a01496\u20131516, 2017. https:\/\/doi.org\/10.1137\/16m1086200.","DOI":"10.1137\/16M1086200"},{"key":"2025110513502253802_j_jnma-2023-0115_ref_045","doi-asserted-by":"crossref","unstructured":"P. Benner and T. Mitchell, \u201cFaster and more accurate computation of the H\u221e${\\mathcal{H}}_{\\infty }$ norm\u202fvia optimization,\u201d SIAM J. Sci. Comput., vol.\u00a040, no.\u00a05, pp.\u00a0A3609\u2013A3635, 2018. https:\/\/doi.org\/10.1137\/17m1137966.","DOI":"10.1137\/17M1137966"},{"key":"2025110513502253802_j_jnma-2023-0115_ref_046","unstructured":"T. Mitchell, \u201cROSTAPACK: RObust STAbility PACKage v3.0,\u201d 2024. http:\/\/www.timmitchell.com\/software\/ROSTAPACK\/."},{"key":"2025110513502253802_j_jnma-2023-0115_ref_047","unstructured":"P. Benner and S. W. R. Werner, \u201cMORLAB \u2013 model order reduction LABoratory (version 5.0),\u201d 2019. Available at: http:\/\/www.mpi-magdeburg.mpg.de\/projects\/morlab."},{"key":"2025110513502253802_j_jnma-2023-0115_ref_048","doi-asserted-by":"crossref","unstructured":"Y. Chahlaoui and P. Van Dooren, \u201cBenchmark examples for model reduction of linear time-invariant dynamical systems,\u201d in Dimension Reduction of Large-Scale Systems, P. Benner, D. C. Sorrenson and V. Mehrmann, Eds., Berlin, Springer, vol.\u00a045, 2005, pp.\u00a0379\u2013392.","DOI":"10.1007\/3-540-27909-1_24"},{"key":"2025110513502253802_j_jnma-2023-0115_ref_049","doi-asserted-by":"crossref","unstructured":"T. Penzl, \u201cAlgorithms for model reduction of large dynamical systems,\u201d Linear Algebra Appl., vol.\u00a0415, nos. 2\u20133, pp.\u00a0322\u2013343, 2006, https:\/\/doi.org\/10.1016\/j.laa.2006.01.007.","DOI":"10.1016\/j.laa.2006.01.007"},{"key":"2025110513502253802_j_jnma-2023-0115_ref_050","doi-asserted-by":"crossref","unstructured":"A. J. Mayo and A. C. Antoulas, \u201cA framework for the solution of the generalized realization problem,\u201d Linear Algebra Appl., vol.\u00a0425, nos. 2\u20133, pp.\u00a0634\u2013662, 2007, https:\/\/doi.org\/10.1016\/j.laa.2007.03.008.","DOI":"10.1016\/j.laa.2007.03.008"}],"container-title":["Journal of Numerical Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.degruyterbrill.com\/document\/doi\/10.1515\/jnma-2023-0115\/xml","content-type":"application\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/www.degruyterbrill.com\/document\/doi\/10.1515\/jnma-2023-0115\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,11,5]],"date-time":"2025-11-05T13:50:54Z","timestamp":1762350654000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.degruyterbrill.com\/document\/doi\/10.1515\/jnma-2023-0115\/html"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,1,15]]},"references-count":50,"journal-issue":{"issue":"3","published-online":{"date-parts":[[2025,2,24]]},"published-print":{"date-parts":[[2025,9,25]]}},"alternative-id":["10.1515\/jnma-2023-0115"],"URL":"https:\/\/doi.org\/10.1515\/jnma-2023-0115","relation":{},"ISSN":["1570-2820","1569-3953"],"issn-type":[{"type":"print","value":"1570-2820"},{"type":"electronic","value":"1569-3953"}],"subject":[],"published":{"date-parts":[[2025,1,15]]}}}