{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,26]],"date-time":"2026-02-26T20:40:03Z","timestamp":1772138403480,"version":"3.50.1"},"reference-count":20,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2024,7,22]],"date-time":"2024-07-22T00:00:00Z","timestamp":1721606400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,7,22]],"date-time":"2024-07-22T00:00:00Z","timestamp":1721606400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["NSFC-12071332, NSFC-12371380"],"award-info":[{"award-number":["NSFC-12071332, NSFC-12371380"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Jiangsu Shuangchuang Project","award":["JSSCTD202209"],"award-info":[{"award-number":["JSSCTD202209"]}]},{"name":"Postgraduate Research & Practice Innovation Program of Jiangsu Province","award":["KYCX23_3226"],"award-info":[{"award-number":["KYCX23_3226"]}]},{"DOI":"10.13039\/501100004543","name":"China Scholarship Council program","doi-asserted-by":"crossref","award":["202306920044"],"award-info":[{"award-number":["202306920044"]}],"id":[{"id":"10.13039\/501100004543","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Adv Comput Math"],"published-print":{"date-parts":[[2024,8]]},"DOI":"10.1007\/s10444-024-10177-w","type":"journal-article","created":{"date-parts":[[2024,7,22]],"date-time":"2024-07-22T07:01:51Z","timestamp":1721631711000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["The $$L_q$$-weighted dual programming of the linear Chebyshev approximation and an interior-point method"],"prefix":"10.1007","volume":"50","author":[{"given":"Yang","family":"Linyi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5349-8621","authenticated-orcid":false,"given":"Zhang","family":"Lei-Hong","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zhang","family":"Ya-Nan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2024,7,22]]},"reference":[{"key":"10177_CR1","doi-asserted-by":"crossref","unstructured":"Boyd, S., Vandenberghe, L.: Convex Optimization. Cambridge University Press (2004)","DOI":"10.1017\/CBO9780511804441"},{"key":"10177_CR2","doi-asserted-by":"publisher","first-page":"405","DOI":"10.1137\/19M130100X","volume":"63","author":"PD Brubeck","year":"2021","unstructured":"Brubeck, P.D., Nakatsukasa, Y., Trefethen, L.N.: Vandermonde with Arnoldi. SIAM Rev. 63, 405\u2013415 (2021)","journal-title":"SIAM Rev."},{"key":"10177_CR3","volume-title":"Introduction to Approximation Theory","author":"EW Cheney","year":"1982","unstructured":"Cheney, E.W.: Introduction to Approximation Theory, 2nd edn. Chelsea Publishing Company, New York (1982)","edition":"2"},{"key":"10177_CR4","first-page":"167","volume":"26","author":"AK Cline","year":"1972","unstructured":"Cline, A.K.: Rate of convergence of Lawson\u2019s algorithm. Math. Comp. 26, 167\u2013176 (1972)","journal-title":"Math. Comp."},{"key":"10177_CR5","unstructured":"Driscoll, T.\u00a0A., Hale, N., Trefethen, L.\u00a0N.: Chebfun User\u2019s Guide. Pafnuty Publications, Oxford (2014). See also www.chebfun.org"},{"key":"10177_CR6","first-page":"35","volume":"30","author":"S Ellacott","year":"1976","unstructured":"Ellacott, S., Williams, J.: Linear Chebyshev approximation in the complex plane using Lawson\u2019s algorithm. Math. Comp. 30, 35\u201344 (1976)","journal-title":"Math. Comp."},{"key":"10177_CR7","doi-asserted-by":"publisher","first-page":"A2427","DOI":"10.1137\/17M1132409","volume":"40","author":"S-I Filip","year":"2018","unstructured":"Filip, S.-I., Nakatsukasa, Y., Trefethen, L.N., Beckermann, B.: Rational minimax approximation via adaptive barycentric representations. SIAM J. Sci. Comput. 40, A2427\u2013A2455 (2018)","journal-title":"SIAM J. Sci. Comput."},{"key":"10177_CR8","doi-asserted-by":"publisher","DOI":"10.56021\/9781421407944","volume-title":"Matrix Computations","author":"GH Golub","year":"2013","unstructured":"Golub, G.H., Van Loan, C.F.: Matrix Computations, 4th edn. Johns Hopkins University Press, Baltimore, Maryland (2013)","edition":"4"},{"key":"10177_CR9","unstructured":"Lawson, C.\u00a0L.: Contributions to the Theory of Linear Least Maximum Approximations. PhD thesis, UCLA, USA (1961)"},{"key":"10177_CR10","volume-title":"Approximation of Functions","author":"GG Lorentz","year":"1966","unstructured":"Lorentz, G.G.: Approximation of Functions. Holt, Rinehart and Winston, New York (1966)"},{"key":"10177_CR11","doi-asserted-by":"publisher","first-page":"A1494","DOI":"10.1137\/16M1106122","volume":"40","author":"Y Nakatsukasa","year":"2018","unstructured":"Nakatsukasa, Y., S\u00e8te, O., Trefethen, L.N.: The AAA algorithm for rational approximation. SIAM J. Sci. Comput. 40, A1494\u2013A1522 (2018)","journal-title":"SIAM J. Sci. Comput."},{"key":"10177_CR12","doi-asserted-by":"publisher","first-page":"A3157","DOI":"10.1137\/19M1281897","volume":"42","author":"Y Nakatsukasa","year":"2020","unstructured":"Nakatsukasa, Y., Trefethen, L.N.: An algorithm for real and complex rational minimax approximation. SIAM J. Sci. Comput. 42, A3157\u2013A3179 (2020)","journal-title":"SIAM J. Sci. Comput."},{"key":"10177_CR13","volume-title":"Numerical Optimization","author":"J Nocedal","year":"2006","unstructured":"Nocedal, J., Wright, S.: Numerical Optimization, 2nd edn. Springer, New York (2006)","edition":"2"},{"key":"10177_CR14","unstructured":"Poussin, C.\u00a0D. L.\u00a0V.: Sur la m\u00e9thode de l\u00e1pproximation minimum. Soc. Sci. de Bruxelles, Annales, Seconde Partie, M\u00e9moires. 35, 1\u201316 (1911)"},{"key":"10177_CR15","unstructured":"Rice, J.\u00a0R.: The Approximation of Functions. Addison-Wesley publishing Company (1969)"},{"key":"10177_CR16","doi-asserted-by":"publisher","first-page":"118","DOI":"10.1090\/S0025-5718-1968-0232137-4","volume":"22","author":"JR Rice","year":"1968","unstructured":"Rice, J.R., Usow, K.H.: The Lawson algorithm and extensions. Math. Comp. 22, 118\u2013127 (1968)","journal-title":"Math. Comp."},{"key":"10177_CR17","doi-asserted-by":"publisher","first-page":"670","DOI":"10.1137\/0109056","volume":"9","author":"TJ Rivlin","year":"1961","unstructured":"Rivlin, T.J., Shapiro, H.S.: A unified approach to certain problems of approximation and minimization. J. Soc. Indust. Appl. Math. 9, 670\u2013699 (1961)","journal-title":"J. Soc. Indust. Appl. Math."},{"key":"10177_CR18","doi-asserted-by":"crossref","unstructured":"Trefethen, L.\u00a0N.: Approximation Theory and Approximation Practice, Extended Edition SIAM (2019)","DOI":"10.1137\/1.9781611975949"},{"key":"10177_CR19","doi-asserted-by":"publisher","first-page":"638","DOI":"10.1137\/0709053","volume":"9","author":"J Williams","year":"1972","unstructured":"Williams, J.: Numerical Chebyshev approximation in the complex plane. SIAM J. Numer. Anal. 9, 638\u2013649 (1972)","journal-title":"SIAM J. Numer. Anal."},{"key":"10177_CR20","doi-asserted-by":"publisher","unstructured":"Zhang, L.-H., Su, Y., Li, R.-C.: Accurate polynomial fitting and evaluation via Arnoldi. Numerical Algebra, Control and Optimization, to appear. https:\/\/doi.org\/10.3934\/naco.2023002","DOI":"10.3934\/naco.2023002"}],"container-title":["Advances in Computational Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10444-024-10177-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10444-024-10177-w\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10444-024-10177-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,8,27]],"date-time":"2024-08-27T07:55:19Z","timestamp":1724745319000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10444-024-10177-w"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,7,22]]},"references-count":20,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2024,8]]}},"alternative-id":["10177"],"URL":"https:\/\/doi.org\/10.1007\/s10444-024-10177-w","relation":{},"ISSN":["1019-7168","1572-9044"],"issn-type":[{"value":"1019-7168","type":"print"},{"value":"1572-9044","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,7,22]]},"assertion":[{"value":"8 June 2023","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"26 June 2024","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"22 July 2024","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare that they have no conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of Interest"}}],"article-number":"80"}}