{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T07:21:06Z","timestamp":1740122466172,"version":"3.37.3"},"reference-count":64,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2021,11,17]],"date-time":"2021-11-17T00:00:00Z","timestamp":1637107200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2021,11,17]],"date-time":"2021-11-17T00:00:00Z","timestamp":1637107200000},"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":["J Glob Optim"],"published-print":{"date-parts":[[2022,6]]},"DOI":"10.1007\/s10898-021-01110-2","type":"journal-article","created":{"date-parts":[[2021,11,17]],"date-time":"2021-11-17T02:02:33Z","timestamp":1637114553000},"page":"249-271","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Interior quasi-subgradient method with non-Euclidean distances for constrained quasi-convex optimization problems in hilbert spaces"],"prefix":"10.1007","volume":"83","author":[{"given":"Regina S.","family":"Burachik","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yaohua","family":"Hu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5583-4032","authenticated-orcid":false,"given":"Xiaoqi","family":"Yang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2021,11,17]]},"reference":[{"key":"1110_CR1","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1007\/BF01584842","volume":"81","author":"YI Alber","year":"1998","unstructured":"Alber, Y.I., Iusem, A.N., Solodov, M.V.: On the projected subgradient method for nonsmooth convex optimization in a Hilbert space. Math. Program. 81, 23\u201335 (1998)","journal-title":"Math. Program."},{"key":"1110_CR2","doi-asserted-by":"publisher","first-page":"1643","DOI":"10.1007\/s11590-020-01561-8","volume":"14","author":"A Agrawal","year":"2020","unstructured":"Agrawal, A., Boyd, S.: Disciplined quasiconvex programming. Optim. Lett. 14, 1643\u20131657 (2020)","journal-title":"Optim. Lett."},{"issue":"1","key":"1110_CR3","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1287\/moor.1030.0062","volume":"29","author":"A Auslender","year":"2004","unstructured":"Auslender, A., Teboulle, M.: Interior gradient and $$\\epsilon $$-subgradient descent methods for constrained convex minimization. Math. Oper. Res. 29(1), 1\u201326 (2004)","journal-title":"Math. Oper. Res."},{"key":"1110_CR4","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1007\/s10107-004-0568-x","volume":"104","author":"A Auslender","year":"2005","unstructured":"Auslender, A., Teboulle, M.: Interior projection-like methods for monotone variational inequalities. Math. Program. 104, 39\u201368 (2005)","journal-title":"Math. Program."},{"issue":"3","key":"1110_CR5","doi-asserted-by":"publisher","first-page":"697","DOI":"10.1137\/S1052623403427823","volume":"16","author":"A Auslender","year":"2006","unstructured":"Auslender, A., Teboulle, M.: Interior gradient and proximal methods for convex and conic optimization. SIAM J. Optim. 16(3), 697\u2013725 (2006)","journal-title":"SIAM J. Optim."},{"key":"1110_CR6","doi-asserted-by":"publisher","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."},{"issue":"3","key":"1110_CR7","doi-asserted-by":"publisher","first-page":"645","DOI":"10.1287\/moor.24.3.645","volume":"24","author":"A Auslender","year":"1999","unstructured":"Auslender, A., Teboulle, M., Ben-Tiba, S.: Interior proximal and multiplier methods based on second order homogeneous kernels. Math. Oper. Res. 24(3), 645\u2013668 (1999)","journal-title":"Math. Oper. Res."},{"key":"1110_CR8","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1023\/A:1008607511915","volume":"12","author":"A Auslender","year":"1999","unstructured":"Auslender, A., Teboulle, M., Ben-Tiba, S.: A logarithmic-quadratic proximal method for variational inequalities. Comput. Optim. Appl. 12, 31\u201340 (1999)","journal-title":"Comput. Optim. Appl."},{"issue":"2","key":"1110_CR9","doi-asserted-by":"publisher","first-page":"358","DOI":"10.1137\/040606958","volume":"16","author":"D Aussel","year":"2005","unstructured":"Aussel, D., Hadjisavvas, N.: Adjusted sublevel sets, normal operator, and quasi-convex programming. SIAM J. Optim. 16(2), 358\u2013367 (2005)","journal-title":"SIAM J. Optim."},{"issue":"4","key":"1110_CR10","doi-asserted-by":"publisher","first-page":"669","DOI":"10.1007\/s11228-015-0349-0","volume":"23","author":"D Aussel","year":"2015","unstructured":"Aussel, D., Pi\u0161t\u011bk, M.: Limiting normal operator in quasiconvex analysis. Set-Valued Var. Anal. 23(4), 669\u2013685 (2015)","journal-title":"Set-Valued Var. Anal."},{"key":"1110_CR11","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4684-7600-2","volume-title":"Gener. Concavity","author":"M Avriel","year":"1988","unstructured":"Avriel, M., Diewert, W.E., Schaible, S., Zang, I.: Gener. Concavity. Plenum Press, New York (1988)"},{"issue":"3","key":"1110_CR12","doi-asserted-by":"publisher","first-page":"551","DOI":"10.1287\/moor.1070.0253","volume":"32","author":"K Barty","year":"2007","unstructured":"Barty, K., Roy, J.-S., Strugarek, C.: Hilbert-valued perturbed subgradient algorithms. Math. Oper. Res. 32(3), 551\u2013562 (2007)","journal-title":"Math. Oper. Res."},{"issue":"2","key":"1110_CR13","doi-asserted-by":"publisher","first-page":"330","DOI":"10.1287\/moor.2016.0817","volume":"42","author":"HH Bauschke","year":"2017","unstructured":"Bauschke, H.H., Bolte, J., Teboulle, M.: A descent lemma beyond Lipschitz gradient continuity: First-order methods revisited and applications. Math. Oper. Res. 42(2), 330\u2013348 (2017)","journal-title":"Math. Oper. Res."},{"key":"1110_CR14","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4419-9467-7","volume-title":"Convex analysis monotone operator theory in hilbert spaces","author":"HH Bauschke","year":"2011","unstructured":"Bauschke, H.H., Combettes, P.L.: Convex analysis monotone operator theory in hilbert spaces. Springer, New York (2011)"},{"issue":"3","key":"1110_CR15","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1016\/S0167-6377(02)00231-6","volume":"31","author":"A Beck","year":"2003","unstructured":"Beck, A., Teboulle, M.: Mirror descent and nonlinear projected subgradient methods for convex optimization. Oper. Res. Lett. 31(3), 167\u2013175 (2003)","journal-title":"Oper. Res. Lett."},{"key":"1110_CR16","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1137\/S1052623499354564","volume":"12","author":"A Ben-tal","year":"2001","unstructured":"Ben-tal, A., Margalit, T., Nemirovski, A.: The ordered subsets mirror descent optimization method with applications to tomography. SIAM J. Optim. 12, 79\u2013108 (2001)","journal-title":"SIAM J. Optim."},{"key":"1110_CR17","volume-title":"Convex optimization ang algorithms","author":"DP Bertsekas","year":"2015","unstructured":"Bertsekas, D.P.: Convex optimization ang algorithms. Athena Scientific, Massachusetts (2015)"},{"issue":"2","key":"1110_CR18","doi-asserted-by":"publisher","first-page":"471","DOI":"10.1007\/s10107-016-1091-6","volume":"165","author":"J Bolte","year":"2017","unstructured":"Bolte, J., Nguyen, T.P., Peypouquet, J., Suter, B.W.: From error bounds to the complexity of first-order descent methods for convex functions. Math. Program. 165(2), 471\u2013507 (2017)","journal-title":"Math. Program."},{"issue":"3","key":"1110_CR19","doi-asserted-by":"publisher","first-page":"200","DOI":"10.1016\/0041-5553(67)90040-7","volume":"7","author":"LM Bregman","year":"1967","unstructured":"Bregman, L.M.: The relaxation method of finding the common point of convex sets and its application to the solution of problems in convex programming. USSR Comput. Math. Math. Phys. 7(3), 200\u2013217 (1967)","journal-title":"USSR Comput. Math. Math. Phys."},{"issue":"1","key":"1110_CR20","doi-asserted-by":"publisher","first-page":"217","DOI":"10.1007\/s10957-012-0002-0","volume":"154","author":"AS Brito","year":"2012","unstructured":"Brito, A.S., da Cruz Neto, J.X., Lopes, J.O., Oliveira, P.R.: Interior proximal algorithm for quasiconvex programming problems and variational inequalities with linear constraints. J. Optim. Theory Appl. 154(1), 217\u2013234 (2012)","journal-title":"J. Optim. Theory Appl."},{"key":"1110_CR21","unstructured":"Burachik, R.\u00a0S.: Generalized Proximal Point Method for the Variational Inequality Problem. PhD Thesis, (1995)"},{"issue":"5","key":"1110_CR22","doi-asserted-by":"publisher","first-page":"2653","DOI":"10.1137\/080733437","volume":"20","author":"RS Burachik","year":"2010","unstructured":"Burachik, R.S., Dutta, J.: Inexact proximal point methods for variational inequality problems. SIAM J. Optim. 20(5), 2653\u20132678 (2010)","journal-title":"SIAM J. Optim."},{"issue":"1","key":"1110_CR23","doi-asserted-by":"publisher","first-page":"197","DOI":"10.1137\/S1052623495286302","volume":"8","author":"RS Burachik","year":"1998","unstructured":"Burachik, R.S., Iusem, A.N.: A generalized proximal point algorithm for the variational inequality problem in a Hilbert space. SIAM J. Optim. 8(1), 197\u2013216 (1998)","journal-title":"SIAM J. Optim."},{"issue":"5","key":"1110_CR24","doi-asserted-by":"publisher","first-page":"1633","DOI":"10.1137\/S0363012998339745","volume":"39","author":"RS Burachik","year":"2001","unstructured":"Burachik, R.S., Scheimberg, S.: A proximal point method for the variational inequality problem in Banach spaces. SIAM J. Control Optim. 39(5), 1633\u20131649 (2001)","journal-title":"SIAM J. Control Optim."},{"issue":"1","key":"1110_CR25","doi-asserted-by":"publisher","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."},{"issue":"3","key":"1110_CR26","doi-asserted-by":"publisher","first-page":"538","DOI":"10.1137\/0803026","volume":"3","author":"G Chen","year":"1993","unstructured":"Chen, G., Teboulle, M.: Convergence analysis of a proximal-like minimization algorithm using bregman functions. SIAM J. Optim. 3(3), 538\u2013543 (1993)","journal-title":"SIAM J. Optim."},{"key":"1110_CR27","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4613-3341-8","volume-title":"Generalized convexity. Generalized monotonicity","author":"J-P Crouzeix","year":"1998","unstructured":"Crouzeix, J.-P., Martinez-Legaz, J.-E., Volle, M.: Generalized convexity. Generalized monotonicity. Kluwer Academic Publishers, Dordrecht (1998)"},{"issue":"5\u20136","key":"1110_CR28","doi-asserted-by":"publisher","first-page":"777","DOI":"10.1080\/02331930902884273","volume":"59","author":"FGM Cunha","year":"2010","unstructured":"Cunha, F.G.M., da Cruz Neto, J.X., Oliveira, P.R.: A proximal point algorithm with a $$\\phi $$-divergence for quasiconvex programming. Optimization 59(5\u20136), 777\u2013792 (2010)","journal-title":"Optimization"},{"key":"1110_CR29","doi-asserted-by":"publisher","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":"1110_CR30","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 Rech. Opertionnelle 15, 437\u2013448 (1973)","journal-title":"Cahiers Centre \u00c9tudes Rech. Opertionnelle"},{"key":"1110_CR31","doi-asserted-by":"publisher","DOI":"10.1007\/b101428","volume-title":"Handbook of generalized convexity and generalized monotonicity","author":"N Hadjisavvas","year":"2005","unstructured":"Hadjisavvas, N., Koml\u00f3si, S., Schaible, S.: Handbook of generalized convexity and generalized monotonicity. Springer-Verlag, New York (2005)"},{"issue":"2","key":"1110_CR32","doi-asserted-by":"publisher","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":"1","key":"1110_CR33","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1007\/s10589-020-00194-y","volume":"77","author":"Y Hu","year":"2020","unstructured":"Hu, Y., Li, J., Yu, C.K.W.: Convergence rates of subgradient methods for quasi-convex optimization problems. Comput. Optim. Appl. 77(1), 183\u2013212 (2020)","journal-title":"Comput. Optim. Appl."},{"issue":"2","key":"1110_CR34","doi-asserted-by":"publisher","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":"1110_CR35","doi-asserted-by":"publisher","first-page":"1003","DOI":"10.1007\/s10898-019-00818-6","volume":"75","author":"Y Hu","year":"2019","unstructured":"Hu, Y., Yu, C.K.W., Yang, X.: Incremental quasi-subgradient methods for minimizing the sum of quasi-convex functions. J. Global Optim. 75(4), 1003\u20131028 (2019)","journal-title":"J. Global Optim."},{"issue":"10","key":"1110_CR36","doi-asserted-by":"publisher","first-page":"1834","DOI":"10.1109\/TPAMI.2007.1083","volume":"29","author":"Q Ke","year":"2007","unstructured":"Ke, Q., Kanade, T.: Quasiconvex optimization for robust geometric reconstruction. IEEE Trans. Pattern Anal. Mach. Intell. 29(10), 1834\u20131847 (2007)","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"key":"1110_CR37","doi-asserted-by":"publisher","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":"1110_CR38","doi-asserted-by":"publisher","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":"1110_CR39","doi-asserted-by":"publisher","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":"1110_CR40","doi-asserted-by":"publisher","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."},{"issue":"8","key":"1110_CR41","doi-asserted-by":"publisher","first-page":"1301","DOI":"10.1080\/02331934.2016.1277998","volume":"66","author":"J L\u00f3pez","year":"2017","unstructured":"L\u00f3pez, J., Papa Quiroz, E.A.: Construction of proximal distances over symmetric cones. Optimization 66(8), 1301\u20131321 (2017)","journal-title":"Optimization"},{"issue":"1","key":"1110_CR42","doi-asserted-by":"publisher","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":"1110_CR43","volume-title":"Problem complexity and method efficiency in optimization","author":"AS Nemirovsky","year":"1983","unstructured":"Nemirovsky, A.S., Yudin, D.B.: Problem complexity and method efficiency in optimization. Wiley, New York (1983)"},{"key":"1110_CR44","doi-asserted-by":"publisher","first-page":"555","DOI":"10.1007\/s10898-007-9156-y","volume":"39","author":"S Pan","year":"2007","unstructured":"Pan, S., Chen, J.-S.: Entropy-like proximal algorithms based on a second-order homogeneous distance function for quasi-convex programming. J. Global Optim. 39, 555\u2013575 (2007)","journal-title":"J. Global Optim."},{"key":"1110_CR45","doi-asserted-by":"crossref","unstructured":"Papa Quiroz, E.A., L\u00f3pez, J., Borda, D., Collantes, F.: A proximal method for multiobjective quasiconvex minimization on the nonnegative orthant and its application to demand theory in microeconomy. Presented at the (2020)","DOI":"10.1145\/3402597.3402611"},{"key":"1110_CR46","doi-asserted-by":"crossref","unstructured":"Papa\u00a0Quiroz, E.\u00a0A., L\u00f3pez Luis, J., and Cano Lengua, M. A.: A proximal multiplier method for convex separable symmetric cone optimization. In Proceeding of 5th International Conference on Multimedia Systems and Signal Processing, ACM International Conference Proceeding Series, 92\u201397, 2020","DOI":"10.1145\/3404716.3404734"},{"issue":"1","key":"1110_CR47","doi-asserted-by":"publisher","first-page":"26","DOI":"10.1016\/j.ejor.2011.07.019","volume":"216","author":"EA Papa Quiroz","year":"2012","unstructured":"Papa Quiroz, E.A., Oliveira, P.R.: An extension of proximal methods for quasiconvex minimization on the nonnegative orthant. Eur. J. Oper. Res. 216(1), 26\u201332 (2012)","journal-title":"Eur. J. Oper. Res."},{"issue":"1","key":"1110_CR48","doi-asserted-by":"publisher","first-page":"159","DOI":"10.1051\/ro\/2017078","volume":"52","author":"EA Papa Quiroz","year":"2018","unstructured":"Papa Quiroz, E.A., Ramirez, L.M., Oliveira, P.R.: An inexact algorithm with proximal distances for variational inequalities. RAIRO Oper. Res. 52(1), 159\u2013176 (2018)","journal-title":"RAIRO Oper. Res."},{"issue":"3","key":"1110_CR49","doi-asserted-by":"publisher","first-page":"721","DOI":"10.1016\/j.ejor.2015.05.041","volume":"246","author":"EA Papa Quiroz","year":"2015","unstructured":"Papa Quiroz, E.A., Ramirez, L.M., Oliveira, P.R.: An inexact proximal method for quasiconvex minimization. Eur. J. Oper. Res. 246(3), 721\u2013729 (2015)","journal-title":"Eur. J. Oper. Res."},{"key":"1110_CR50","doi-asserted-by":"publisher","first-page":"S873","DOI":"10.1051\/ro\/2020018","volume":"55","author":"EA Papa Quiroz","year":"2021","unstructured":"Papa Quiroz, E.A., Sarmiento, O., Oliveira, P.R.: An inexact proximal decomposition method for variational inequalities with separable structure. RAIRO Oper. Res. 55, S873\u2013S884 (2021)","journal-title":"RAIRO Oper. Res."},{"key":"1110_CR51","doi-asserted-by":"crossref","unstructured":"Penot, J.-P.: Are generalized derivatives useful for generalized convex functions? In M.\u00a0V. J.-P.\u00a0Crouzeix, J.E. Martinez-Legaz, editor, Generalized Convexity, Generalized Monotonicity: Recent Results, pages 3\u201359. Kluwer Academic Publishers, (1998)","DOI":"10.1007\/978-1-4613-3341-8_1"},{"key":"1110_CR52","first-page":"593","volume":"8","author":"BT Polyak","year":"1967","unstructured":"Polyak, B.T.: A general method for solving extremum problems. Soviet Math. Doklady 8, 593\u2013597 (1967)","journal-title":"Soviet Math. Doklady"},{"key":"1110_CR53","volume-title":"Introduction to optimization","author":"BT Polyak","year":"1987","unstructured":"Polyak, B.T.: Introduction to optimization. Optimization Software, New York (1987)"},{"key":"1110_CR54","doi-asserted-by":"publisher","first-page":"11","DOI":"10.1007\/s11856-015-1170-z","volume":"207","author":"PJ Rabier","year":"2015","unstructured":"Rabier, P.J.: Differentiability of quasiconvex functions on separable Banach spaces. Israel J. Math. 207, 11\u201351 (2015)","journal-title":"Israel J. Math."},{"issue":"2","key":"1110_CR55","doi-asserted-by":"publisher","first-page":"501","DOI":"10.1080\/02331934.2015.1062009","volume":"65","author":"O Sarmiento","year":"2016","unstructured":"Sarmiento, O., Papa Quiroz, E.A., Oliveira, P.R.: A proximal multiplier method for separable convex minimization. Optimization 65(2), 501\u2013537 (2016)","journal-title":"Optimization"},{"issue":"2","key":"1110_CR56","doi-asserted-by":"publisher","first-page":"251","DOI":"10.1080\/02331934.2016.1261138","volume":"66","author":"O Sarmiento","year":"2017","unstructured":"Sarmiento, O., Papa Quiroz, E.A., Oliveira, P.R.: Convergence rate of a proximal multiplier algorithm for separable convex minimization. Optimization 66(2), 251\u2013270 (2017)","journal-title":"Optimization"},{"key":"1110_CR57","doi-asserted-by":"publisher","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-Verlag, New York (1985)"},{"key":"1110_CR58","doi-asserted-by":"publisher","first-page":"663","DOI":"10.1023\/A:1022680114518","volume":"98","author":"MV Solodov","year":"1998","unstructured":"Solodov, M.V., Zavriev, S.K.: Error stability properties of generalized gradient-type algorithms. J. Optim. Theory Appl. 98, 663\u2013680 (1998)","journal-title":"J. Optim. Theory Appl."},{"key":"1110_CR59","doi-asserted-by":"crossref","unstructured":"Souza, S., d. S., Oliveira, P. R., da Cruz Neto, J. X., and Soubeyran, A.: A proximal method with separable Bregman distances for quasiconvex minimization over the nonnegative orthant. Eur. J. Oper. Res. 201(2), 365\u2013376 (2010)","DOI":"10.1016\/j.ejor.2009.03.045"},{"key":"1110_CR60","doi-asserted-by":"publisher","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)"},{"issue":"4","key":"1110_CR61","doi-asserted-by":"publisher","first-page":"1069","DOI":"10.1137\/S1052623495292130","volume":"7","author":"M Teboulle","year":"1997","unstructured":"Teboulle, M.: Convergence of proximal-like algorithms. SIAM J. Optim. 7(4), 1069\u20131083 (1997)","journal-title":"SIAM J. Optim."},{"issue":"7","key":"1110_CR62","doi-asserted-by":"publisher","first-page":"1289","DOI":"10.1080\/02331934.2018.1455831","volume":"68","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 68(7), 1289\u20131304 (2019)","journal-title":"Optimization"},{"issue":"2","key":"1110_CR63","doi-asserted-by":"publisher","first-page":"689","DOI":"10.1007\/s10107-016-1100-9","volume":"165","author":"Z Zhou","year":"2017","unstructured":"Zhou, Z., So, A.M.-C.: A unified approach to error bounds for structured convex optimization problems. Math. Program. 165(2), 689\u2013728 (2017)","journal-title":"Math. Program."},{"key":"1110_CR64","doi-asserted-by":"publisher","DOI":"10.1142\/5021","volume-title":"Convex analysis in general vector spaces","author":"C Z\u0103linescu","year":"2002","unstructured":"Z\u0103linescu, C.: Convex analysis in general vector spaces. World Scientific, Singapore (2002)"}],"container-title":["Journal of Global Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10898-021-01110-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10898-021-01110-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10898-021-01110-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,9]],"date-time":"2023-02-09T08:26:14Z","timestamp":1675931174000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10898-021-01110-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,11,17]]},"references-count":64,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2022,6]]}},"alternative-id":["1110"],"URL":"https:\/\/doi.org\/10.1007\/s10898-021-01110-2","relation":{},"ISSN":["0925-5001","1573-2916"],"issn-type":[{"type":"print","value":"0925-5001"},{"type":"electronic","value":"1573-2916"}],"subject":[],"published":{"date-parts":[[2021,11,17]]},"assertion":[{"value":"20 February 2021","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"29 October 2021","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"17 November 2021","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}