{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,4]],"date-time":"2026-03-04T18:14:07Z","timestamp":1772648047215,"version":"3.50.1"},"reference-count":47,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2019,8,12]],"date-time":"2019-08-12T00:00:00Z","timestamp":1565568000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2019,8,12]],"date-time":"2019-08-12T00:00:00Z","timestamp":1565568000000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["11601343"],"award-info":[{"award-number":["11601343"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Research Grants Council of Hong Kong","award":["UGC\/FDS14\/P03\/14"],"award-info":[{"award-number":["UGC\/FDS14\/P03\/14"]}]},{"name":"Research Grants Council of Hong Kong","award":["UGC\/FDS14\/P02\/15"],"award-info":[{"award-number":["UGC\/FDS14\/P02\/15"]}]},{"name":"Research Grants Council of Hong Kong","award":["PolyU 152342\/16E"],"award-info":[{"award-number":["PolyU 152342\/16E"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Glob Optim"],"published-print":{"date-parts":[[2019,12]]},"DOI":"10.1007\/s10898-019-00818-6","type":"journal-article","created":{"date-parts":[[2019,8,12]],"date-time":"2019-08-12T07:02:55Z","timestamp":1565593375000},"page":"1003-1028","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":12,"title":["Incremental quasi-subgradient methods for minimizing the sum of quasi-convex functions"],"prefix":"10.1007","volume":"75","author":[{"given":"Yaohua","family":"Hu","sequence":"first","affiliation":[]},{"given":"Carisa Kwok Wai","family":"Yu","sequence":"additional","affiliation":[]},{"given":"Xiaoqi","family":"Yang","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,8,12]]},"reference":[{"key":"818_CR1","first-page":"359","volume":"69","author":"Y Almogy","year":"1970","unstructured":"Almogy, Y., Levin, O.: Parametric analysis of a multi-stage stochastic shipping problem. Oper. Res. 69, 359\u2013370 (1970)","journal-title":"Oper. Res."},{"key":"818_CR2","doi-asserted-by":"crossref","first-page":"27","DOI":"10.1007\/s10107-007-0147-z","volume":"120","author":"A Auslender","year":"2009","unstructured":"Auslender, A., Teboulle, M.: Projected subgradient methods with non-Euclidean distances for non-differentiable convex minimization and variational inequalities. Math. Program. 120, 27\u201348 (2009)","journal-title":"Math. Program."},{"key":"818_CR3","doi-asserted-by":"crossref","first-page":"219","DOI":"10.1023\/A:1008728926224","volume":"8","author":"D Aussel","year":"2000","unstructured":"Aussel, D., Daniilidis, A.: Normal characterization of the main classes of quasiconvex functions. Set Valued Anal. 8, 219\u2013236 (2000)","journal-title":"Set Valued Anal."},{"key":"818_CR4","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4684-7600-2","volume-title":"Generalized Concavity","author":"M Avriel","year":"1988","unstructured":"Avriel, M., Diewert, W.E., Schaible, S., Zang, I.: Generalized Concavity. Plenum Press, New York (1988)"},{"issue":"3","key":"818_CR5","doi-asserted-by":"crossref","first-page":"367","DOI":"10.1137\/S0036144593251710","volume":"38","author":"HH Bauschke","year":"1996","unstructured":"Bauschke, H.H., Borwein, J.M.: On projection algorithms for solving convex feasibility problems. SIAM Rev. 38(3), 367\u2013426 (1996)","journal-title":"SIAM Rev."},{"key":"818_CR6","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/s10957-010-9647-8","volume":"146","author":"H Benson","year":"2010","unstructured":"Benson, H.: Branch-and-bound outer approximation algorithm for sum-of-ratios fractional programs. J. Optim. Theory Appl. 146, 1\u201318 (2010)","journal-title":"J. Optim. Theory Appl."},{"key":"818_CR7","volume-title":"Convex Optimization Algorithms","author":"DP Bertsekas","year":"2015","unstructured":"Bertsekas, D.P.: Convex Optimization Algorithms. Athena Scientific, Belmont (2015)"},{"issue":"2","key":"818_CR8","doi-asserted-by":"crossref","first-page":"163","DOI":"10.1007\/s10107-011-0472-0","volume":"129","author":"DP Bertsekas","year":"2011","unstructured":"Bertsekas, D.P.: Incremental proximal methods for large scale convex optimization. Math. Program. 129(2), 163\u2013195 (2011)","journal-title":"Math. Program."},{"key":"818_CR9","volume-title":"Neuro-Dynamic Programming","author":"DP Bertsekas","year":"1996","unstructured":"Bertsekas, D.P., Tsitsiklis, J.N.: Neuro-Dynamic Programming. Athena Scientific, Belmont (1996)"},{"issue":"2","key":"818_CR10","doi-asserted-by":"crossref","first-page":"350","DOI":"10.1287\/opre.22.2.350","volume":"22","author":"SP Bradley","year":"1974","unstructured":"Bradley, S.P., Frey, S.C.: Fractional programming with homogeneous functions. Oper. Res. 22(2), 350\u2013357 (1974)","journal-title":"Oper. Res."},{"issue":"1","key":"818_CR11","doi-asserted-by":"crossref","first-page":"34","DOI":"10.1016\/j.cam.2005.01.026","volume":"185","author":"Y Censor","year":"2006","unstructured":"Censor, Y., Segal, A.: Algorithms for the quasiconvex feasibility problem. J. Comput. Appl. Math. 185(1), 34\u201350 (2006)","journal-title":"J. Comput. Appl. Math."},{"key":"818_CR12","first-page":"467","volume":"44","author":"CS Colantoni","year":"1969","unstructured":"Colantoni, C.S., Manes, R.P., Whinston, A.: Programming, profit rates, and pricing decisions. Account. Rev. 44, 467\u2013481 (1969)","journal-title":"Account. Rev."},{"key":"818_CR13","volume-title":"Generalized Convexity, Generalized Monotonicity","year":"1998","unstructured":"Crouzeix, J.-P., Martinez-Legaz, J.-E., Volle, M. (eds.): Generalized Convexity, Generalized Monotonicity. Kluwer Academic Publishers, Dordrecht (1998)"},{"key":"818_CR14","first-page":"2121","volume":"12","author":"J Duchi","year":"2011","unstructured":"Duchi, J., Hazan, E., Singer, Y.: Adaptive subgradient methods for online learning and stochastic optimization. J. Mach. Learn. Res. 12, 2121\u20132159 (2011)","journal-title":"J. Mach. Learn. Res."},{"key":"818_CR15","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/BF01071403","volume":"2","author":"YM Ermoliev","year":"1966","unstructured":"Ermoliev, Y.M.: Methods of solution of nonlinear extremal problems. Cybern. Syst. Anal. 2, 1\u201314 (1966)","journal-title":"Cybern. Syst. Anal."},{"key":"818_CR16","doi-asserted-by":"crossref","first-page":"83","DOI":"10.1023\/A:1008316327038","volume":"19","author":"RW Freund","year":"2001","unstructured":"Freund, R.W., Jarre, F.: Solving the sum-of-ratios problem by an interior-point method. J. Glob. Optim. 19, 83\u2013102 (2001)","journal-title":"J. Glob. Optim."},{"key":"818_CR17","first-page":"437","volume":"15","author":"HJ Greenberg","year":"1973","unstructured":"Greenberg, H.J., Pierskalla, W.P.: Quasiconjugate functions and surrogate duality. Cahiers Centre \u00c9tudes Recherche Op\u00e9rationnelle 15, 437\u2013448 (1973)","journal-title":"Cahiers Centre \u00c9tudes Recherche Op\u00e9rationnelle"},{"key":"818_CR18","doi-asserted-by":"crossref","first-page":"182","DOI":"10.1007\/978-1-4613-3632-7_10","volume-title":"Large Scale Optimization: State of the Art","author":"J-L Goffin","year":"1994","unstructured":"Goffin, J.-L., Luo, Z.-Q., Ye, Y.: On the complexity of a column generation algorithm for convex or quasiconvex feasibility problems. In: Hager, W.W., Hearn, D.W., Pardalos, P.M. (eds.) Large Scale Optimization: State of the Art, pp. 182\u2013191. Kluwer Academic Publishers, Dordrecht (1994)"},{"key":"818_CR19","volume-title":"Handbook of Generalized Convexity and Generalized Monotonicity","year":"2005","unstructured":"Hadjisavvas, N., Koml\u00f3si, S., Schaible, S. (eds.): Handbook of Generalized Convexity and Generalized Monotonicity. Springer, New York (2005)"},{"issue":"2","key":"818_CR20","doi-asserted-by":"crossref","first-page":"1207","DOI":"10.1137\/140993090","volume":"26","author":"Y Hu","year":"2016","unstructured":"Hu, Y., Li, C., Yang, X.: On convergence rates of linearized proximal algorithms for convex composite optimization with applications. SIAM J. Optim. 26(2), 1207\u20131235 (2016)","journal-title":"SIAM J. Optim."},{"issue":"2","key":"818_CR21","doi-asserted-by":"crossref","first-page":"315","DOI":"10.1016\/j.ejor.2014.05.017","volume":"240","author":"Y Hu","year":"2015","unstructured":"Hu, Y., Yang, X., Sim, C.-K.: Inexact subgradient methods for quasi-convex optimization problems. Eur. J. Oper. Res. 240(2), 315\u2013327 (2015)","journal-title":"Eur. J. Oper. Res."},{"issue":"4","key":"818_CR22","first-page":"711","volume":"17","author":"Y Hu","year":"2016","unstructured":"Hu, Y., Yu, C.K.W., Li, C.: Stochastic subgradient method for quasi-convex optimization problems. J. Nonlinear Convex Anal. 17(4), 711\u2013724 (2016)","journal-title":"J. Nonlinear Convex Anal."},{"issue":"10","key":"818_CR23","first-page":"2143","volume":"17","author":"Y Hu","year":"2016","unstructured":"Hu, Y., Yu, C.K.W., Li, C., Yang, X.: Conditional subgradient methods for constrained quasi-convex optimization problems. J. Nonlinear Convex Anal. 17(10), 2143\u20132158 (2016)","journal-title":"J. Nonlinear Convex Anal."},{"issue":"3","key":"818_CR24","doi-asserted-by":"crossref","first-page":"533","DOI":"10.1287\/moor.28.3.533.16395","volume":"28","author":"X Huang","year":"2003","unstructured":"Huang, X., Yang, X.: A unified augmented Lagrangian approach to duality and exact penalization. Math. Oper. Res. 28(3), 533\u2013552 (2003)","journal-title":"Math. Oper. Res."},{"issue":"3","key":"818_CR25","doi-asserted-by":"crossref","first-page":"1157","DOI":"10.1137\/08073038X","volume":"20","author":"B Johansson","year":"2009","unstructured":"Johansson, B., Rabi, M., Johansson, M.: A randomized incremental subgradient method for distributed optimization in networked systems. SIAM J. Optim. 20(3), 1157\u20131170 (2009)","journal-title":"SIAM J. Optim."},{"key":"818_CR26","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/PL00011414","volume":"90","author":"KC Kiwiel","year":"2001","unstructured":"Kiwiel, K.C.: Convergence and efficiency of subgradient methods for quasiconvex minimization. Math. Program. 90, 1\u201325 (2001)","journal-title":"Math. Program."},{"issue":"3","key":"818_CR27","doi-asserted-by":"crossref","first-page":"807","DOI":"10.1137\/S1052623400376366","volume":"14","author":"KC Kiwiel","year":"2004","unstructured":"Kiwiel, K.C.: Convergence of approximate and incremental subgradient methods for convex optimization. SIAM J. Optim. 14(3), 807\u2013840 (2004)","journal-title":"SIAM J. Optim."},{"key":"818_CR28","doi-asserted-by":"crossref","first-page":"143","DOI":"10.15807\/jorsj.32.143","volume":"32","author":"H Konno","year":"1989","unstructured":"Konno, H., Inori, M.: Bond portfolio optimization by bilinear fractional programming. J. Oper. Res. Soc. Jpn. 32, 143\u2013158 (1989)","journal-title":"J. Oper. Res. Soc. Jpn."},{"key":"818_CR29","doi-asserted-by":"crossref","first-page":"2760","DOI":"10.1007\/BF02110582","volume":"71","author":"IV Konnov","year":"1994","unstructured":"Konnov, I.V.: On properties of supporting and quasi-supporting vectors. J. Math. Sci. 71, 2760\u20132763 (1994)","journal-title":"J. Math. Sci."},{"issue":"1","key":"818_CR30","doi-asserted-by":"crossref","first-page":"53","DOI":"10.1080\/1055678031000111236","volume":"18","author":"IV Konnov","year":"2003","unstructured":"Konnov, I.V.: On convergence properties of a subgradient method. Optim. Methods Softw. 18(1), 53\u201362 (2003)","journal-title":"Optim. Methods Softw."},{"key":"818_CR31","doi-asserted-by":"crossref","first-page":"382","DOI":"10.1016\/0377-2217(94)00200-2","volume":"88","author":"T Larsson","year":"1996","unstructured":"Larsson, T., Patriksson, M., Str\u00f6mberg, A.-B.: Conditional subgradient optimization: theory and applications. Eur. J. Oper. Res. 88, 382\u2013403 (1996)","journal-title":"Eur. J. Oper. Res."},{"issue":"2","key":"818_CR32","doi-asserted-by":"crossref","first-page":"829","DOI":"10.1137\/140957639","volume":"25","author":"J Mairal","year":"2015","unstructured":"Mairal, J.: Incremental majorization-minimization optimization with application to large-scale machine learning. SIAM J. Optim. 25(2), 829\u2013855 (2015)","journal-title":"SIAM J. Optim."},{"issue":"1","key":"818_CR33","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1137\/S1052623499362111","volume":"12","author":"A Nedi\u0107","year":"2001","unstructured":"Nedi\u0107, A., Bertsekas, D.P.: Incremental subgradient methods for nondifferentiable optimization. SIAM J. Optim. 12(1), 109\u2013138 (2001)","journal-title":"SIAM J. Optim."},{"key":"818_CR34","doi-asserted-by":"crossref","first-page":"75","DOI":"10.1007\/s10107-008-0262-5","volume":"125","author":"A Nedi\u0107","year":"2010","unstructured":"Nedi\u0107, A., Bertsekas, D.P.: The effect of deterministic noise in subgradient methods. Math. Program. 125, 75\u201399 (2010)","journal-title":"Math. Program."},{"key":"818_CR35","doi-asserted-by":"crossref","first-page":"221","DOI":"10.1007\/s10107-007-0149-x","volume":"120","author":"Y Nesterov","year":"2009","unstructured":"Nesterov, Y.: Primal\u2013dual subgradient methods for convex problems. Math. Program. 120, 221\u2013259 (2009)","journal-title":"Math. Program."},{"issue":"3","key":"818_CR36","doi-asserted-by":"crossref","first-page":"1547","DOI":"10.1137\/070711712","volume":"20","author":"ESH Neto","year":"2009","unstructured":"Neto, E.S.H., Pierro, A.R.D.: Incremental subgradients for constrained convex optimization: a unified framework and new methods. SIAM J. Optim. 20(3), 1547\u20131572 (2009)","journal-title":"SIAM J. Optim."},{"issue":"10","key":"818_CR37","doi-asserted-by":"crossref","first-page":"1885","DOI":"10.1080\/02331934.2016.1189551","volume":"65","author":"N Nimana","year":"2016","unstructured":"Nimana, N., Farajzadeh, A.P., Petrot, N.: Adaptive subgradient method for the split quasi-convex feasibility problems. Optimization 65(10), 1885\u20131898 (2016)","journal-title":"Optimization"},{"key":"818_CR38","first-page":"593","volume":"8","author":"BT Polyak","year":"1967","unstructured":"Polyak, B.T.: A general method for solving extremum problems. Sov. Math. Dokl. 8, 593\u2013597 (1967)","journal-title":"Sov. Math. Dokl."},{"issue":"4","key":"818_CR39","doi-asserted-by":"crossref","first-page":"798","DOI":"10.1109\/JSAC.2005.843546","volume":"23","author":"MG Rabbat","year":"2005","unstructured":"Rabbat, M.G., Nowak, R.D.: Quantized incremental algorithms for distributed optimization. IEEE J. Sel. Areas Commun. 23(4), 798\u2013808 (2005)","journal-title":"IEEE J. Sel. Areas Commun."},{"issue":"2","key":"818_CR40","doi-asserted-by":"crossref","first-page":"691","DOI":"10.1137\/080726380","volume":"20","author":"SS Ram","year":"2009","unstructured":"Ram, S.S., Nedi\u0107, A., Veeravalli, V.V.: Incremental stochastic subgradient algorithms for convex optimization. SIAM J. Optim. 20(2), 691\u2013717 (2009)","journal-title":"SIAM J. Optim."},{"key":"818_CR41","doi-asserted-by":"crossref","first-page":"219","DOI":"10.1080\/1055678031000105242","volume":"18","author":"S Schaible","year":"2003","unstructured":"Schaible, S., Shi, J.: Fractional programming: the sum-of-ratios case. Optim. Methods Softw. 18, 219\u2013229 (2003)","journal-title":"Optim. Methods Softw."},{"issue":"10","key":"818_CR42","doi-asserted-by":"crossref","first-page":"3759","DOI":"10.1109\/TSP.2009.2024901","volume":"57","author":"Q Shi","year":"2009","unstructured":"Shi, Q., He, C., Jiang, L.: Normalized incremental subgradient algorithm and its application. IEEE Trans. Signal Process. 57(10), 3759\u20133774 (2009)","journal-title":"IEEE Trans. Signal Process."},{"key":"818_CR43","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-82118-9","volume-title":"Minimization Methods for Non-differentiable Functions","author":"NZ Shor","year":"1985","unstructured":"Shor, N.Z.: Minimization Methods for Non-differentiable Functions. Springer, New York (1985)"},{"key":"818_CR44","doi-asserted-by":"crossref","DOI":"10.1007\/978-94-009-0035-6","volume-title":"Fractional Programming","author":"IM Stancu-Minasian","year":"1997","unstructured":"Stancu-Minasian, I.M.: Fractional Programming. Kluwer Academic Publishers, Dordrecht (1997)"},{"key":"818_CR45","unstructured":"Tan, C., Ma, S., Dai, Y.-H., Qian, Y.: Barzilai\u2013Borwein step size for stochastic gradient descent. In: NIPS (2016)"},{"issue":"4","key":"818_CR46","doi-asserted-by":"crossref","first-page":"2057","DOI":"10.1137\/140961791","volume":"24","author":"L Xiao","year":"2014","unstructured":"Xiao, L., Zhang, T.: A proximal stochastic gradient method with progressive variance reduction. SIAM J. Optim. 24(4), 2057\u20132075 (2014)","journal-title":"SIAM J. Optim."},{"key":"818_CR47","doi-asserted-by":"publisher","DOI":"10.1080\/02331934.2018.1455831","author":"CKW Yu","year":"2019","unstructured":"Yu, C.K.W., Hu, Y., Yang, X., Choy, S.K.: Abstract convergence theorem for quasi-convex optimization problems with applications. Optimization (2019). \nhttps:\/\/doi.org\/10.1080\/02331934.2018.1455831","journal-title":"Optimization"}],"container-title":["Journal of Global Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10898-019-00818-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10898-019-00818-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10898-019-00818-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,8,10]],"date-time":"2020-08-10T23:19:06Z","timestamp":1597101546000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10898-019-00818-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,8,12]]},"references-count":47,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2019,12]]}},"alternative-id":["818"],"URL":"https:\/\/doi.org\/10.1007\/s10898-019-00818-6","relation":{},"ISSN":["0925-5001","1573-2916"],"issn-type":[{"value":"0925-5001","type":"print"},{"value":"1573-2916","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019,8,12]]},"assertion":[{"value":"14 September 2018","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"2 August 2019","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"12 August 2019","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}