{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T05:52:19Z","timestamp":1743141139926,"version":"3.40.3"},"publisher-location":"Cham","reference-count":24,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783031327254"},{"type":"electronic","value":"9783031327261"}],"license":[{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"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":[],"published-print":{"date-parts":[[2023]]},"DOI":"10.1007\/978-3-031-32726-1_11","type":"book-chapter","created":{"date-parts":[[2023,5,21]],"date-time":"2023-05-21T20:28:43Z","timestamp":1684700923000},"page":"142-156","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["An Update-and-Stabilize Framework for\u00a0the\u00a0Minimum-Norm-Point Problem"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-0950-4278","authenticated-orcid":false,"given":"Satoru","family":"Fujishige","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9867-3902","authenticated-orcid":false,"given":"Tomonari","family":"Kitahara","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1152-200X","authenticated-orcid":false,"given":"L\u00e1szl\u00f3 A.","family":"V\u00e9gh","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,5,22]]},"reference":[{"issue":"2\u20133","key":"11_CR1","doi-asserted-by":"publisher","first-page":"145","DOI":"10.1561\/2200000039","volume":"6","author":"F Bach","year":"2013","unstructured":"Bach, F.: Learning with submodular functions: a convex optimization perspective. Found. Trends Mach. Learn. 6(2\u20133), 145\u2013373 (2013)","journal-title":"Found. Trends Mach. Learn."},{"key":"11_CR2","unstructured":"Chakrabarty, D., Jain, P., Kothari, P.: Provable submodular minimization using Wolfe\u2019s algorithm. In: Advances in Neural Information Processing Systems, vol. 27 (2014)"},{"key":"11_CR3","doi-asserted-by":"crossref","unstructured":"Dadush, D., Huiberts, S., Natura, B., V\u00e9gh, L.A.: A scaling-invariant algorithm for linear programming whose running time depends only on the constraint matrix. In: Proceedings of the 52nd Annual ACM Symposium on Theory of Computing (STOC), pp. 761\u2013774 (2020)","DOI":"10.1145\/3357713.3384326"},{"key":"11_CR4","doi-asserted-by":"crossref","unstructured":"Dadush, D., Natura, B., V\u00e9gh, L.A.: Revisiting Tardos\u2019s framework for linear programming: faster exact solutions using approximate solvers. In: Proceedings of the 61st Annual IEEE Symposium on Foundations of Computer Science (FOCS), pp. 931\u2013942 (2020)","DOI":"10.1109\/FOCS46700.2020.00091"},{"issue":"1","key":"11_CR5","doi-asserted-by":"publisher","first-page":"138","DOI":"10.1137\/18M1221072","volume":"49","author":"JA De Loera","year":"2020","unstructured":"De Loera, J.A., Haddock, J., Rademacher, L.: The minimum Euclidean-norm point in a convex polytope: Wolfe\u2019s combinatorial algorithm is exponential. SIAM J. Comput. 49(1), 138\u2013169 (2020)","journal-title":"SIAM J. Comput."},{"key":"11_CR6","doi-asserted-by":"crossref","unstructured":"Ekbatani, F., Natura, B., V\u00e9gh, A.L.: Circuit imbalance measures and linear programming. In: Surveys in Combinatorics 2022. London Mathematical Society Lecture Note Series, pp. 64\u2013114. Cambridge University Press, Cambridge (2022)","DOI":"10.1017\/9781009093927.004"},{"key":"11_CR7","unstructured":"Ene, A., Vladu, A.: Improved convergence for $$\\ell _1$$ and $$\\ell _\\infty $$ regression via iteratively reweighted least squares. In: International Conference on Machine Learning, pp. 1794\u20131801. PMLR (2019)"},{"issue":"2","key":"11_CR8","doi-asserted-by":"publisher","first-page":"186","DOI":"10.1287\/moor.5.2.186","volume":"5","author":"S Fujishige","year":"1980","unstructured":"Fujishige, S.: Lexicographically optimal base of a polymatroid with respect to a weight vector. Math. Oper. Res. 5(2), 186\u2013196 (1980)","journal-title":"Math. Oper. Res."},{"key":"11_CR9","doi-asserted-by":"crossref","unstructured":"Fujishige, S.: A capacity-rounding algorithm for the minimum-cost circulation problem: a dual framework of the Tardos algorithm 35(3), 298\u2013308 (1986)","DOI":"10.1007\/BF01580882"},{"issue":"2","key":"11_CR10","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1007\/s11081-008-9067-x","volume":"10","author":"S Fujishige","year":"2009","unstructured":"Fujishige, S., Hayashi, T., Yamashita, K., Zimmermann, U.: Zonotopes and the LP-Newton method. Optim. Eng. 10(2), 193\u2013205 (2009)","journal-title":"Optim. Eng."},{"issue":"1","key":"11_CR11","first-page":"3","volume":"7","author":"S Fujishige","year":"2011","unstructured":"Fujishige, S., Isotani, S.: A submodular function minimization algorithm based on the minimum-norm base. Pac. J. Optim. 7(1), 3\u201317 (2011)","journal-title":"Pac. J. Optim."},{"key":"11_CR12","first-page":"303","volume":"2","author":"D Fulkerson","year":"1968","unstructured":"Fulkerson, D.: Networks, frames, blocking systems. Math. Decis. Sci. Part I, Lect. Appl. Math. 2, 303\u2013334 (1968)","journal-title":"Math. Decis. Sci. Part I, Lect. Appl. Math."},{"issue":"4","key":"11_CR13","doi-asserted-by":"publisher","first-page":"263","DOI":"10.6028\/jres.049.027","volume":"49","author":"AJ Hoffman","year":"1952","unstructured":"Hoffman, A.J.: On approximate solutions of systems of linear inequalities. J. Res. Natl. Bur. Stand. 49(4), 263\u2013265 (1952)","journal-title":"J. Res. Natl. Bur. Stand."},{"key":"11_CR14","unstructured":"Lacoste-Julien, S., Jaggi, M.: On the global linear convergence of Frank-Wolfe optimization variants. In: Advances in Neural Information Processing Systems, vol. 28 (2015)"},{"key":"11_CR15","unstructured":"Lawson, C.L.: Contribution to the theory of linear least maximum approximation. Ph.D. thesis (1961)"},{"issue":"1","key":"11_CR16","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1007\/s10107-018-1232-1","volume":"175","author":"I Necoara","year":"2019","unstructured":"Necoara, I., Nesterov, Y., Glineur, F.: Linear convergence of first order methods for non-strongly convex optimization. Math. Program. 175(1), 69\u2013107 (2019)","journal-title":"Math. Program."},{"issue":"2","key":"11_CR17","doi-asserted-by":"publisher","first-page":"338","DOI":"10.1287\/opre.41.2.338","volume":"41","author":"JB Orlin","year":"1993","unstructured":"Orlin, J.B.: A faster strongly polynomial minimum cost flow algorithm. Oper. Res. 41(2), 338\u2013350 (1993)","journal-title":"Oper. Res."},{"key":"11_CR18","unstructured":"Osborne, M.R.: Finite Algorithms in Optimization and Data Analysis. Wiley, Hoboken (1985)"},{"key":"11_CR19","doi-asserted-by":"crossref","unstructured":"Pe\u00f1a, J., Vera, J.C., Zuluaga, L.F.: New characterizations of Hoffman constants for systems of linear constraints. Math. Program. 1\u201331 (2020)","DOI":"10.1007\/s10107-020-01473-6"},{"key":"11_CR20","unstructured":"Rockafellar, R.T.: The elementary vectors of a subspace of $$R^N$$. In: Combinatorial Mathematics and Its Applications: Proceedings North Carolina Conference, Chapel Hill, 1967, pp. 104\u2013127. The University of North Carolina Press (1969)"},{"issue":"3","key":"11_CR21","doi-asserted-by":"publisher","first-page":"247","DOI":"10.1007\/BF02579369","volume":"5","author":"\u00c9 Tardos","year":"1985","unstructured":"Tardos, \u00c9.: A strongly polynomial minimum cost circulation algorithm. Combinatorica 5(3), 247\u2013255 (1985)","journal-title":"Combinatorica"},{"key":"11_CR22","doi-asserted-by":"crossref","unstructured":"Vavasis, S.A., Ye, Y.: A primal-dual interior point method whose running time depends only on the constraint matrix 74(1), 79\u2013120 (1996)","DOI":"10.1007\/BF02592148"},{"issue":"133","key":"11_CR23","first-page":"48","volume":"30","author":"DR Wilhelmsen","year":"1976","unstructured":"Wilhelmsen, D.R.: A nearest point algorithm for convex polyhedral cones and applications to positive linear approximation. Math. Comput. 30(133), 48\u201357 (1976)","journal-title":"Math. Comput."},{"issue":"1","key":"11_CR24","doi-asserted-by":"publisher","first-page":"128","DOI":"10.1007\/BF01580381","volume":"11","author":"P Wolfe","year":"1976","unstructured":"Wolfe, P.: Finding the nearest point in a polytope. Math. Program. 11(1), 128\u2013149 (1976)","journal-title":"Math. Program."}],"container-title":["Lecture Notes in Computer Science","Integer Programming and Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-32726-1_11","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,21]],"date-time":"2023-05-21T20:29:55Z","timestamp":1684700995000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-32726-1_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031327254","9783031327261"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-32726-1_11","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"22 May 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"IPCO","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Integer Programming and Combinatorial Optimization","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Madison, WI","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"USA","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2023","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"21 June 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"23 June 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"24","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"ipco2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/optimization.discovery.wisc.edu\/ipco-2023-madison\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"119","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"33","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"28% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"2","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}