{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T23:46:01Z","timestamp":1740181561740,"version":"3.37.3"},"reference-count":23,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2022,12,1]],"date-time":"2022-12-01T00:00:00Z","timestamp":1669852800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2022,12,1]],"date-time":"2022-12-01T00:00:00Z","timestamp":1669852800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["SN COMPUT. SCI."],"DOI":"10.1007\/s42979-022-01478-2","type":"journal-article","created":{"date-parts":[[2022,12,1]],"date-time":"2022-12-01T18:20:21Z","timestamp":1669918821000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["A New Algorithm for Linear Programming in Critical Systems"],"prefix":"10.1007","volume":"4","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-7333-2765","authenticated-orcid":false,"given":"Adrien","family":"Chan-Hon-Tong","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,12,1]]},"reference":[{"key":"1478_CR1","first-page":"140","volume":"2","author":"X Allamigeon","year":"2018","unstructured":"Allamigeon X, Benchimol P, Gaubert S, Joswig M. Log-barrier interior point methods are not strongly polynomial. J Appl Algebra Geom. 2018;2:140\u2013178.","journal-title":"J Appl Algebra Geom"},{"doi-asserted-by":"crossref","unstructured":"Ambainis A, Filmus Y, Le\u00a0Gall F. Fast matrix multiplication: limitations of the Coppersmith-Winograd method (extended abstract), STOC\u201915\u2014 Proceedings of the 2015 ACM Symposium on Theory of Computing, ACM, New York, 2015;3388238:585\u2013593.","key":"1478_CR2","DOI":"10.1145\/2746539.2746554"},{"doi-asserted-by":"crossref","unstructured":"Anderson ED, Gondzio J, M\u00e9sz\u00e1ros C, Xu X. Implementation of interior-point methods for large scale linear programs. In: Interior point methods of mathematical programming. Springer; 1996, p. 189\u2013252.","key":"1478_CR3","DOI":"10.1007\/978-1-4613-3449-1_6"},{"doi-asserted-by":"crossref","unstructured":"Boldo S. Floats and ropes: a case study for formal numerical program verification. In: International colloquium on automata, languages, and programming. Springer; 2009, p. 91\u2013102.","key":"1478_CR4","DOI":"10.1007\/978-3-642-02930-1_8"},{"doi-asserted-by":"crossref","unstructured":"Chan-Hon-Tong A. Solving linear programming while tackling number representation issues. In: Proceedings of the 11th International Conference on operations research and enterprise systems\u2013ICORES. INSTICC, SciTePress; 2022, p. 40\u20137. https:\/\/www.scitepress.org\/Papers\/2022\/108123\/","key":"1478_CR5","DOI":"10.5220\/0010812300003117"},{"issue":"2","key":"1478_CR6","doi-asserted-by":"publisher","first-page":"687","DOI":"10.1007\/s10107-014-0823-8","volume":"153","author":"S Chubanov","year":"2015","unstructured":"Chubanov S. A polynomial projection algorithm for linear feasibility problems. Math Progr. 2015;153(2):687\u2013713.","journal-title":"Math Progr"},{"doi-asserted-by":"crossref","unstructured":"Cohen MB, Lee YT, Song Z. Solving linear programs in the current matrix multiplication time. In: Proceedings of the 51st annual ACM SIGACT Symposium on theory of computing, 2019.","key":"1478_CR7","DOI":"10.1145\/3313276.3316303"},{"unstructured":"Cohen RP. Formal verification and validation of convex optimization algorithms for model predictive control. PhD thesis, Georgia Institute of Technology, 2018.","key":"1478_CR8"},{"issue":"1","key":"1478_CR9","doi-asserted-by":"publisher","first-page":"101","DOI":"10.1007\/s10107-007-0095-7","volume":"114","author":"J Dunagan","year":"2008","unstructured":"Dunagan J, Vempala S. A simple polynomial-time rescaling algorithm for solving linear programs. Math Progr. 2008;114(1):101\u201314.","journal-title":"Math Progr"},{"doi-asserted-by":"crossref","unstructured":"Fang XG, Havas G. On the worst-case complexity of integer gaussian elimination. In: Proceedings of the 1997 International Symposium on symbolic and algebraic computation, 1997; p. 28\u201331.","key":"1478_CR10","DOI":"10.1145\/258726.258740"},{"doi-asserted-by":"crossref","unstructured":"Feron EM, Cohen RP, Davy G, Garoche P-L. Validation of convex optimization algorithms and credible implementation for model predictive control. In: AIAA Information Systems-AIAA Infotech@ Aerospace, 2017; p. 0562.","key":"1478_CR11","DOI":"10.2514\/6.2017-0562"},{"key":"1478_CR12","doi-asserted-by":"publisher","first-page":"169","DOI":"10.1007\/BF02579273","volume":"1","author":"M Gr\u00f6tschel","year":"1981","unstructured":"Gr\u00f6tschel M, Lov\u00e1sz L, Schrijver A. The ellipsoid method and its consequences in combinatorial optimization. Combinatorica. 1981;1:169\u2013197.","journal-title":"Combinatorica"},{"key":"1478_CR13","volume-title":"Fundamentals of convex analysis","author":"J-B Hiriart-Urruty","year":"2004","unstructured":"Hiriart-Urruty J-B, Lemar\u00e9chal C. Fundamentals of convex analysis. Berlin: Springer Science & Business Media; 2004."},{"doi-asserted-by":"crossref","unstructured":"Karmarkar N. A new polynomial-time algorithm for linear programming. In: Proceedings of the Sixteenth Annual ACM Symposium on theory of computing, 1984.","key":"1478_CR14","DOI":"10.1145\/800057.808695"},{"unstructured":"Khachiyan L. A polynomial algorithm for linear programming. In: Doklady Akademii Nauk SSSR, 1979.","key":"1478_CR15"},{"issue":"16","key":"1478_CR16","first-page":"3215","volume":"42","author":"A Nemirovski","year":"2004","unstructured":"Nemirovski A. Interior point polynomial time methods in convex programming. Lect Notes. 2004;42(16):3215\u201324.","journal-title":"Lect Notes"},{"key":"1478_CR17","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611970791","volume-title":"Interior-point polynomial algorithms in convex programming","author":"Y Nesterov","year":"1994","unstructured":"Nesterov Y, Nemirovskii A. Interior-point polynomial algorithms in convex programming. Philadelphia: SIAM; 1994."},{"issue":"1\u20132","key":"1478_CR18","doi-asserted-by":"publisher","first-page":"497","DOI":"10.1007\/s10107-015-0860-y","volume":"155","author":"J Pe\u00f1a","year":"2016","unstructured":"Pe\u00f1a J, Soheili N. A deterministic rescaled perceptron algorithm. Math Progr. 2016;155(1\u20132):497\u2013510.","journal-title":"Math Progr"},{"issue":"1","key":"1478_CR19","doi-asserted-by":"publisher","first-page":"270","DOI":"10.1016\/j.cam.2008.11.012","volume":"230","author":"MD Petkovi\u0107","year":"2009","unstructured":"Petkovi\u0107 MD, Stanimirovi\u0107 PS. Generalized matrix inversion is not harder than matrix multiplication. J Comput Appl Math. 2009;230(1):270\u201382.","journal-title":"J Comput Appl Math"},{"issue":"1","key":"1478_CR20","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1007\/BF01580724","volume":"40","author":"J Renegar","year":"1988","unstructured":"Renegar J. A polynomial-time algorithm, based on newton\u2019s method, for linear programming. Math Progr. 1988;40(1):59\u201393.","journal-title":"Math Progr"},{"issue":"6","key":"1478_CR21","doi-asserted-by":"publisher","first-page":"386","DOI":"10.1037\/h0042519","volume":"65","author":"F Rosenblatt","year":"1958","unstructured":"Rosenblatt F. The perceptron: a probabilistic model for information storage and organization in the brain. Psychol Rev. 1958;65(6):386.","journal-title":"Psychol Rev"},{"issue":"7","key":"1478_CR22","first-page":"323","volume":"5","author":"H Suprajitno","year":"2010","unstructured":"Suprajitno H, Bin Mohd I. Linear programming with interval arithmetic. Int J Contemp Math Sci. 2010;5(7):323\u201332.","journal-title":"Int J Contemp Math Sci"},{"doi-asserted-by":"crossref","unstructured":"van\u00a0den Brand J. A deterministic linear program solver in current matrix multiplication time. In: Proceedings of the Fourteenth Annual ACM-SIAM Symposium on discrete algorithms. SIAM; 2020, p. 259\u2013278.","key":"1478_CR23","DOI":"10.1137\/1.9781611975994.16"}],"container-title":["SN Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s42979-022-01478-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s42979-022-01478-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s42979-022-01478-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,7]],"date-time":"2023-01-07T22:29:51Z","timestamp":1673130591000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s42979-022-01478-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,12,1]]},"references-count":23,"journal-issue":{"issue":"1","published-online":{"date-parts":[[2023,1]]}},"alternative-id":["1478"],"URL":"https:\/\/doi.org\/10.1007\/s42979-022-01478-2","relation":{},"ISSN":["2661-8907"],"issn-type":[{"type":"electronic","value":"2661-8907"}],"subject":[],"published":{"date-parts":[[2022,12,1]]},"assertion":[{"value":"5 May 2022","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"26 October 2022","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"1 December 2022","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 author declares that he has no conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of Interest"}}],"article-number":"76"}}