{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T03:42:02Z","timestamp":1740109322005,"version":"3.37.3"},"reference-count":32,"publisher":"Springer Science and Business Media LLC","issue":"1-2","license":[{"start":{"date-parts":[[2024,4,23]],"date-time":"2024-04-23T00:00:00Z","timestamp":1713830400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,4,23]],"date-time":"2024-04-23T00:00:00Z","timestamp":1713830400000},"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":["Math. Program."],"published-print":{"date-parts":[[2025,1]]},"DOI":"10.1007\/s10107-024-02079-y","type":"journal-article","created":{"date-parts":[[2024,4,23]],"date-time":"2024-04-23T13:01:48Z","timestamp":1713877308000},"page":"681-702","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["A normal fan projection algorithm for low-rank optimization"],"prefix":"10.1007","volume":"209","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-2781-6013","authenticated-orcid":false,"given":"James R.","family":"Scott","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5613-8146","authenticated-orcid":false,"given":"Joseph","family":"Geunes","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2024,4,23]]},"reference":[{"key":"2079_CR1","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1007\/s101070100233","volume":"91","author":"K Allemand","year":"2001","unstructured":"Allemand, K., Fukuda, K., Liebling, T.M., Steiner, E.: A polynomial case of unconstrained zero-one quadratic optimization. Math. Program. 91, 49\u201352 (2001). https:\/\/doi.org\/10.1007\/s101070100233","journal-title":"Math. Program."},{"key":"2079_CR2","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1016\/0166-218X(95)00026-N","volume":"65","author":"D Avis","year":"1996","unstructured":"Avis, D., Fukuda, K.: Reverse search for enumeration. Discret. Appl. Math. 65, 21\u201346 (1996). https:\/\/doi.org\/10.1016\/0166-218X(95)00026-N","journal-title":"Discret. Appl. Math."},{"key":"2079_CR3","doi-asserted-by":"publisher","DOI":"10.1561\/9781601987570","volume-title":"Learning with Submodular Functions: A Convex Optimization Perspective","author":"F Bach","year":"2013","unstructured":"Bach, F.: Learning with Submodular Functions: A Convex Optimization Perspective. Now Publishers Inc., Hanover (2013)"},{"issue":"4","key":"2079_CR4","doi-asserted-by":"publisher","first-page":"516","DOI":"10.1137\/1016083","volume":"16","author":"ML Balinski","year":"1974","unstructured":"Balinski, M.L., Russakoff, A.: On the assignment polytope. SIAM Rev. 16(4), 516\u2013525 (1974). https:\/\/doi.org\/10.1137\/1016083","journal-title":"SIAM Rev."},{"issue":"2","key":"2079_CR5","doi-asserted-by":"publisher","first-page":"194","DOI":"10.1016\/0097-3165(77)90051-6","volume":"22","author":"RA Brualdi","year":"1977","unstructured":"Brualdi, R.A., Gibson, P.M.: Convex polyhedra of doubly stochastic matrices. I. Applications of the permanent function. J. Combin. Theory Ser. A 22(2), 194\u2013230 (1977). https:\/\/doi.org\/10.1016\/0097-3165(77)90051-6","journal-title":"J. Combin. Theory Ser. A"},{"key":"2079_CR6","series-title":"EATCS Monographs on Theoretical Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-61568-9","volume-title":"Algorithms in Combinatorial Geometry","author":"H Edelsbrunner","year":"1987","unstructured":"Edelsbrunner, H.: Algorithms in Combinatorial Geometry. EATCS Monographs on Theoretical Computer Science, Springer, Berlin (1987). https:\/\/doi.org\/10.1007\/978-3-642-61568-9"},{"issue":"2","key":"2079_CR7","doi-asserted-by":"publisher","first-page":"341","DOI":"10.1137\/0215024","volume":"15","author":"H Edelsbrunner","year":"1986","unstructured":"Edelsbrunner, H., O\u2019Rourke, J., Seidel, R.: Constructing arrangements of lines and hyperplanes with applications. SIAM J. Comput. 15(2), 341\u2013363 (1986). https:\/\/doi.org\/10.1137\/0215024","journal-title":"SIAM J. Comput."},{"key":"2079_CR8","unstructured":"Edmonds, J.: Submodular functions, matroids, and certain polyhedra. In: Combinatorial Structures and Their Applications, pp. 69\u201387. Gordon and Breach, New York (1970)"},{"issue":"1","key":"2079_CR9","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1016\/j.ejor.2003.04.011","volume":"166","author":"JA Ferrez","year":"2005","unstructured":"Ferrez, J.A., Fukuda, K., Liebling, T.: Solving the fixed rank convex quadratic maximization in binary variables by a parallel zonotope construction algorithm. Eur. J. Oper. Res. 166(1), 35\u201350 (2005). https:\/\/doi.org\/10.1016\/j.ejor.2003.04.011","journal-title":"Eur. J. Oper. Res."},{"issue":"2","key":"2079_CR10","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1016\/j.orl.2013.01.004","volume":"41","author":"V Goyal","year":"2013","unstructured":"Goyal, V., Ravi, R.: An FPTAS for minimizing a class of low-rank quasi-concave functions over a convex set. Oper. Res. Lett. 41(2), 191\u2013196 (2013). https:\/\/doi.org\/10.1016\/j.orl.2013.01.004","journal-title":"Oper. Res. Lett."},{"key":"2079_CR11","doi-asserted-by":"publisher","first-page":"453","DOI":"10.1007\/s13160-012-0074-0","volume":"29","author":"T Itoko","year":"2012","unstructured":"Itoko, T., Iwata, S.: Computational geometric approach to submodular function minimization for multiclass queueing systems. Jpn. J. Ind. Appl. Math. 29, 453\u2013468 (2012). https:\/\/doi.org\/10.1007\/s13160-012-0074-0","journal-title":"Jpn. J. Ind. Appl. Math."},{"key":"2079_CR12","doi-asserted-by":"crossref","unstructured":"Kelner, J.A., Nikolova, E.: On the hardness and smoothed complexity of quasi-concave minimization. In: 48th Annual IEEE Symposium on Foundations of Computer Science (FOCS\u201907), pp. 472\u2013482 (2007)","DOI":"10.1109\/FOCS.2007.68"},{"key":"2079_CR13","doi-asserted-by":"publisher","first-page":"641","DOI":"10.1007\/s10107-006-0047-7","volume":"110","author":"W Kern","year":"2006","unstructured":"Kern, W., Woeginger, G.: Quadratic programming and combinatorial minimum weight product problems. Math. Program. 110, 641\u2013649 (2006). https:\/\/doi.org\/10.1007\/s10107-006-0047-7","journal-title":"Math. Program."},{"key":"2079_CR14","doi-asserted-by":"publisher","first-page":"225","DOI":"10.1023\/A:1008230825152","volume":"13","author":"H Konno","year":"1998","unstructured":"Konno, H., Gao, C., Saitoh, I.: Cutting plane\/tabu search algorithms for low rank concave quadratic programming problems. J. Glob. Optim. 13, 225\u2013240 (1998). https:\/\/doi.org\/10.1023\/A:1008230825152","journal-title":"J. Glob. Optim."},{"key":"2079_CR15","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1016\/0095-8956(85)90091-7","volume":"38","author":"B Korte","year":"1985","unstructured":"Korte, B., Lov\u00e1sz, L.: Polymatroid greedoids. J. Combin. Theory 38, 41\u201372 (1985). https:\/\/doi.org\/10.1016\/0095-8956(85)90091-7","journal-title":"J. Combin. Theory"},{"issue":"2","key":"2079_CR16","doi-asserted-by":"publisher","first-page":"113","DOI":"10.1007\/BF00121658","volume":"9","author":"T Matsui","year":"1996","unstructured":"Matsui, T.: NP-hardness of linear multiplicative programming and related problems. J. Glob. Optim. 9(2), 113\u2013119 (1996). https:\/\/doi.org\/10.1007\/BF00121658","journal-title":"J. Glob. Optim."},{"key":"2079_CR17","doi-asserted-by":"publisher","first-page":"103","DOI":"10.1007\/s10107-011-0511-x","volume":"141","author":"S Mittal","year":"2013","unstructured":"Mittal, S., Schulz, A.S.: An FPTAS for optimizing a class of low-rank functions over a polytope. Math. Program. 141, 103\u2013120 (2013). https:\/\/doi.org\/10.1007\/s10107-011-0511-x","journal-title":"Math. Program."},{"key":"2079_CR18","series-title":"Algorithms and Techniques","doi-asserted-by":"publisher","first-page":"338","DOI":"10.1007\/978-3-642-15369-3_26","volume-title":"Approximation, Randomization, and Combinatorial Optimization","author":"E Nikolova","year":"2010","unstructured":"Nikolova, E.: Approximation algorithms for reliable stochastic combinatorial optimization. In: Serna, M., Shaltiel, R., Jansen, K., Rolim, J. (eds.) Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, pp. 338\u2013351. Springer, Berlin (2010)"},{"key":"2079_CR19","doi-asserted-by":"publisher","first-page":"367","DOI":"10.1137\/1028106","volume":"28","author":"P Pardalos","year":"1986","unstructured":"Pardalos, P., Rosen, J.: Methods for global concave minimization: a bibliographic survey. SIAM Rev. 28, 367\u2013379 (1986). https:\/\/doi.org\/10.1137\/1028106","journal-title":"SIAM Rev."},{"key":"2079_CR20","doi-asserted-by":"publisher","first-page":"15","DOI":"10.1007\/BF00120662","volume":"1","author":"PM Pardalos","year":"1991","unstructured":"Pardalos, P.M., Vavasis, S.A.: Quadratic programming with one negative eigenvalue is NP-hard. J. Glob. Optim. 1, 15\u201322 (1991). https:\/\/doi.org\/10.1007\/BF00120662","journal-title":"J. Glob. Optim."},{"key":"2079_CR21","doi-asserted-by":"publisher","first-page":"942","DOI":"10.1287\/opre.1040.0151","volume":"52","author":"M Porembski","year":"2004","unstructured":"Porembski, M.: Cutting planes for low-rank-like concave minimization problems. Oper. Res. 52, 942\u2013953 (2004). https:\/\/doi.org\/10.1287\/opre.1040.0151","journal-title":"Oper. Res."},{"issue":"1","key":"2079_CR22","doi-asserted-by":"publisher","first-page":"455","DOI":"10.1137\/15M1027930","volume":"32","author":"M Rada","year":"2018","unstructured":"Rada, M., \u010cern\u00fd, M.: A new algorithm for enumeration of cells of hyperplane arrangements and a comparison with Avis and Fukuda\u2019s reverse search. SIAM J. Discret. Math. 32(1), 455\u2013473 (2018). https:\/\/doi.org\/10.1137\/15M1027930","journal-title":"SIAM J. Discret. Math."},{"issue":"3","key":"2079_CR23","doi-asserted-by":"publisher","first-page":"431","DOI":"10.1137\/S0895480195283798","volume":"10","author":"A Sarangarajan","year":"1997","unstructured":"Sarangarajan, A.: A lower bound for adjacencies on the traveling salesman polytope. SIAM J. Discret. Math. 10(3), 431\u2013435 (1997). https:\/\/doi.org\/10.1137\/S0895480195283798","journal-title":"SIAM J. Discret. Math."},{"key":"2079_CR24","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1016\/S0022-0000(76)80016-5","volume":"12","author":"S Savage","year":"1976","unstructured":"Savage, S., Weiner, P., Bagchi, A.: Neighborhood search algorithms for guaranteeing optimal traveling salesman tours must be inefficient. J. Comput. Syst. Sci. 12, 25\u201335 (1976). https:\/\/doi.org\/10.1016\/S0022-0000(76)80016-5","journal-title":"J. Comput. Syst. Sci."},{"key":"2079_CR25","volume-title":"Combinatorial Optimization: Polyhedra and Efficiency, Algorithms and Combinatorics","author":"A Schrijver","year":"2003","unstructured":"Schrijver, A.: Combinatorial Optimization: Polyhedra and Efficiency, Algorithms and Combinatorics, vol. 24. Springer, Berlin (2003)"},{"key":"2079_CR26","unstructured":"Scott, J.R.: Minimizing low-rank quasi-concave functions over greedy polytopes. Master\u2019s thesis, Texas A &M University, College Station, Texas, United States (2020)"},{"key":"2079_CR27","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1007\/s10107-009-0274-9","volume":"126","author":"T Sharkey","year":"2011","unstructured":"Sharkey, T., Romeijn, H.E., Geunes, J.: A class of nonlinear nonseparable continuous knapsack and multiple-choice knapsack problems. Math. Program. 126, 69\u201396 (2011). https:\/\/doi.org\/10.1007\/s10107-009-0274-9","journal-title":"Math. Program."},{"key":"2079_CR28","doi-asserted-by":"publisher","first-page":"229","DOI":"10.1007\/BF02591887","volume":"30","author":"DM Topkis","year":"1984","unstructured":"Topkis, D.M.: Adjacency on polymatroids. Math. Program. 30, 229\u2013237 (1984). https:\/\/doi.org\/10.1007\/BF02591887","journal-title":"Math. Program."},{"key":"2079_CR29","doi-asserted-by":"publisher","first-page":"335","DOI":"10.1080\/02331938508843024","volume":"16","author":"H Tuy","year":"1985","unstructured":"Tuy, H.: Concave minimization under linear constraints with special structure. Optimization 16, 335\u2013352 (1985). https:\/\/doi.org\/10.1080\/02331938508843024","journal-title":"Optimization"},{"key":"2079_CR30","doi-asserted-by":"publisher","first-page":"279","DOI":"10.1007\/BF01581085","volume":"57","author":"SA Vavasis","year":"1992","unstructured":"Vavasis, S.A.: Approximation algorithms for indefinite quadratic programming. Math. Program. 57, 279\u2013311 (1992). https:\/\/doi.org\/10.1007\/BF01581085","journal-title":"Math. Program."},{"key":"2079_CR31","series-title":"Wiley-Interscience Series in Discrete Mathematics and Optimization","volume-title":"Integer Programming","author":"L Wolsey","year":"1998","unstructured":"Wolsey, L.: Integer Programming. Wiley-Interscience Series in Discrete Mathematics and Optimization, John Wiley & Sons Inc, New York (1998)"},{"key":"2079_CR32","series-title":"Graduate Texts in Mathematics","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4613-8431-1","volume-title":"Lectures on Polytopes","author":"GM Ziegler","year":"1995","unstructured":"Ziegler, G.M.: Lectures on Polytopes. Graduate Texts in Mathematics, vol. 152. Springer, New York (1995). https:\/\/doi.org\/10.1007\/978-1-4613-8431-1"}],"container-title":["Mathematical Programming"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-024-02079-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10107-024-02079-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-024-02079-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,15]],"date-time":"2025-01-15T16:52:51Z","timestamp":1736959971000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10107-024-02079-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,4,23]]},"references-count":32,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2025,1]]}},"alternative-id":["2079"],"URL":"https:\/\/doi.org\/10.1007\/s10107-024-02079-y","relation":{},"ISSN":["0025-5610","1436-4646"],"issn-type":[{"type":"print","value":"0025-5610"},{"type":"electronic","value":"1436-4646"}],"subject":[],"published":{"date-parts":[[2024,4,23]]},"assertion":[{"value":"25 May 2021","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"1 March 2024","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"23 April 2024","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}