{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T07:20:08Z","timestamp":1740122408833,"version":"3.37.3"},"reference-count":43,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2022,2,22]],"date-time":"2022-02-22T00:00:00Z","timestamp":1645488000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,2,22]],"date-time":"2022-02-22T00:00:00Z","timestamp":1645488000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Comb Optim"],"published-print":{"date-parts":[[2022,8]]},"DOI":"10.1007\/s10878-022-00847-0","type":"journal-article","created":{"date-parts":[[2022,2,22]],"date-time":"2022-02-22T11:03:16Z","timestamp":1645527796000},"page":"583-602","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["A solution approach for cardinality minimization problem based on fractional programming"],"prefix":"10.1007","volume":"44","author":[{"given":"S. M.","family":"Mirhadi","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9894-7053","authenticated-orcid":false,"given":"S. A.","family":"MirHassani","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,2,22]]},"reference":[{"key":"847_CR1","unstructured":"Abdi MJ (2013) Cardinality Optimization Problems. phd thesis,School of Mathematics The University of Birmingham"},{"key":"847_CR2","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1007\/s10957-016-0934-x","volume":"1","author":"A Beck","year":"2016","unstructured":"Beck A, Vaisbourd Y (2016) The sparse principal component analysis problem: optimality conditions and algorithms. J Optim Theory Appl 1:119\u2013143","journal-title":"J Optim Theory Appl"},{"issue":"2","key":"847_CR3","doi-asserted-by":"publisher","first-page":"813","DOI":"10.1214\/15-AOS1388","volume":"44","author":"D Bertsimas","year":"2016","unstructured":"Bertsimas D, King A, Mazumder R (2016) Best subset selection via a modern optimization lens. Ann Stat 44(2):813\u2013852","journal-title":"Ann Stat"},{"issue":"1","key":"847_CR4","doi-asserted-by":"publisher","first-page":"858","DOI":"10.1137\/18M1186009","volume":"58","author":"W Bian","year":"2020","unstructured":"Bian W, Chen X (2020) A smoothing proximal gradient algorithm for nonsmooth convex regression with cardinality penalty. SIAM J Numer Anal 58(1):858\u2013883","journal-title":"SIAM J Numer Anal"},{"issue":"1","key":"847_CR5","doi-asserted-by":"publisher","first-page":"34","DOI":"10.1137\/060657704","volume":"51","author":"AM Bruckstein","year":"2009","unstructured":"Bruckstein AM, Donoho DL, Elad M (2009) From sparse solutions of systems of equations to sparse modeling of signals and images. SIAM Rev 51(1):34\u201381","journal-title":"SIAM Rev"},{"issue":"3","key":"847_CR6","first-page":"276","volume":"47","author":"C. F. Wang and. X. Y. Chu,","year":"2017","unstructured":"C. F. Wang and. X. Y. Chu, (2017) A new branch and bound method for solving sum of linear ratios problem. Int J Appl Math 47(3):276\u2013281","journal-title":"Int J Appl Math"},{"key":"847_CR7","doi-asserted-by":"publisher","first-page":"877","DOI":"10.1007\/s00041-008-9045-x","volume":"14","author":"EJ Cand\u00e8s","year":"2008","unstructured":"Cand\u00e8s EJ, Wakin MB, Boyd SP (2008) Enhancing sparsity by reweighted l1 minimization. J Fourier Anal Appl 14:877\u2013905","journal-title":"J Fourier Anal Appl"},{"issue":"1","key":"847_CR8","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1137\/S1064827596304010","volume":"20","author":"SS Chen","year":"1998","unstructured":"Chen SS, Donoho DL, Saunders MA (1998) Atomic Decomposition by Basis. SIAM J Sci Comput 20(1):33\u201361","journal-title":"SIAM J Sci Comput"},{"key":"847_CR9","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.knosys.2018.08.011","volume":"188","author":"Z Chen","year":"2019","unstructured":"Chen Z, Huang C, Lin S (2019) A new sparse representation framework for compressed sensing MRI. Knowl-Based Syst 188:1\u201310","journal-title":"Knowl-Based Syst"},{"key":"847_CR10","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1007\/s10589-013-9553-8","volume":"59","author":"X Chen","year":"2014","unstructured":"Chen X, Zhou W (2014) Convergence of the reweighted \u2113 1 minimization algorithm for \u2113 2\u2013\u2113 p minimization. Comput Optim Appl 59:47\u201361","journal-title":"Comput Optim Appl"},{"issue":"5","key":"847_CR11","first-page":"1626","volume":"31","author":"A Cui","year":"2019","unstructured":"Cui A, Peng J, Li H, Wen M (2019) Nonconvex fraction function recovery sparse signal by convex optimization algorithm. J Latex Class Files 31(5):1626\u20131637","journal-title":"J Latex Class Files"},{"key":"847_CR12","doi-asserted-by":"publisher","first-page":"2230","DOI":"10.1109\/TIT.2009.2016006","volume":"55","author":"W Dai","year":"2009","unstructured":"Dai W, Milenkovic O (2009) Subspace pursuit for compressive sensing signal reconstruction. IEEE Trans Inform Theory 55:2230\u20132249","journal-title":"IEEE Trans Inform Theory"},{"key":"847_CR13","doi-asserted-by":"crossref","unstructured":"Dinh T, Xin J (2020) Convergence of a Relaxed Variable Splitting Method forLearning Sparse Neural Networks via l1, l0, andTransformed-l1 Penalties. arXiv:1812.05719","DOI":"10.1007\/978-3-030-55180-3_27"},{"key":"847_CR14","doi-asserted-by":"publisher","first-page":"613","DOI":"10.1109\/18.382009","volume":"41","author":"DL Donoho","year":"1995","unstructured":"Donoho DL (1995) De-noising by soft-thresholdinng. IEEE Trans Inform Theory 41:613\u2013627","journal-title":"IEEE Trans Inform Theory"},{"issue":"4","key":"847_CR15","doi-asserted-by":"publisher","first-page":"1289","DOI":"10.1109\/TIT.2006.871582","volume":"52","author":"DL Donoho","year":"2006","unstructured":"Donoho DL (2006) Compressed sensing. IEEE Trans Inf Theory 52(4):1289\u20131306","journal-title":"IEEE Trans Inf Theory"},{"key":"847_CR16","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1023\/A:1008316327038","volume":"19","author":"RW Freund","year":"2001","unstructured":"Freund RW, Jarre F (2001) Solving the sum-of-ratios problem by an interior-point method. J Global Optim 19:83\u2013102","journal-title":"J Global Optim"},{"key":"847_CR17","doi-asserted-by":"publisher","first-page":"285","DOI":"10.1007\/s10107-011-0470-2","volume":"129","author":"D Ge","year":"2011","unstructured":"Ge D, Jiang X, Ye Y (2011) A note on the complexity of Lp minimization. Math Program 129:285\u2013299","journal-title":"Math Program"},{"issue":"1","key":"847_CR18","doi-asserted-by":"publisher","first-page":"141","DOI":"10.1007\/s10107-017-1181-0","volume":"169","author":"J-Y Gotoh","year":"2017","unstructured":"Gotoh J-Y, Takeda A, Tono K (2017) DC formulations and algorithms for sparse optimization problems. Math Program 169(1):141\u2013176","journal-title":"Math Program"},{"key":"847_CR19","unstructured":"Gruzdeva TV, Strekalovsky AS (2017) On solving the sum-of-ratios problem. Appl Math Comput 1\u201310"},{"key":"847_CR20","first-page":"45","volume":"59","author":"N Gulpinar","year":"2010","unstructured":"Gulpinar N, An LTH (2010) Robust investment strategies with discrete asset choice constraints using DC programming. J Math Program Oper Res 59:45\u201362","journal-title":"J Math Program Oper Res"},{"issue":"6","key":"847_CR21","doi-asserted-by":"publisher","first-page":"1898","DOI":"10.1109\/JSTARS.2019.2916058","volume":"12","author":"P Jia","year":"2019","unstructured":"Jia P, Zhang M, Shen Y (2019) Hypergraph learning and reweighted \u21131-norm minimization for hyperspectral unmixing. IEEE J Sel Top Appl Earth Observ Rem Sens 12(6):1898\u20131904","journal-title":"IEEE J Sel Top Appl Earth Observ Rem Sens"},{"issue":"3","key":"847_CR22","doi-asserted-by":"publisher","first-page":"723","DOI":"10.1016\/j.ejor.2015.01.039","volume":"243","author":"HW Jiao","year":"2015","unstructured":"Jiao HW, Liu SY (2015) A practicable branch and bound algorithm for sum of linear ratios problem. Eur J Oper Res 243(3):723\u2013730","journal-title":"Eur J Oper Res"},{"issue":"11","key":"847_CR23","doi-asserted-by":"publisher","first-page":"1426","DOI":"10.1080\/01630563.2017.1327869","volume":"38","author":"H Jiao","year":"2017","unstructured":"Jiao H, Liu S (2017) An efficient algorithm for quadratic sum-of-ratios fractional programs problem. Numer Funct Anal Optim 38(11):1426\u20131445","journal-title":"Numer Funct Anal Optim"},{"key":"847_CR24","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1137\/070686676","volume":"31","author":"S Jokar","year":"2008","unstructured":"Jokar S, Pfetsch M (2008) Exact and approximate sparse solutions of underdetermined linear equations. SIAM J Sci Comput 31:23\u201344","journal-title":"SIAM J Sci Comput"},{"key":"847_CR25","doi-asserted-by":"crossref","unstructured":"Kim Y, Jong Y, Yu J (2021) A parametric solution method for a generalized fractional programming problem. Indian J Pure Appl Math","DOI":"10.1007\/s13226-021-00102-y"},{"issue":"1","key":"847_CR26","doi-asserted-by":"publisher","first-page":"82","DOI":"10.1137\/090775397","volume":"21","author":"M-J Lai","year":"2011","unstructured":"Lai M-J, Wang J (2011) An unconstrained lq minimization with 0<q<=1 for sparse solution of underdetermined linear system. SIAM J Optim 21(1):82\u2013101","journal-title":"SIAM J Optim"},{"issue":"1\u20134","key":"847_CR27","first-page":"149","volume":"45","author":"O Mangasarian","year":"1999","unstructured":"Mangasarian O (1999) Minimum-support solutions of polyhedral concave programs. J Math Program Oper Res 45(1\u20134):149\u2013162","journal-title":"J Math Program Oper Res"},{"issue":"10","key":"847_CR28","doi-asserted-by":"publisher","first-page":"2283","DOI":"10.1016\/j.sigpro.2007.04.004","volume":"87","author":"I Markovsky","year":"2007","unstructured":"Markovsky I, Huffel SV (2007) Overview of total least-squares methods. Signal Process 87(10):2283\u20132302","journal-title":"Signal Process"},{"key":"847_CR29","doi-asserted-by":"crossref","unstructured":"Mehranian A, Saligheh Rad H, Ay MR, Rahmim A (2013) Smoothly clipped absolute deviation (SCAD) regularization for compressed sensing MRI using an augmented Lagrangian scheme. In: IEEE nuclear science symposiwn and medical imaging conference record (NSS\/MIC), pp 3646\u20133653","DOI":"10.1109\/NSSMIC.2012.6551838"},{"issue":"2","key":"847_CR30","doi-asserted-by":"publisher","first-page":"227","DOI":"10.1137\/S0097539792240406","volume":"24","author":"BK Natarajan","year":"1995","unstructured":"Natarajan BK (1995) Sparse approximate solutions to linear systems. SIAM J Comput 24(2):227\u2013234","journal-title":"SIAM J Comput"},{"key":"847_CR31","doi-asserted-by":"publisher","first-page":"301","DOI":"10.1016\/j.acha.2008.07.002","volume":"26","author":"D Needell","year":"2009","unstructured":"Needell D, Tropp JA (2009) Iterative signal recovery from incomplete and inaccurate samples. Appl Comput Harmon Anal 26:301\u2013321","journal-title":"Appl Comput Harmon Anal"},{"issue":"17","key":"847_CR32","doi-asserted-by":"publisher","first-page":"4481","DOI":"10.1109\/TSP.2017.2711501","volume":"65","author":"I Selesnick","year":"2017","unstructured":"Selesnick I (2017) Sparse regularization via convex analysis. IEEE Trans Signal Process 65(17):4481\u20134494","journal-title":"IEEE Trans Signal Process"},{"key":"847_CR33","doi-asserted-by":"publisher","first-page":"324","DOI":"10.1016\/j.cam.2018.10.038","volume":"350","author":"P Shen","year":"2019","unstructured":"Shen P, Huang B (2019) Range division and linearization algorithm for a class of linear ratios optimization problems. J Comput Appl Math 350:324\u2013342","journal-title":"J Comput Appl Math"},{"key":"847_CR34","first-page":"1","volume":"63","author":"PP Shen","year":"2018","unstructured":"Shen PP, Lu T (2018) Regional division and reduction algorithm for minimizing the sum of linear fractional functions. J Inequal Appl 63:1","journal-title":"J Inequal Appl"},{"key":"847_CR35","doi-asserted-by":"publisher","first-page":"36","DOI":"10.1016\/j.ejor.2019.03.014","volume":"278","author":"P Shen","year":"2019","unstructured":"Shen P, Zhu Z, Chen X (2019) A practicable contraction approach for sum of the generalized polynomial ratios problem. Eur J Oper Res 278:36\u201348","journal-title":"Eur J Oper Res"},{"key":"847_CR36","first-page":"1","volume":"1","author":"Z Shi","year":"2020","unstructured":"Shi Z, Zhou H, Xia Y, Liu W, Wang Y (2020) Random noise attenuation of common offset gathers using iteratively reweighted \u21132,1 norm minimization. IEEE Geosci Remote Sens Lett 1:1\u20135","journal-title":"IEEE Geosci Remote Sens Lett"},{"issue":"9","key":"847_CR37","doi-asserted-by":"publisher","first-page":"1091","DOI":"10.1049\/iet-spr.2018.5130","volume":"12","author":"Y Sun","year":"2018","unstructured":"Sun Y, Chen H, Tao J (2018) Sparse signal recovery via minimax-concave penalty and \u21131-norm loss function. IET Signal Proc 12(9):1091\u20131098","journal-title":"IET Signal Proc"},{"key":"847_CR41","doi-asserted-by":"crossref","unstructured":"Sun Y, Tan X, Li X, Lei L, kaung G (2019) Sparse optimization problem with s-difference regularization. Signal Process","DOI":"10.1016\/j.sigpro.2019.107369"},{"issue":"1","key":"847_CR38","doi-asserted-by":"crossref","first-page":"267","DOI":"10.1111\/j.2517-6161.1996.tb02080.x","volume":"58","author":"R Tibshirani","year":"1996","unstructured":"Tibshirani R (1996) Regression Shrinkage and Selection via the Lasso. J R Stat Soc Ser B (methodological) 58(1):267\u2013288","journal-title":"J R Stat Soc Ser B (methodological)"},{"key":"847_CR39","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1016\/j.acha.2012.08.004","volume":"35","author":"S Voronin","year":"2013","unstructured":"Voronin S, Woerdeman HJ (2013) A new iterative firm-thresholding algorithms for inverse problems with sparsity constraints. Appl Comput Harmonic Anal 35:151\u2013164","journal-title":"Appl Comput Harmonic Anal"},{"issue":"1","key":"847_CR40","doi-asserted-by":"publisher","first-page":"A536","DOI":"10.1137\/140952363","volume":"37","author":"P Yin","year":"2015","unstructured":"Yin P, Lou Y, He Q, Xin J (2015) Minimization of L1\u20132 for compressed sensing. SIAM J Sci Comput 37(1):A536\u2013A563","journal-title":"SIAM J Sci Comput"},{"issue":"10","key":"847_CR42","doi-asserted-by":"publisher","first-page":"1240","DOI":"10.1109\/LSP.2014.2331977","volume":"21","author":"X Zeng","year":"2014","unstructured":"Zeng X, Figueiredo MAT (2014) Decreasing weighted sorted l1 regularization. IEEE Signal Process Lett 21(10):1240\u20131244","journal-title":"IEEE Signal Process Lett"},{"issue":"58","key":"847_CR43","first-page":"2277","volume":"19","author":"T Zhang","year":"2013","unstructured":"Zhang T (2013) Multi-stage convex relaxation for feature selection. Bernoulli Soc Math Stat Probab 19(58):2277\u20132293","journal-title":"Bernoulli Soc Math Stat Probab"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-022-00847-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10878-022-00847-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-022-00847-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,9,19]],"date-time":"2024-09-19T00:37:38Z","timestamp":1726706258000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10878-022-00847-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,2,22]]},"references-count":43,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2022,8]]}},"alternative-id":["847"],"URL":"https:\/\/doi.org\/10.1007\/s10878-022-00847-0","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"type":"print","value":"1382-6905"},{"type":"electronic","value":"1573-2886"}],"subject":[],"published":{"date-parts":[[2022,2,22]]},"assertion":[{"value":"15 January 2022","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"22 February 2022","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}