{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,29]],"date-time":"2026-05-29T19:59:41Z","timestamp":1780084781694,"version":"3.54.0"},"reference-count":56,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2017,9,14]],"date-time":"2017-09-14T00:00:00Z","timestamp":1505347200000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Glob Optim"],"published-print":{"date-parts":[[2018,3]]},"DOI":"10.1007\/s10898-017-0565-2","type":"journal-article","created":{"date-parts":[[2017,9,14]],"date-time":"2017-09-14T08:55:11Z","timestamp":1505379311000},"page":"517-549","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":29,"title":["A proximal bundle method for constrained nonsmooth nonconvex optimization with inexact information"],"prefix":"10.1007","volume":"70","author":[{"given":"Jian","family":"Lv","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Li-Ping","family":"Pang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Fan-Yun","family":"Meng","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2017,9,14]]},"reference":[{"key":"565_CR1","doi-asserted-by":"crossref","first-page":"733","DOI":"10.1137\/120903099","volume":"24","author":"W Ackooij","year":"2014","unstructured":"Ackooij, W., Sagastiz\u00e1bal, C.: Constrained bundle methods for upper inexact oracles with application to joint chance constrained energy problems. SIAM J. Optim. 24, 733\u2013765 (2014)","journal-title":"SIAM J. Optim."},{"key":"565_CR2","first-page":"641","volume":"16","author":"P Apkarian","year":"2009","unstructured":"Apkarian, P., Noll, D., Prot, O.: A proximity control algorithm to minimize nonsmooth and nonconvex semi-infinite maximum eigenvalue functions. J. Convex Anal. 16, 641\u2013666 (2009)","journal-title":"J. Convex Anal."},{"key":"565_CR3","doi-asserted-by":"crossref","DOI":"10.1007\/978-0-387-31256-9","volume-title":"Convex Analysis and Nonlinear Optimization: Theory and Examples","author":"JM Borwein","year":"2006","unstructured":"Borwein, J.M., Lewis, A.S.: Convex Analysis and Nonlinear Optimization: Theory and Examples, 2nd edn. Springer, Berlin (2006)","edition":"2"},{"key":"565_CR4","doi-asserted-by":"crossref","first-page":"474","DOI":"10.1137\/090780201","volume":"22","author":"FE Curtis","year":"2012","unstructured":"Curtis, F.E., Overton, M.L.: A sequential quadratic programming algorithm for nonconvex, nonsmooth constrained optimization. SIAM J. Optim. 22, 474\u2013500 (2012)","journal-title":"SIAM J. Optim."},{"key":"565_CR5","doi-asserted-by":"crossref","first-page":"357","DOI":"10.1137\/080718814","volume":"20","author":"G d\u2019Antonio","year":"2009","unstructured":"d\u2019Antonio, G., Frangioni, A.: Convergence analysis of deflected conditional approximate subgradient methods. SIAM. J. Optim. 20, 357\u2013386 (2009)","journal-title":"SIAM. J. Optim."},{"key":"565_CR6","doi-asserted-by":"crossref","first-page":"517","DOI":"10.1137\/100808289","volume":"21","author":"W Oliveira de","year":"2011","unstructured":"de Oliveira, W., Sagastiz\u00e1bal, C., Scheimberg, S.: Inexact bundle methods for two-stage stochastic programming. SIAM J. Optim. 21, 517\u2013544 (2011)","journal-title":"SIAM J. Optim."},{"key":"565_CR7","doi-asserted-by":"crossref","first-page":"241","DOI":"10.1007\/s10107-014-0809-6","volume":"148","author":"W Oliveira de","year":"2014","unstructured":"de Oliveira, W., Sagastiz\u00e1bal, C., Lemar\u00e9chal, C.: Convex proximal bundle methods in depth: a unified analysis for inexact oracles. Math. Program. 148, 241\u2013277 (2014)","journal-title":"Math. Program."},{"key":"565_CR8","doi-asserted-by":"crossref","first-page":"292","DOI":"10.1016\/j.jmaa.2003.11.004","volume":"291","author":"A Daniilidis","year":"2004","unstructured":"Daniilidis, A., Georgiev, P.: Approximate convexity and submonotonicity. J. Math. Anal. Appl. 291, 292\u2013301 (2004)","journal-title":"J. Math. Anal. Appl."},{"key":"565_CR9","doi-asserted-by":"crossref","first-page":"305","DOI":"10.1007\/s10589-009-9288-8","volume":"46","author":"G Emiel","year":"2010","unstructured":"Emiel, G., Sagastiz\u00e1bal, C.: Incremental-like bundle methods with application to energy planning. Comput. Optim. Appl. 46, 305\u2013332 (2010)","journal-title":"Comput. Optim. Appl."},{"key":"565_CR10","doi-asserted-by":"crossref","first-page":"313","DOI":"10.1007\/s10287-006-0026-8","volume":"4","author":"C F\u00e1bi\u00e1n","year":"2007","unstructured":"F\u00e1bi\u00e1n, C., Sz\u00f6ke, Z.: Solving two-stage stochastic programming problems with level decomposition. Comput. Manag. Sci. 4, 313\u2013353 (2007)","journal-title":"Comput. Manag. Sci."},{"key":"565_CR11","unstructured":"Ferrier, C.: Bornes Duales de Probl\u00e9mes d\u2019Optimisation Polynomiaux, Ph.D. thesis. Laboratoire Approximation et Optimisation, Universit\u00e9 Paul Sabatier, Toulouse (1997)"},{"key":"565_CR12","doi-asserted-by":"crossref","first-page":"139","DOI":"10.1051\/cocv:2000104","volume":"5","author":"C Ferrier","year":"2000","unstructured":"Ferrier, C.: Computation of the distance to semi-algebraic sets. ESAIM Control Optim. Calc. Var. 5, 139\u2013156 (2000)","journal-title":"ESAIM Control Optim. Calc. Var."},{"key":"565_CR13","doi-asserted-by":"crossref","first-page":"1187","DOI":"10.1137\/060657741","volume":"18","author":"CA Floudas","year":"2007","unstructured":"Floudas, C.A., Stein, O.: The adaptive convexification algorithm: a feasible point method for semi-infinite programming. SIAM J. Optim. 18, 1187\u20131208 (2007)","journal-title":"SIAM J. Optim."},{"key":"565_CR14","doi-asserted-by":"crossref","first-page":"89","DOI":"10.1080\/10556780410001648112","volume":"19","author":"A Fuduli","year":"2004","unstructured":"Fuduli, A., Gaudioso, M., Giallombardo, G.: A DC piecewise affine model and a bundling technique in nonconvex nonsmooth optimization. Optim. Methods Softw. 19, 89\u2013102 (2004)","journal-title":"Optim. Methods Softw."},{"key":"565_CR15","doi-asserted-by":"crossref","first-page":"743","DOI":"10.1137\/S1052623402411459","volume":"14","author":"A Fuduli","year":"2004","unstructured":"Fuduli, A., Gaudioso, M., Giallombardo, G.: Minimizing nonconvex nonsmooth functions via cutting planes and proximity control. SIAM J. Optim. 14, 743\u2013756 (2004)","journal-title":"SIAM J. Optim."},{"key":"565_CR16","volume-title":"Linear Semi-Infinite Optimization","author":"MA Goberna","year":"1998","unstructured":"Goberna, M.A., L\u00f3pez, M.A.: Linear Semi-Infinite Optimization. Wiley, New-York (1998)"},{"key":"565_CR17","doi-asserted-by":"crossref","first-page":"221","DOI":"10.1007\/s10107-007-0124-6","volume":"116","author":"W Hare","year":"2009","unstructured":"Hare, W., Sagastiz\u00e1bal, C.: Computing proximal points of nonconvex functions. Math. Program. 116, 221\u2013258 (2009)","journal-title":"Math. Program."},{"key":"565_CR18","doi-asserted-by":"crossref","first-page":"2442","DOI":"10.1137\/090754595","volume":"20","author":"W Hare","year":"2010","unstructured":"Hare, W., Sagastiz\u00e1bal, C.: A redistributed proximal bundle method for nonconvex optimization. SIAM J. Optim. 20, 2442\u20132473 (2010)","journal-title":"SIAM J. Optim."},{"key":"565_CR19","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/s10589-015-9762-4","volume":"63","author":"W Hare","year":"2016","unstructured":"Hare, W., Sagastiz\u00e1bal, C., Solodov, M.: A proximal bundle method for nonconvex functions with inexact oracles. Comput. Optim. Appl. 63, 1\u201328 (2016)","journal-title":"Comput. Optim. Appl."},{"key":"565_CR20","doi-asserted-by":"crossref","first-page":"245","DOI":"10.1023\/A:1011259017643","volume":"20","author":"M Hinterm\u00fcller","year":"2001","unstructured":"Hinterm\u00fcller, M.: A proximal bundle method based on approximate subgradients. Comput. Optim. Appl. 20, 245\u2013266 (2001)","journal-title":"Comput. Optim. Appl."},{"key":"565_CR21","unstructured":"Hiriart-Urruty, J.-B., Lemar\u00e9chal, C.: Convex Analysis and Minimization Algorithms. II, Volume 306 of Grundlehren der Mathematischen Wissenschaften [Fundamental Principles of Mathematical Sciences], Springer, Berlin (1993). Advanced theory and bundle methods"},{"key":"565_CR22","first-page":"145","volume":"83","author":"HT Jongen","year":"1998","unstructured":"Jongen, H.T., R\u00fcckmann, J.-J., Stein, O.: Generalized semi-infinite optimization: a first order optimality condition and examples. Math. Program. 83, 145\u2013158 (1998)","journal-title":"Math. Program."},{"key":"565_CR23","doi-asserted-by":"crossref","first-page":"297","DOI":"10.1007\/s10107-007-0123-7","volume":"116","author":"E Karas","year":"2009","unstructured":"Karas, E., Ribeiro, A., Sagastiz\u0227bal, C., Solodov, M.: A bundle-filter method for nonsmooth convex constrained optimization. Math. Program. 116, 297\u2013320 (2009)","journal-title":"Math. Program."},{"key":"565_CR24","doi-asserted-by":"crossref","unstructured":"Kiwiel, K.C.: Methods of Descent for Nondifferentiable Optimization, Lecture Notes in Mathematics. Springer, Berlin (1985)","DOI":"10.1007\/BFb0074500"},{"key":"565_CR25","doi-asserted-by":"crossref","first-page":"171","DOI":"10.1090\/S0025-5718-1985-0790650-5","volume":"45","author":"KC Kiwiel","year":"1985","unstructured":"Kiwiel, K.C.: An algorithm for nonsmooth convex minimization with errors. Math. Comput. 45, 171\u2013180 (1985)","journal-title":"Math. Comput."},{"key":"565_CR26","doi-asserted-by":"crossref","first-page":"185","DOI":"10.1287\/moor.10.2.185","volume":"10","author":"KC Kiwiel","year":"1985","unstructured":"Kiwiel, K.C.: A linearization algorithm for nonsmooth minimization. Math. Oper. Res. 10, 185\u2013194 (1985)","journal-title":"Math. Oper. Res."},{"key":"565_CR27","doi-asserted-by":"crossref","first-page":"111","DOI":"10.1093\/imanum\/5.1.111","volume":"5","author":"KC Kiwiel","year":"1985","unstructured":"Kiwiel, K.C.: An exact penalty function algorithm for nonsmooth convex constrained minimization problems. IMA J. Numer. Anal. 5, 111\u2013119 (1985)","journal-title":"IMA J. Numer. Anal."},{"key":"565_CR28","doi-asserted-by":"crossref","first-page":"285","DOI":"10.1007\/BF01582892","volume":"52","author":"KC Kiwiel","year":"1991","unstructured":"Kiwiel, K.C.: Exact penalty functions in proximal bundle methods for constrained convex nondifferentiable minimization. Math. Program. 52, 285\u2013302 (1991)","journal-title":"Math. Program."},{"key":"565_CR29","doi-asserted-by":"crossref","first-page":"227","DOI":"10.1137\/0806013","volume":"6","author":"KC Kiwiel","year":"1996","unstructured":"Kiwiel, K.C.: Restricted step and Levenberg\u2013Marquardt techniques in proximal bundle methods for nonconvex nondifferentiable optimization. SIAM J. Optim. 6, 227\u2013249 (1996)","journal-title":"SIAM J. Optim."},{"key":"565_CR30","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, 807\u2013840 (2004)","journal-title":"SIAM. J. Optim."},{"key":"565_CR31","doi-asserted-by":"crossref","first-page":"1007","DOI":"10.1137\/040603929","volume":"16","author":"KC Kiwiel","year":"2006","unstructured":"Kiwiel, K.C.: A proximal bundle method with approximate subgradient linearizations. SIAM. J. Optim. 16, 1007\u20131023 (2006)","journal-title":"SIAM. J. Optim."},{"key":"565_CR32","doi-asserted-by":"crossref","first-page":"1467","DOI":"10.1137\/060668559","volume":"18","author":"KC Kiwiel","year":"2008","unstructured":"Kiwiel, K.C.: A method of centers with approximate subgradient linearizations for nonsmooth convex optimization. SIAM J. Optim. 18, 1467\u20131489 (2008)","journal-title":"SIAM J. Optim."},{"key":"565_CR33","doi-asserted-by":"crossref","first-page":"177","DOI":"10.1007\/s10107-007-0187-4","volume":"118","author":"KC Kiwiel","year":"2009","unstructured":"Kiwiel, K.C., Lemar\u00e9chal, C.: An inexact bundle variant suited to column generation. Math. Program. 118, 177\u2013206 (2009)","journal-title":"Math. Program."},{"key":"565_CR34","doi-asserted-by":"crossref","first-page":"901","DOI":"10.1137\/0803047","volume":"3","author":"KO Kortanek","year":"1993","unstructured":"Kortanek, K.O., No, H.: A central cutting plane algorithm for convex semi-infinite programming problems. SIAM J. Optim. 3, 901\u2013918 (1993)","journal-title":"SIAM J. Optim."},{"key":"565_CR35","doi-asserted-by":"crossref","first-page":"111","DOI":"10.1007\/BF01585555","volume":"69","author":"C Lemar\u00e9chal","year":"1995","unstructured":"Lemar\u00e9chal, C., Nemirovskii, A., Nesterov, Y.: New variants of bundle methods. Math. Program. 69, 111\u2013147 (1995)","journal-title":"Math. Program."},{"key":"565_CR36","first-page":"373","volume":"83","author":"L Luk\u0161an","year":"1998","unstructured":"Luk\u0161an, L., Vl\u010dek, J.: A bundle-Newton method for nonsmooth unconstrained minimization. Math. Program. 83, 373\u2013391 (1998)","journal-title":"Math. Program."},{"key":"565_CR37","first-page":"635","volume":"265","author":"J Lv","year":"2015","unstructured":"Lv, J., Pang, L.P., Wang, J.H.: Special backtracking proximal bundle method for nonconvex maximum eigenvalue optimization. Appl. Math. Comput. 265, 635\u2013651 (2015)","journal-title":"Appl. Math. Comput."},{"key":"565_CR38","doi-asserted-by":"crossref","first-page":"191","DOI":"10.1287\/moor.2.2.191","volume":"2","author":"R Mifflin","year":"1977","unstructured":"Mifflin, R.: An algorithm for constrained optimization with semismooth functions. Math. Oper. Res. 2, 191\u2013207 (1977)","journal-title":"Math. Oper. Res."},{"key":"565_CR39","doi-asserted-by":"crossref","first-page":"77","DOI":"10.1007\/BFb0120960","volume":"17","author":"R Mifflin","year":"1982","unstructured":"Mifflin, R.: A modification and extension of Lemarechal\u2019s algorithm for nonsmooth minimization. Math. Program. Stud. 17, 77\u201390 (1982)","journal-title":"Math. Program. Stud."},{"key":"565_CR40","first-page":"51","volume":"73","author":"R Mifflin","year":"1996","unstructured":"Mifflin, R.: A quasi-second-order proximal bundle algorithm. Math. Program. 73, 51\u201372 (1996)","journal-title":"Math. Program."},{"key":"565_CR41","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":"565_CR42","doi-asserted-by":"crossref","first-page":"555","DOI":"10.1007\/978-1-4614-7621-4_26","volume":"50","author":"D Noll","year":"2013","unstructured":"Noll, D.: Bundle method for non-convex minimization with inexact subgradients and function values. Comput. Anal. Math. 50, 555\u2013592 (2013)","journal-title":"Comput. Anal. Math."},{"key":"565_CR43","doi-asserted-by":"crossref","first-page":"433","DOI":"10.1007\/s10589-015-9810-0","volume":"64","author":"LP Pang","year":"2016","unstructured":"Pang, L.P., Lv, J.: Constrained incremental bundle method with partial inexact oracle for nonsmooth convex semi-infinite programming problems. Comput. Optim. Appl. 64, 433\u2013465 (2016)","journal-title":"Comput. Optim. Appl."},{"key":"565_CR44","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-02431-3","volume-title":"Variational Analysis","author":"RT Rockafellar","year":"1998","unstructured":"Rockafellar, R.T., Wets, J.J.-B.: Variational Analysis. Springer, Berlin (1998)"},{"key":"565_CR45","doi-asserted-by":"crossref","first-page":"265","DOI":"10.1137\/S1056263493260386","volume":"8","author":"B Rustem","year":"1998","unstructured":"Rustem, B., Nguyen, Q.: An algorithm for the inequality-constrained discrete minimax problem. SIAM J. Optim. 8, 265\u2013283 (1998)","journal-title":"SIAM J. Optim."},{"key":"565_CR46","doi-asserted-by":"crossref","first-page":"146","DOI":"10.1137\/040603875","volume":"16","author":"C Sagastiz\u00e1bal","year":"2005","unstructured":"Sagastiz\u00e1bal, C., Solodov, M.: An infeasible bundle method for nonsmooth convex constrained optimization without a penalty function or a filter. SIAM J. Optim. 16, 146\u2013169 (2005)","journal-title":"SIAM J. Optim."},{"key":"565_CR47","doi-asserted-by":"crossref","first-page":"663","DOI":"10.1023\/A:1022680114518","volume":"98","author":"MV Solodov","year":"1998","unstructured":"Solodov, M.V., Zavriev, S.K.: Error stabilty properties of generalized gradient-type algorithms. J. Optim. Theory Appl. 98, 663\u2013680 (1998)","journal-title":"J. Optim. Theory Appl."},{"key":"565_CR48","doi-asserted-by":"crossref","first-page":"151","DOI":"10.1023\/B:JOTA.0000005046.70410.02","volume":"119","author":"MV Solodov","year":"2003","unstructured":"Solodov, M.V.: On approximations with finite precision in bundle methods for nonsmooth optimization. J. Optim. Theory Appl. 119, 151\u2013165 (2003)","journal-title":"J. Optim. Theory Appl."},{"key":"565_CR49","doi-asserted-by":"crossref","first-page":"77","DOI":"10.1090\/S0002-9947-1981-0597868-8","volume":"264","author":"JE Spingarn","year":"1981","unstructured":"Spingarn, J.E.: Submonotone subdifferentials of Lipschitz functions. Trans. Am. Math. Soc. 264, 77\u201389 (1981)","journal-title":"Trans. Am. Math. Soc."},{"key":"565_CR50","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4419-9164-5","volume-title":"Bi-Level Strategies in Semi-Infinite Programming","author":"O Stein","year":"2003","unstructured":"Stein, O.: Bi-Level Strategies in Semi-Infinite Programming. Kluwer, Boston (2003)"},{"key":"565_CR51","doi-asserted-by":"crossref","first-page":"647","DOI":"10.1023\/B:JOTA.0000037607.48762.45","volume":"121","author":"O Stein","year":"2004","unstructured":"Stein, O.: On constraint qualifications in nonsmooth optimization. J. Optim. Theory. Appl. 121, 647\u2013671 (2004)","journal-title":"J. Optim. Theory. Appl."},{"key":"565_CR52","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/s11075-012-9692-5","volume":"65","author":"CM Tang","year":"2014","unstructured":"Tang, C.M., Liu, S., Jian, J.B., Li, J.L.: A feasible SQP-GS algorithm for nonconvex, nonsmooth constrained optimization. Numer. Algor. 65, 1\u201322 (2014)","journal-title":"Numer. Algor."},{"key":"565_CR53","doi-asserted-by":"crossref","first-page":"803","DOI":"10.1080\/02331938808843393","volume":"19","author":"R Tichatschke","year":"1988","unstructured":"Tichatschke, R., Nebeling, V.: A cutting plane method for quadratic semi-infinite programming problems. Optimization. 19, 803\u2013817 (1988)","journal-title":"Optimization."},{"key":"565_CR54","doi-asserted-by":"crossref","unstructured":"Wolfe, P.: A method of conjugate subgradients for minimizing nondifferentiable functions. In: Balinski, M.L., Wolfe, P. (eds.) Nondifferentiable Optimization. Math. Program. Stud., 3, pp. 145\u2013173. North-Holland, Amsterdam (1975)","DOI":"10.1007\/BFb0120703"},{"key":"565_CR55","doi-asserted-by":"crossref","first-page":"900","DOI":"10.1007\/s10957-014-0523-9","volume":"163","author":"Y Yang","year":"2014","unstructured":"Yang, Y., Pang, L.P., Ma, X.F., Shen, J.: Constrained nonconvex nonsmooth optimization via proximal bundle method. J. Optim. Theory Appl. 163, 900\u2013925 (2014)","journal-title":"J. Optim. Theory Appl."},{"key":"565_CR56","doi-asserted-by":"crossref","first-page":"2959","DOI":"10.1137\/090767133","volume":"20","author":"LP Zhang","year":"2010","unstructured":"Zhang, L.P., Wu, S.-Y., L\u00f3pez, M.A.: A new exchange method for convex semi-infinite programming. SIAM J. Optim. 20, 2959\u20132977 (2010)","journal-title":"SIAM J. Optim."}],"container-title":["Journal of Global Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10898-017-0565-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10898-017-0565-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10898-017-0565-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2018,2,16]],"date-time":"2018-02-16T02:03:22Z","timestamp":1518746602000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10898-017-0565-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,9,14]]},"references-count":56,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2018,3]]}},"alternative-id":["565"],"URL":"https:\/\/doi.org\/10.1007\/s10898-017-0565-2","relation":{},"ISSN":["0925-5001","1573-2916"],"issn-type":[{"value":"0925-5001","type":"print"},{"value":"1573-2916","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017,9,14]]}}}