{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,28]],"date-time":"2025-09-28T12:45:18Z","timestamp":1759063518003,"version":"3.37.3"},"reference-count":26,"publisher":"Springer Science and Business Media LLC","issue":"1-2","license":[{"start":{"date-parts":[[2016,12,28]],"date-time":"2016-12-28T00:00:00Z","timestamp":1482883200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2016,12,28]],"date-time":"2016-12-28T00:00:00Z","timestamp":1482883200000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/100000147","name":"Division of Civil, Mechanical and Manufacturing Innovation","doi-asserted-by":"publisher","award":["CMMI-1534850."],"award-info":[{"award-number":["CMMI-1534850."]}],"id":[{"id":"10.13039\/100000147","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Math. Program."],"published-print":{"date-parts":[[2017,11]]},"DOI":"10.1007\/s10107-016-1105-4","type":"journal-article","created":{"date-parts":[[2016,12,28]],"date-time":"2016-12-28T13:25:44Z","timestamp":1482931544000},"page":"87-111","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":11,"title":["Solving Conic Systems via Projection and Rescaling"],"prefix":"10.1007","volume":"166","author":[{"given":"Javier","family":"Pe\u00f1a","sequence":"first","affiliation":[]},{"given":"Negar","family":"Soheili","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2016,12,28]]},"reference":[{"issue":"3","key":"1105_CR1","doi-asserted-by":"publisher","first-page":"382","DOI":"10.4153\/CJM-1954-037-2","volume":"6","author":"S Agmon","year":"1954","unstructured":"Agmon, S.: The relaxation method for linear inequalities. Can. J. Math. 6(3), 382\u2013392 (1954)","journal-title":"Can. J. Math."},{"issue":"1","key":"1105_CR2","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1080\/10556780701589669","volume":"23","author":"S Ahipasaoglu","year":"2008","unstructured":"Ahipasaoglu, S., Sun, P., Todd, M.: Linear convergence of a modified Frank\u2013Wolfe algorithm for computing minimum-volume enclosing ellipsoids. Optim. Methods Softw. 23(1), 5\u201319 (2008)","journal-title":"Optim. Methods Softw."},{"key":"1105_CR3","volume-title":"Spectral Functions and Smoothing Techniques on Jordan Algebras: How Algebraic Techniques can Help to Design Efficient Optimization Algorithms","author":"M Baes","year":"2009","unstructured":"Baes, M.: Spectral Functions and Smoothing Techniques on Jordan Algebras: How Algebraic Techniques can Help to Design Efficient Optimization Algorithms. Lambert Academic Publishing, Saarbr\u00fccken (2009)"},{"issue":"2","key":"1105_CR4","doi-asserted-by":"publisher","first-page":"336","DOI":"10.1287\/ijoc.2013.0569","volume":"26","author":"A Basu","year":"2013","unstructured":"Basu, A., De Loera, J.A., Junod, M.: On Chubanov\u2019s method for linear programming. INFORMS J. Comput. 26(2), 336\u2013350 (2013)","journal-title":"INFORMS J. Comput."},{"key":"1105_CR5","doi-asserted-by":"publisher","unstructured":"Beck, A., Shtern, S.: Linearly convergent away-step conditional gradient for non-strongly convex functions. Math. Program. 159(1,2), 1\u201327 (2016). doi: 10.1007\/s10107-016-1069-4","DOI":"10.1007\/s10107-016-1069-4"},{"issue":"3","key":"1105_CR6","doi-asserted-by":"publisher","first-page":"621","DOI":"10.1287\/moor.1090.0388","volume":"34","author":"A Belloni","year":"2009","unstructured":"Belloni, A., Freund, R., Vempala, S.: An efficient rescaled perceptron algorithm for conic systems. Math. Oper. Res. 34(3), 621\u2013641 (2009)","journal-title":"Math. Oper. Res."},{"key":"1105_CR7","doi-asserted-by":"publisher","first-page":"533","DOI":"10.1007\/s10107-011-0445-3","volume":"134","author":"S Chubanov","year":"2012","unstructured":"Chubanov, S.: A strongly polynomial algorithm for linear systems having a binary solution. Math. Program. 134, 533\u2013570 (2012)","journal-title":"Math. Program."},{"key":"1105_CR8","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. Program. 153, 687\u2013713 (2015)","journal-title":"Math. Program."},{"key":"1105_CR9","unstructured":"Dantzig, G.B.: An $$\\epsilon $$-precise feasible solution to a linear program with a convexity constraint in $$\\frac{1}{\\epsilon ^2}$$ iterations independent of problem size. Technical report, Stanford University (1992)"},{"issue":"1","key":"1105_CR10","doi-asserted-by":"publisher","first-page":"101","DOI":"10.1007\/s10107-007-0095-7","volume":"114","author":"J Dunagan","year":"2006","unstructured":"Dunagan, J., Vempala, S.: A simple polynomial-time rescaling algorithm for solving linear programs. Math. Program. 114(1), 101\u2013114 (2006)","journal-title":"Math. Program."},{"key":"1105_CR11","doi-asserted-by":"publisher","first-page":"627","DOI":"10.1137\/S1052623400373829","volume":"12","author":"M Epelman","year":"2002","unstructured":"Epelman, M., Freund, R.: A new condition measure, preconditioners, and relations between different measures of conditioning for conic linear systems. SIAM J. Optim. 12, 627\u2013655 (2002)","journal-title":"SIAM J. Optim."},{"issue":"3","key":"1105_CR12","doi-asserted-by":"publisher","first-page":"451","DOI":"10.1007\/s101070000136","volume":"88","author":"M Epelman","year":"2000","unstructured":"Epelman, M., Freund, R.M.: Condition number complexity of an elementary algorithm for computing a reliable solution of a conic linear system. Math. Program. 88(3), 451\u2013485 (2000)","journal-title":"Math. Program."},{"key":"1105_CR13","doi-asserted-by":"crossref","unstructured":"Faraut, J., Kor\u00e1nyi, A.: Analysis on Symmetric Cones. Oxford University Press, New York (1994)","DOI":"10.1093\/oso\/9780198534778.001.0001"},{"key":"1105_CR14","unstructured":"Lacoste-Julien, S., Jaggi, M.: On the global linear convergence of Frank-Wolfe optimization variants. Proceedings of the 28th International Conference on Neural Information Processing Systems (NIPS 2015). Curran Associates, Inc., New York, pp. 496\u2013504 (2015)"},{"key":"1105_CR15","unstructured":"Li, D., Roos, C., Terlaky, T.: A polynomial column-wise rescaling von Neumann algorithm. Technical report, Lehigh University (2015)"},{"issue":"3","key":"1105_CR16","doi-asserted-by":"publisher","first-page":"393","DOI":"10.4153\/CJM-1954-038-x","volume":"6","author":"TS Motzkin","year":"1954","unstructured":"Motzkin, T.S., Schoenberg, I.J.: The relaxation method for linear inequalities. Can. J. Math. 6(3), 393\u2013404 (1954)","journal-title":"Can. J. Math."},{"key":"1105_CR17","volume-title":"The Symmetric Eigenvalue Problem","author":"BN Parlett","year":"1980","unstructured":"Parlett, B.N.: The Symmetric Eigenvalue Problem. Prentice-Hall, Englewood Cliffs (1980)"},{"issue":"1","key":"1105_CR18","doi-asserted-by":"publisher","first-page":"499","DOI":"10.1137\/15M1009937","volume":"26","author":"J Pe\u00f1a","year":"2016","unstructured":"Pe\u00f1a, J., Rodr\u00edguez, D., Soheili, N.: On the von Neumann and Frank\u2013Wolfe algorithms with away steps. SIAM J. Optim. 26(1), 499\u2013512 (2016)","journal-title":"SIAM J. Optim."},{"issue":"7","key":"1105_CR19","doi-asserted-by":"publisher","first-page":"2145","DOI":"10.1007\/s11590-013-0721-7","volume":"8","author":"J Pe\u00f1a","year":"2014","unstructured":"Pe\u00f1a, J., Roshchina, V., Soheili, N.: Some preconditioners for systems of linear inequalities. Optim Lett 8(7), 2145\u20132152 (2014)","journal-title":"Optim Lett"},{"issue":"1\u20132","key":"1105_CR20","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. Program. 155(1\u20132), 497\u2013510 (2016)","journal-title":"Math. Program."},{"key":"1105_CR21","unstructured":"Roos, C.: An improved version of Chubanov\u2019s method for solving a homogeneous feasibility problem. Technical report, Delft University of Technology (2015)"},{"issue":"6","key":"1105_CR22","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. 65(6), 386\u2013408 (1958)","journal-title":"Psychol. Rev."},{"issue":"3","key":"1105_CR23","doi-asserted-by":"publisher","first-page":"543","DOI":"10.1287\/moor.26.3.543.10582","volume":"26","author":"S Schmieta","year":"2001","unstructured":"Schmieta, S., Alizadeh, F.: Associative and Jordan algebras, and polynomial time interior-point algorithms for symmetric cones. Math. Oper. Res. 26(3), 543\u2013564 (2001)","journal-title":"Math. Oper. Res."},{"issue":"3","key":"1105_CR24","doi-asserted-by":"publisher","first-page":"409","DOI":"10.1007\/s10107-003-0380-z","volume":"96","author":"S Schmieta","year":"2003","unstructured":"Schmieta, S., Alizadeh, F.: Extension of primal-dual interior point algorithms to symmetric cones. Math. Program. 96(3), 409\u2013438 (2003)","journal-title":"Math. Program."},{"issue":"2","key":"1105_CR25","doi-asserted-by":"publisher","first-page":"728","DOI":"10.1137\/110848955","volume":"22","author":"N Soheili","year":"2012","unstructured":"Soheili, N., Pe\u00f1a, J.: A smooth perceptron algorithm. SIAM J. Optim. 22(2), 728\u2013737 (2012)","journal-title":"SIAM J. Optim."},{"key":"1105_CR26","doi-asserted-by":"crossref","unstructured":"Soheili, N., Pe\u00f1a, J.: A primal\u2013dual smooth perceptron\u2013von Neumann algorithm. In: Bezdek, K., Ye, Y., Deza, A. (eds.) Discrete Geometry and Optimization, Fields institute communications, 69. Springer, pp. 303\u2013320 (2013)","DOI":"10.1007\/978-3-319-00200-2_17"}],"container-title":["Mathematical Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10107-016-1105-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-016-1105-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-016-1105-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,6,21]],"date-time":"2024-06-21T13:21:56Z","timestamp":1718976116000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10107-016-1105-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,12,28]]},"references-count":26,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2017,11]]}},"alternative-id":["1105"],"URL":"https:\/\/doi.org\/10.1007\/s10107-016-1105-4","relation":{},"ISSN":["0025-5610","1436-4646"],"issn-type":[{"type":"print","value":"0025-5610"},{"type":"electronic","value":"1436-4646"}],"subject":[],"published":{"date-parts":[[2016,12,28]]},"assertion":[{"value":"10 December 2015","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"19 December 2016","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"28 December 2016","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}