{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,26]],"date-time":"2026-02-26T15:36:44Z","timestamp":1772120204015,"version":"3.50.1"},"reference-count":36,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2023,10,3]],"date-time":"2023-10-03T00:00:00Z","timestamp":1696291200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2023,10,3]],"date-time":"2023-10-03T00:00:00Z","timestamp":1696291200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"name":"Serbian Ministry of Education, Science, and Technological Development and Serbian Academy of Science and Arts,","award":["F10"],"award-info":[{"award-number":["F10"]}]},{"DOI":"10.13039\/501100001871","name":"Funda\u00e7\u00e3o para a Ci\u00eancia e a Tecnologia","doi-asserted-by":"publisher","award":["UIDB\/MAT\/00297\/2020"],"award-info":[{"award-number":["UIDB\/MAT\/00297\/2020"]}],"id":[{"id":"10.13039\/501100001871","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001871","name":"Funda\u00e7\u00e3o para a Ci\u00eancia e a Tecnologia","doi-asserted-by":"publisher","award":["UIDB\/MAT\/00297\/2020"],"award-info":[{"award-number":["UIDB\/MAT\/00297\/2020"]}],"id":[{"id":"10.13039\/501100001871","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Funda\u00e7\u00e3o para a Ci\u00eancia e a Tecnologia,Portugal","award":["UIDP\/MAT\/00297\/2020"],"award-info":[{"award-number":["UIDP\/MAT\/00297\/2020"]}]},{"name":"Funda\u00e7\u00e3o para a Ci\u00eancia e a Tecnologia,Portugal","award":["UIDP\/MAT\/00297\/2020"],"award-info":[{"award-number":["UIDP\/MAT\/00297\/2020"]}]},{"DOI":"10.13039\/501100005855","name":"Universidade Nova de Lisboa","doi-asserted-by":"crossref","id":[{"id":"10.13039\/501100005855","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Oper. Res. Forum"],"abstract":"<jats:title>Abstract<\/jats:title>\n                  <jats:p>We consider convex constrained optimization problems that also include a cardinality constraint. In general, optimization problems with cardinality constraints are difficult mathematical programs which are usually solved by global techniques from discrete optimization. We assume that the region defined by the convex constraints can be written as the intersection of a finite collection of convex sets, such that it is easy and inexpensive to project onto each one of them (e.g., boxes, hyper-planes, or half-spaces). Taking advantage of a recently developed continuous reformulation that relaxes the cardinality constraint, we propose a specialized penalty gradient projection scheme combined with alternating projection ideas to compute a solution candidate for these problems, i.e., a local (possibly non-global) solution. To illustrate the proposed algorithm, we focus on the standard mean-variance portfolio optimization problem for which we can only invest in a preestablished limited number of assets. For these portfolio problems with cardinality constraints, we present a numerical study on a variety of data sets involving real-world capital market indices from major stock markets. In many cases, we observe that the proposed scheme converges to the global solution. On those data sets, we illustrate the practical performance of the proposed scheme to produce the effective frontiers for different values of the limited number of allowed assets.<\/jats:p>","DOI":"10.1007\/s43069-023-00257-w","type":"journal-article","created":{"date-parts":[[2023,10,3]],"date-time":"2023-10-03T05:03:07Z","timestamp":1696309387000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["A Low-Cost Alternating Projection Approach for a Continuous Formulation of Convex and Cardinality Constrained Optimization"],"prefix":"10.1007","volume":"4","author":[{"given":"N.","family":"Kreji\u0107","sequence":"first","affiliation":[]},{"given":"E. H. M.","family":"Krulikovski","sequence":"additional","affiliation":[]},{"given":"M.","family":"Raydan","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,10,3]]},"reference":[{"issue":"11","key":"257_CR1","doi-asserted-by":"publisher","first-page":"1069","DOI":"10.1057\/jors.1990.166","volume":"41","author":"JE Beasley","year":"1990","unstructured":"Beasley JE (1990) OR-Library: distributing test problems by electronic mail. J Oper Res Soc 41(11):1069\u20131072","journal-title":"J Oper Res Soc"},{"key":"257_CR2","doi-asserted-by":"publisher","first-page":"807","DOI":"10.1007\/s10898-022-01178-4","volume":"84","author":"DE Bernal","year":"2022","unstructured":"Bernal DE, Peng Z, Kronqvist J, Grossmann IE (2022) Alternative regularizations for Outer-Approximation algorithms for convex MINLP. J Glob Optim 84:807\u2013842","journal-title":"J Glob Optim"},{"issue":"1","key":"257_CR3","first-page":"49","volume":"29","author":"D Bertsimas","year":"1999","unstructured":"Bertsimas D, Darnell C, Soucy R (1999) Portfolio construction through mixed-integer programming at Grantham. Mayo, Van Otterloo and Company, Interfaces 29(1):49\u201366","journal-title":"Mayo, Van Otterloo and Company, Interfaces"},{"key":"257_CR4","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s10589-007-9126-9","volume":"43","author":"D Bertsimas","year":"2009","unstructured":"Bertsimas D, Shioda R (2009) Algorithm for cardinality-constrained quadratic optimization. Comput Optim Appl 43:1\u201322","journal-title":"Comput Optim Appl"},{"key":"257_CR5","doi-asserted-by":"publisher","first-page":"121","DOI":"10.1007\/BF02592208","volume":"74","author":"D Bienstock","year":"1996","unstructured":"Bienstock D (1996) Computational study of a family of mixed-integer quadratic programming problems. Math Programming 74:121\u2013140","journal-title":"Math Programming"},{"key":"257_CR6","doi-asserted-by":"publisher","first-page":"1196","DOI":"10.1137\/S1052623497330963","volume":"10","author":"EG Birgin","year":"2000","unstructured":"Birgin EG, Mart\u00ednez JM, Raydan M (2000) Nonmonotone spectral projected gradient methods on convex sets. SIAM J Optim 10:1196\u20131211","journal-title":"SIAM J Optim"},{"key":"257_CR7","doi-asserted-by":"publisher","first-page":"340","DOI":"10.1145\/502800.502803","volume":"27","author":"EG Birgin","year":"2001","unstructured":"Birgin EG, Mart\u00ednez JM, Raydan M (2001) Algorithm 813: SPG - software for convex-constrained optimization. ACM Trans Math Softw 27:340\u2013349","journal-title":"ACM Trans Math Softw"},{"key":"257_CR8","doi-asserted-by":"publisher","first-page":"539","DOI":"10.1093\/imanum\/23.4.539","volume":"23","author":"EG Birgin","year":"2003","unstructured":"Birgin EG, Mart\u00ednez JM, Raydan M (2003) Inexact spectral projected gradient methods on convex sets. IMA J Numer Anal 23:539\u2013559","journal-title":"IMA J Numer Anal"},{"key":"257_CR9","doi-asserted-by":"crossref","unstructured":"Birgin EG, Mart\u00ednez JM, Raydan M (2014) Spectral projected gradient methods: review and perspectives. J Stat Softw 60(3)","DOI":"10.18637\/jss.v060.i03"},{"key":"257_CR10","doi-asserted-by":"publisher","first-page":"1405","DOI":"10.1137\/03060062X","volume":"26","author":"EG Birgin","year":"2005","unstructured":"Birgin EG, Raydan M (2005) Robust stopping criteria for Dykstra\u2019s algorithm. SIAM J Sci Comput 26:1405\u20131414","journal-title":"SIAM J Sci Comput"},{"key":"257_CR11","series-title":"Lecture Notes in Statistics, 37: 28\u201347","volume-title":"Advances in Order Restricted Statistical Inference","author":"JP Boyle","year":"1986","unstructured":"Boyle JP, Dykstra L (1986) A method for finding projections onto the intersections of convex sets in Hilbert spaces. In: Dykstra R, Robertson T, Wright FT (eds) Advances in Order Restricted Statistical Inference. Lecture Notes in Statistics, 37: 28\u201347. Springer, New York"},{"issue":"1","key":"257_CR12","doi-asserted-by":"publisher","first-page":"397","DOI":"10.1137\/140978077","volume":"26","author":"OP Burdakov","year":"2016","unstructured":"Burdakov OP, Kanzow C, Schwartz A (2016) Mathematical programs with cardinality constraints: reformulation by complementarity-type conditions and a regularization method. SIAM J Optim 26(1):397\u2013425","journal-title":"SIAM J Optim"},{"key":"257_CR13","first-page":"37","volume":"72","author":"F Cesarone","year":"2009","unstructured":"Cesarone F, Scozzari A, Tardella F (2009) Efficient algorithms for mean-variance portfolio optimization with hard real-world constraints. Giornale dell\u2019Istituto Italiano degli Attuari 72:37\u201356","journal-title":"Giornale dell\u2019Istituto Italiano degli Attuari"},{"key":"257_CR14","doi-asserted-by":"publisher","first-page":"213","DOI":"10.1007\/s10479-012-1165-7","volume":"205","author":"F Cesarone","year":"2013","unstructured":"Cesarone F, Scozzari A, Tardella F (2013) A new method for mean-variance portfolio optimization with cardinality constraints. Ann Oper Res 205:213\u2013234","journal-title":"Ann Oper Res"},{"issue":"13","key":"257_CR15","doi-asserted-by":"publisher","first-page":"1271","DOI":"10.1016\/S0305-0548(99)00074-X","volume":"27","author":"TJ Chang","year":"2000","unstructured":"Chang TJ, Meade N, Beasley JE, Sharaiha YM (2000) Heuristics for cardinality constrained portfolio optimisation. Comput Oper Res 27(13):1271\u20131302","journal-title":"Comput Oper Res"},{"issue":"38","key":"257_CR16","first-page":"1","volume":"20","author":"Y Chen","year":"2019","unstructured":"Chen Y, Ye Y, Wang M (2019) Approximation hardness for a class of sparse optimization problems. J Mach Learn Res 20(38):1\u201327","journal-title":"J Mach Learn Res"},{"key":"257_CR17","doi-asserted-by":"publisher","first-page":"538","DOI":"10.1137\/S036301299732626X","volume":"38","author":"PL Combettes","year":"2000","unstructured":"Combettes PL (2000) Strong convergence of block-iterative outer approximation methods for convex optimization. SIAM J Control Optim 38:538\u2013565","journal-title":"SIAM J Control Optim"},{"key":"257_CR18","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4684-9298-9","volume-title":"Best approximation in inner product spaces","author":"FR Deutsch","year":"2001","unstructured":"Deutsch FR (2001) Best approximation in inner product spaces. Springer-Verlag, New York"},{"key":"257_CR19","doi-asserted-by":"publisher","first-page":"983","DOI":"10.1080\/10556788.2011.577773","volume":"27","author":"D Di Lorenzo","year":"2012","unstructured":"Di Lorenzo D, Liuzzi G, Rinaldi F, Schoen F, Sciandrone M (2012) A concave optimization-based approach for sparse portfolio selection. Optim Methods Softw 27:983\u20131000","journal-title":"Optim Methods Softw"},{"key":"257_CR20","doi-asserted-by":"publisher","DOI":"10.1137\/9781611971941","volume-title":"Alternating projection methods","author":"R Escalante","year":"2011","unstructured":"Escalante R, Raydan M (2011) Alternating projection methods. SIAM, Philadelphia"},{"issue":"3","key":"257_CR21","doi-asserted-by":"publisher","first-page":"417","DOI":"10.1007\/s10287-014-0227-5","volume":"12","author":"B Fastrich","year":"2015","unstructured":"Fastrich B, Paterlini S, Winkler P (2015) Constructing optimal sparse portfolios using regularization methods. Comput Manag Sci 12(3):417\u2013434","journal-title":"Comput Manag Sci"},{"key":"257_CR22","volume-title":"Nonlinear programming: sequential unconstrained minimization techniques","author":"AV Fiacco","year":"1968","unstructured":"Fiacco AV, McCormick GP (1968) Nonlinear programming: sequential unconstrained minimization techniques. John Wiley and Sons, New York"},{"issue":"3","key":"257_CR23","doi-asserted-by":"publisher","first-page":"745","DOI":"10.1287\/opre.2013.1170","volume":"61","author":"JJ Gao","year":"2013","unstructured":"Gao JJ, Li D (2013) Optimal cardinality constrained portfolio selection. Oper Res 61(3):745\u2013761","journal-title":"Oper Res"},{"key":"257_CR24","doi-asserted-by":"publisher","DOI":"10.1111\/itor.13121","author":"P Juszczuk","year":"2022","unstructured":"Juszczuk P, Kaliszewski I, Miroforidis J, Podkopaev D (2022) Mean return - standard deviation efficient frontier approximation with low-cardinality portfolios in the presence of the risk-free asset. Int Trans Oper Res. https:\/\/doi.org\/10.1111\/itor.13121","journal-title":"Int Trans Oper Res"},{"key":"257_CR25","doi-asserted-by":"publisher","first-page":"185","DOI":"10.1007\/s10589-021-00298-z","volume":"80","author":"C Kanzow","year":"2021","unstructured":"Kanzow C, Raharja AB, Schwartz A (2021) Sequential optimality conditions for cardinality-constrained optimization problems with applications. Comput Optim Appl 80:185\u2013211","journal-title":"Comput Optim Appl"},{"issue":"8","key":"257_CR26","first-page":"4626","volume":"218","author":"N Kreji\u0107","year":"2011","unstructured":"Kreji\u0107 N, Kumaresan M, Ro\u017enjik A (2011) VaR optimal portfolio with transaction costs. Appl Math Comput 218(8):4626\u20134637","journal-title":"Appl Math Comput"},{"key":"257_CR27","doi-asserted-by":"publisher","first-page":"397","DOI":"10.1007\/s11081-018-9411-8","volume":"20","author":"J Kronqvist","year":"2019","unstructured":"Kronqvist J, Bernal DE, Lundell A, Grossmann IE (2019) A review and comparison of solvers for convex MINLP. Optim Eng 20:397\u2013455","journal-title":"Optim Eng"},{"key":"257_CR28","doi-asserted-by":"publisher","first-page":"3451","DOI":"10.1007\/s00245-021-09752-0","volume":"84","author":"EHM Krulikovski","year":"2021","unstructured":"Krulikovski EHM, Ribeiro AA, Sachine M (2021) On the weak stationarity conditions for mathematical programs with cardinality constraints: a unified approach. Appl Math Optim 84:3451\u20133473","journal-title":"Appl Math Optim"},{"key":"257_CR29","doi-asserted-by":"publisher","first-page":"1067","DOI":"10.1007\/s10957-022-02007-0","volume":"192","author":"EHM Krulikovski","year":"2022","unstructured":"Krulikovski EHM, Ribeiro AA, Sachine M (2022) A comparative study of sequential optimality conditions for mathematical programs with cardinality constraints. JOTA 192:1067\u20131083","journal-title":"JOTA"},{"key":"257_CR30","volume-title":"Linear and nonlinear programming","author":"DG Luenberger","year":"1984","unstructured":"Luenberger DG (1984) Linear and nonlinear programming. Addison-Wesley, Menlo Park, CA"},{"key":"257_CR31","doi-asserted-by":"publisher","first-page":"2137","DOI":"10.1016\/B978-0-444-63965-3.50358-5","volume":"40","author":"A Lundell","year":"2017","unstructured":"Lundell A, Kronqvist J, Westerlund T (2017) SHOT - a global solver for convex MINLP in Wolfram Mathematica. Comput Aided Chem Eng 40:2137\u20132142","journal-title":"Comput Aided Chem Eng"},{"key":"257_CR32","first-page":"77","volume":"7","author":"H Markowitz","year":"1952","unstructured":"Markowitz H (1952) Portfolio selection. J Financ 7:77\u201391","journal-title":"J Financ"},{"key":"257_CR33","doi-asserted-by":"publisher","first-page":"1784","DOI":"10.1016\/j.ymssp.2008.06.011","volume":"23","author":"J Moreno","year":"2009","unstructured":"Moreno J, Datta B, Raydan M (2009) A symmetry preserving alternating projection method for matrix model updating. Systems and Signal Processing 23:1784\u20131791","journal-title":"Systems and Signal Processing"},{"key":"257_CR34","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1007\/BF00138693","volume":"8","author":"NV Sahinidis","year":"1996","unstructured":"Sahinidis NV (1996) BARON: a general purpose global optimization software package. J Glob Optim 8:201\u2013205","journal-title":"J Glob Optim"},{"issue":"3","key":"257_CR35","doi-asserted-by":"publisher","first-page":"563","DOI":"10.1080\/10556788.2017.1335312","volume":"33","author":"S Vigerske","year":"2018","unstructured":"Vigerske S, Gleixner A (2018) SCIP: global optimization of mixed-integer nonlinear programs in a branch-and-cut framework. Optim Methods Softw 33(3):563\u2013593","journal-title":"Optim Methods Softw"},{"issue":"4","key":"257_CR36","doi-asserted-by":"publisher","first-page":"690","DOI":"10.1287\/ijoc.2014.0592","volume":"26","author":"X Zeng","year":"2014","unstructured":"Zeng X, Sun X, Li D (2014) Improving the performance of MIQP solvers for quadratic programs with cardinality and minimum threshold constraints: a semidefinite program approach. INFORMS J Comput 26(4):690\u2013703","journal-title":"INFORMS J Comput"}],"container-title":["Operations Research Forum"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s43069-023-00257-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s43069-023-00257-w\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s43069-023-00257-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,2,2]],"date-time":"2024-02-02T12:34:53Z","timestamp":1706877293000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s43069-023-00257-w"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,10,3]]},"references-count":36,"journal-issue":{"issue":"4","published-online":{"date-parts":[[2023,12]]}},"alternative-id":["257"],"URL":"https:\/\/doi.org\/10.1007\/s43069-023-00257-w","relation":{"has-preprint":[{"id-type":"doi","id":"10.21203\/rs.3.rs-2845120\/v1","asserted-by":"object"}]},"ISSN":["2662-2556"],"issn-type":[{"value":"2662-2556","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,10,3]]},"assertion":[{"value":"21 April 2023","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"11 September 2023","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"3 October 2023","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"Not applicable.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Ethics Approval"}},{"value":"Not applicable.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Consent to Participate"}},{"value":"All authors read and approved the submission of the final manuscript.","order":4,"name":"Ethics","group":{"name":"EthicsHeading","label":"Consent for Publication"}},{"value":"The authors declare no competing interests.","order":5,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of Interest"}}],"article-number":"73"}}