{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,2]],"date-time":"2026-01-02T07:47:42Z","timestamp":1767340062319,"version":"3.40.5"},"reference-count":48,"publisher":"Informa UK Limited","issue":"3","content-domain":{"domain":["www.tandfonline.com"],"crossmark-restriction":true},"short-container-title":["Optimization Methods and Software"],"published-print":{"date-parts":[[2022,5,4]]},"DOI":"10.1080\/10556788.2021.1880579","type":"journal-article","created":{"date-parts":[[2021,2,15]],"date-time":"2021-02-15T04:25:52Z","timestamp":1613363152000},"page":"1006-1026","update-policy":"https:\/\/doi.org\/10.1080\/tandf_crossmark_01","source":"Crossref","is-referenced-by-count":15,"title":["A Benson-type algorithm for bounded convex vector optimization problems with vertex selection"],"prefix":"10.1080","volume":"37","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-9503-3619","authenticated-orcid":false,"given":"Daniel","family":"D\u00f6rfler","sequence":"first","affiliation":[{"name":"Department of Mathematical Optimization, Friedrich Schiller University Jena, Jena, Germany"}]},{"given":"Andreas","family":"L\u00f6hne","sequence":"additional","affiliation":[{"name":"Department of Mathematical Optimization, Friedrich Schiller University Jena, Jena, Germany"}]},{"given":"Christopher","family":"Schneider","sequence":"additional","affiliation":[{"name":"Department of Mathematics, Ernst Abbe University of Applied Sciences Jena, Jena, Germany"}]},{"given":"Benjamin","family":"Wei\u00dfing","sequence":"additional","affiliation":[{"name":"Department of Mathematical Optimization, Friedrich Schiller University Jena, Jena, Germany"}]}],"member":"301","published-online":{"date-parts":[[2021,2,11]]},"reference":[{"key":"CIT0001","doi-asserted-by":"publisher","DOI":"10.1016\/0022-247X(86)90234-9"},{"key":"CIT0002","first-page":"221","author":"Bends\u00f8e M.P.","year":"2003","journal-title":"Topology Optimization: Theory, Methods and Applications"},{"key":"CIT0003","doi-asserted-by":"publisher","DOI":"10.1023\/A:1008215702611"},{"key":"CIT0004","doi-asserted-by":"publisher","DOI":"10.1007\/s10957-019-01592-x"},{"key":"CIT0005","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511804441"},{"key":"CIT0006","doi-asserted-by":"publisher","DOI":"10.1007\/BF01386389"},{"key":"CIT0007","doi-asserted-by":"publisher","DOI":"10.1007\/s10898-018-0627-0"},{"key":"CIT0008","doi-asserted-by":"publisher","DOI":"10.1007\/s10589-015-9760-6"},{"key":"CIT0009","doi-asserted-by":"publisher","DOI":"10.1016\/0022-247X(87)90065-5"},{"key":"CIT0010","doi-asserted-by":"publisher","DOI":"10.1214\/009053604000000067"},{"key":"CIT0011","doi-asserted-by":"publisher","DOI":"10.1007\/s10898-011-9709-y"},{"key":"CIT0012","doi-asserted-by":"publisher","DOI":"10.1007\/s10898-010-9588-7"},{"key":"CIT0013","doi-asserted-by":"crossref","unstructured":"M. Ehrgott and M.M. Wiecek, Multiobjective programming, in Multiple Criteria Decision Analysis: State of the Art Surveys, International Series in Operations Research & Management Science Vol. 78, J. Figueira, S. Greco, and M. Ehrgott, eds., Springer, New York, 2005, pp. 667\u2013708.","DOI":"10.1007\/0-387-23081-5_17"},{"key":"CIT0014","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-54283-1"},{"key":"CIT0015","doi-asserted-by":"publisher","DOI":"10.1080\/10556788.2015.1025133"},{"key":"CIT0016","doi-asserted-by":"crossref","unstructured":"J. Giesen, S. Laue, A. L\u00f6hne and C. Schneider, Using Benson's algorithm for regularization parameter tracking, The Thirty-Third AAAI Conference on Artificial Intelligence, AAAI, AAAI Press, Palo Alto, 2019, pp. 3689\u20133696.","DOI":"10.1609\/aaai.v33i01.33013689"},{"key":"CIT0017","doi-asserted-by":"crossref","unstructured":"J. Giesen, F. Nussbaum, and C. Schneider, Efficient regularization parameter selection for latent variable graphical models via bi-level optimization, Proceedings of the Twenty-Eighth International Joint Conference on Artificial Intelligence, IJCAI, S. Kraus, ed., IJCAI.org, Palo Alto, 2019, pp.\u00a02378\u20132384.","DOI":"10.24963\/ijcai.2019\/330"},{"key":"CIT0018","doi-asserted-by":"crossref","unstructured":"M. Grant and S. Boyd, Graph implementations for nonsmooth convex programs, in Recent Advances in Learning and Control, Lecture Notes in Control and Information Sciences, V.D. Blondel, S.P. Boyd, and H. Kimura, ed., Vol.\u00a0371, Springer-Verlag Limited, London, 2008, pp. 95\u2013110.","DOI":"10.1007\/978-1-84800-155-8_7"},{"key":"CIT0019","unstructured":"M. Grant and S. Boyd, CVX: Matlab Software for Disciplined Convex Programming, version 2.1, CVX Research, Inc., Austin, 2014."},{"key":"CIT0020","doi-asserted-by":"crossref","unstructured":"R. Greer, A tutorial on polyhedral convex cones, in Trees and Hills: Methodology for Maximizing Functions of Systems of Linear Relations, North-Holland Mathematics Studies, Vol. 96, R. Greer, ed., North-Holland, Amsterdam, 1984, Chap. 2, pp. 15\u201381.","DOI":"10.1016\/S0304-0208(08)72857-3"},{"key":"CIT0021","unstructured":"Gurobi Optimization, LLC, Gurobi Optimizer Reference Manual, 2019. Available at http:\/\/www.gurobi.com"},{"key":"CIT0022","first-page":"545","volume":"17","author":"Guyon I.","year":"2005","journal-title":"Advances in Neural Information Processing Systems"},{"key":"CIT0023","unstructured":"A.H. Hamel, Translative sets and functions and their applications to risk measure theory and nonlinear separation, IMPA Report D21, Rio de Janeiro, 2006."},{"key":"CIT0024","doi-asserted-by":"publisher","DOI":"10.1007\/s10898-013-0098-2"},{"key":"CIT0025","doi-asserted-by":"publisher","DOI":"10.1007\/978-0-387-84858-7"},{"key":"CIT0026","doi-asserted-by":"publisher","DOI":"10.1080\/02331931003665108"},{"key":"CIT0027","doi-asserted-by":"publisher","DOI":"10.1007\/BF02592221"},{"key":"CIT0028","unstructured":"V. Kaibel, Basic polyhedral theory, in Wiley Encyclopedia of Operations Research and Management Science, J.J. Cochran, L.A. Cox, Jr., P. Keskinocak, J.P. Kharoufeh, and J.C. Smith, eds., American Cancer Society, Hoboken, 2011, pp. 396\u2013409."},{"key":"CIT0029","first-page":"136","volume":"32","author":"Kamenev G.K.","year":"1992","journal-title":"Zh. Vychisl. Mat. Mat. Fiz."},{"key":"CIT0030","doi-asserted-by":"publisher","DOI":"10.1137\/0108053"},{"key":"CIT0031","unstructured":"C. Lassez and J.L. Lassez, Quantifier elimination for conjunctions of linear constraints via a convex hull algorithm, in Symbolic and Numerical Computation for Artificial Intelligence, B.R. Donald, D. Kapur, and J.L. Mundy, eds., Academic Press, London, 1992, pp. 103\u2013119."},{"key":"CIT0032","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-18351-5"},{"key":"CIT0033","doi-asserted-by":"publisher","DOI":"10.1007\/s10898-013-0136-0"},{"key":"CIT0034","doi-asserted-by":"publisher","DOI":"10.1007\/s00186-016-0554-0"},{"key":"CIT0035","doi-asserted-by":"publisher","DOI":"10.1007\/BF00939046"},{"key":"CIT0036","doi-asserted-by":"publisher","DOI":"10.1093\/bioinformatics\/btm312"},{"key":"CIT0037","doi-asserted-by":"publisher","DOI":"10.1016\/S0140-6736(02)07746-2"},{"key":"CIT0038","doi-asserted-by":"publisher","DOI":"10.1515\/9781400873173"},{"key":"CIT0039","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-55197-5"},{"key":"CIT0040","doi-asserted-by":"publisher","DOI":"10.1007\/s10957-005-5494-4"},{"key":"CIT0041","doi-asserted-by":"publisher","DOI":"10.1007\/s00186-008-0220-2"},{"key":"CIT0042","doi-asserted-by":"publisher","DOI":"10.1007\/s00186-007-0194-5"},{"key":"CIT0043","first-page":"21","volume":"8","author":"Thieu T.V.","year":"1983","journal-title":"Acta Math. Vietnam"},{"key":"CIT0044","first-page":"3","volume":"8","author":"Tuy H.","year":"1983","journal-title":"Acta Math. Vietnam"},{"key":"CIT0045","doi-asserted-by":"publisher","DOI":"10.1007\/s10898-018-0666-6"},{"key":"CIT0046","doi-asserted-by":"publisher","DOI":"10.1287\/opre.15.1.147"},{"key":"CIT0047","first-page":"1","volume":"1","author":"Zhao Z.","year":"2010","journal-title":"ASU Feature Sel. Reposit."},{"key":"CIT0048","doi-asserted-by":"publisher","DOI":"10.1111\/j.1467-9868.2005.00503.x"}],"container-title":["Optimization Methods and Software"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.tandfonline.com\/doi\/pdf\/10.1080\/10556788.2021.1880579","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,10,4]],"date-time":"2022-10-04T17:19:14Z","timestamp":1664903954000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.tandfonline.com\/doi\/full\/10.1080\/10556788.2021.1880579"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,2,11]]},"references-count":48,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2022,5,4]]}},"alternative-id":["10.1080\/10556788.2021.1880579"],"URL":"https:\/\/doi.org\/10.1080\/10556788.2021.1880579","relation":{},"ISSN":["1055-6788","1029-4937"],"issn-type":[{"type":"print","value":"1055-6788"},{"type":"electronic","value":"1029-4937"}],"subject":[],"published":{"date-parts":[[2021,2,11]]},"assertion":[{"value":"The publishing and review policy for this title is described in its Aims & Scope.","order":1,"name":"peerreview_statement","label":"Peer Review Statement"},{"value":"http:\/\/www.tandfonline.com\/action\/journalInformation?show=aimsScope&journalCode=goms20","URL":"http:\/\/www.tandfonline.com\/action\/journalInformation?show=aimsScope&journalCode=goms20","order":2,"name":"aims_and_scope_url","label":"Aim & Scope"},{"value":"2020-06-26","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2021-01-19","order":2,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2021-02-11","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}