{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,26]],"date-time":"2026-06-26T14:52:11Z","timestamp":1782485531038,"version":"3.54.5"},"reference-count":29,"publisher":"Springer Science and Business Media LLC","issue":"6","license":[{"start":{"date-parts":[[2026,6,1]],"date-time":"2026-06-01T00:00:00Z","timestamp":1780272000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by-nc-nd\/4.0"},{"start":{"date-parts":[[2026,6,1]],"date-time":"2026-06-01T00:00:00Z","timestamp":1780272000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by-nc-nd\/4.0"}],"funder":[{"DOI":"10.13039\/501100006397","name":"National Taiwan Normal University","doi-asserted-by":"crossref","id":[{"id":"10.13039\/501100006397","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Optim Lett"],"published-print":{"date-parts":[[2026,7]]},"DOI":"10.1007\/s11590-026-02283-z","type":"journal-article","created":{"date-parts":[[2026,6,1]],"date-time":"2026-06-01T07:02:35Z","timestamp":1780297355000},"page":"1179-1199","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["An SAA approach for solving a class of stochastic linear semidefinite inverse optimal value problems"],"prefix":"10.1007","volume":"20","author":[{"given":"Yue","family":"Lu","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Zhi-Qiang","family":"Hu","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Dong-Yang","family":"Xue","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4596-9419","authenticated-orcid":false,"given":"Jein-Shan","family":"Chen","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2026,6,1]]},"reference":[{"key":"2283_CR1","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1007\/s10107-004-0515-x","volume":"102","author":"S Ahmed","year":"2005","unstructured":"Ahmed, S., Guan, Y.: The inverse optimal value problem. Math. Program. 102, 91\u2013110 (2005)","journal-title":"Math. Program."},{"key":"2283_CR2","doi-asserted-by":"publisher","first-page":"771","DOI":"10.1287\/opre.49.5.771.10607","volume":"49","author":"R Ahuja","year":"2001","unstructured":"Ahuja, R., Orlin, J.: Inverse optimization. Oper. Res. 49, 771\u2013783 (2001)","journal-title":"Oper. Res."},{"key":"2283_CR3","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1002\/net.10048","volume":"40","author":"R Ahuja","year":"2002","unstructured":"Ahuja, R., Orlin, J.: Combinatorial algorithms for inverse network flow problems. Networks 40, 181\u2013187 (2002)","journal-title":"Networks"},{"key":"2283_CR4","doi-asserted-by":"publisher","first-page":"45","DOI":"10.1007\/BF01585693","volume":"53","author":"W Burton","year":"1992","unstructured":"Burton, W., Toint, P.: On an instance of the inverse shortest paths problem. Math. Program. 53, 45\u201361 (1992)","journal-title":"Math. Program."},{"key":"2283_CR5","doi-asserted-by":"publisher","first-page":"213","DOI":"10.1023\/A:1008360312607","volume":"15","author":"M Cai","year":"1999","unstructured":"Cai, M., Yang, X., Zhang, J.: The complexity analysis of the inverse center location problem. J. Global Optim. 15, 213\u2013218 (1999)","journal-title":"J. Global Optim."},{"key":"2283_CR6","doi-asserted-by":"publisher","first-page":"293","DOI":"10.1007\/s10107-002-0306-1","volume":"95","author":"X Chen","year":"2003","unstructured":"Chen, X., Tseng, P.: Non-Interior continuation methods for solving semidefinite complementarity problems. Math. Program. 95, 293\u2013327 (2003)","journal-title":"Math. Program."},{"key":"2283_CR7","doi-asserted-by":"publisher","first-page":"1042","DOI":"10.1007\/s10957-016-0892-3","volume":"169","author":"B Donoghue","year":"2016","unstructured":"Donoghue, B., Chu, E., Parikh, N., Boyd, S.: Conic optimization via operator splitting and homogeneous self-dual embedding. J. Optim. Theory Appl. 169, 1042\u20131068 (2016)","journal-title":"J. Optim. Theory Appl."},{"key":"2283_CR8","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1007\/s11075-012-9567-9","volume":"62","author":"L Han","year":"2013","unstructured":"Han, L., Bi, S.J., Pan, S.H.: Nonsingularity of FB system and constraint nondegeneracy in semidefinite programming. Numer. Algorithms. 62, 79\u2013113 (2013)","journal-title":"Numer. Algorithms."},{"key":"2283_CR9","doi-asserted-by":"publisher","first-page":"329","DOI":"10.1023\/B:JOCO.0000038914.26975.9b","volume":"8","author":"C Heuberger","year":"2004","unstructured":"Heuberger, C.: Inverse combinatorial optimization: a survey on problems, methods and results. J. Comb. Optim. 8, 329\u2013361 (2004)","journal-title":"J. Comb. Optim."},{"key":"2283_CR10","doi-asserted-by":"publisher","first-page":"319","DOI":"10.1016\/j.orl.2004.04.007","volume":"33","author":"G Iyengar","year":"2005","unstructured":"Iyengar, G., Kang, W.: Inverse conic programming and applications. Oper. Res. Lett. 33, 319\u2013330 (2005)","journal-title":"Oper. Res. Lett."},{"key":"2283_CR11","doi-asserted-by":"publisher","DOI":"10.1016\/j.cam.2022.114754","volume":"419","author":"J Jia","year":"2023","unstructured":"Jia, J., Guan, X., Wang, H., Zhang, B., Pardalos, P.M.: Combinatorial algorithms for solving the restricted bounded inverse optimal value problem on minimum spanning tree under weighted $$l_\\infty $$ norm. J. Comput. Appl. Math. 419, 114754 (2023)","journal-title":"J. Comput. Appl. Math."},{"key":"2283_CR12","first-page":"317","volume":"12","author":"Y Lu","year":"2016","unstructured":"Lu, Y., Ge, Y., Zhang, L.: An alternating direction method for solving a class of inverse semidefinite quadratic programming problems. J. Ind. Manag. Optim. 12, 317\u2013336 (2016)","journal-title":"J. Ind. Manag. Optim."},{"key":"2283_CR13","doi-asserted-by":"publisher","first-page":"1075","DOI":"10.1080\/02331934.2019.1576663","volume":"68","author":"Y Lu","year":"2019","unstructured":"Lu, Y., Huang, M., Zhang, Y., Gu, J.: A nonconvex ADMM for a class of sparse inverse semidefinite quadratic programming problems. Optimization 68, 1075\u20131105 (2019)","journal-title":"Optimization"},{"key":"2283_CR14","volume-title":"Variational Analysis","author":"RT Rockafellar","year":"2009","unstructured":"Rockafellar, R.T., Wets, R.J.-B.: Variational Analysis, vol. 317. Springer Science & Business Media, Berlin (2009)"},{"key":"2283_CR15","doi-asserted-by":"publisher","first-page":"861","DOI":"10.1007\/s10878-021-00721-5","volume":"41","author":"H Wang","year":"2021","unstructured":"Wang, H., Guan, X., Zhang, Q., Zhang, B.: Capacitated inverse optimal value problem on minimum spanning tree under bottleneck Hamming distance. J. Comb. Optim. 41, 861\u2013887 (2021)","journal-title":"J. Comb. Optim."},{"key":"2283_CR16","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1007\/s10107-004-0559-y","volume":"106","author":"A W\u00e4chter","year":"2006","unstructured":"W\u00e4chter, A., Biegler, T.: On the implementation of a primal-dual interior point filter line search algorithm for large-scale nonlinear programming. Math. Program. 106, 25\u201357 (2006)","journal-title":"Math. Program."},{"key":"2283_CR17","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1142\/S0217595916500251","volume":"33","author":"J Wu","year":"2016","unstructured":"Wu, J., Zhang, Y., Zhang, L., Lu, Y.: A sequential convex program approach to an inverse linear semidefinite programming problem. Asia-Pac. J. Oper. Res. 33, 1\u201326 (2016)","journal-title":"Asia-Pac. J. Oper. Res."},{"key":"2283_CR18","doi-asserted-by":"publisher","first-page":"155","DOI":"10.1007\/s11228-013-0242-7","volume":"22","author":"J Wu","year":"2014","unstructured":"Wu, J., Zhang, L., Zhang, Y.: Mathematical programs with semidefinite cone complementarity constraints: constraint qualifications and optimality conditions. Set-Valued Var. Anal. 22, 155\u2013187 (2014)","journal-title":"Set-Valued Var. Anal."},{"key":"2283_CR19","doi-asserted-by":"publisher","first-page":"485","DOI":"10.1016\/j.cam.2008.01.028","volume":"223","author":"X Xiao","year":"2009","unstructured":"Xiao, X., Zhang, L., Zhang, J.: A smoothing Newton method for a type of inverse semidefinite quadratic programming problem. J. Comput. Appl. Math. 223, 485\u2013498 (2009)","journal-title":"J. Comput. Appl. Math."},{"key":"2283_CR20","doi-asserted-by":"publisher","first-page":"319","DOI":"10.3934\/jimo.2009.5.319","volume":"5","author":"X Xiao","year":"2009","unstructured":"Xiao, X., Zhang, L., Zhang, J.: On convergence of augmented Lagrange method for inverse semidefinite quadratic programming problems. J. Ind. Manag. Optim. 5, 319\u2013339 (2009)","journal-title":"J. Ind. Manag. Optim."},{"key":"2283_CR21","doi-asserted-by":"publisher","first-page":"2301","DOI":"10.1007\/s11590-020-01553-8","volume":"14","author":"B Zhang","year":"2020","unstructured":"Zhang, B., Guan, X., Zhao, Q.: Inverse optimal value problem on minimum spanning tree under unit $$l_\\infty $$ norm. Optim. Lett. 14, 2301\u20132322 (2020)","journal-title":"Optim. Lett."},{"key":"2283_CR22","doi-asserted-by":"publisher","first-page":"757","DOI":"10.1007\/s10898-020-00947-3","volume":"79","author":"B Zhang","year":"2021","unstructured":"Zhang, B., Guan, X., Pardalos, P.M., Wang, H., Zhao, Q., Liu, Y., Chen, S.: The lower bounded inverse optimal value problem on minimum spanning tree under unit $$l_\\infty $$ norm. J. Global Optim. 79, 757\u2013777 (2021)","journal-title":"J. Global Optim."},{"key":"2283_CR23","doi-asserted-by":"publisher","first-page":"345","DOI":"10.1016\/S0377-0427(99)00080-1","volume":"106","author":"J Zhang","year":"1999","unstructured":"Zhang, J., Liu, Z.: A further study on inverse linear programming problems. J. Comput. Appl. Math. 106, 345\u2013359 (1999)","journal-title":"J. Comput. Appl. Math."},{"key":"2283_CR24","doi-asserted-by":"publisher","first-page":"261","DOI":"10.1016\/0377-0427(95)00277-4","volume":"72","author":"J Zhang","year":"1996","unstructured":"Zhang, J., Liu, Z.: Calculating some inverse linear programming problems. J. Comput. Appl. Math. 72, 261\u2013273 (1996)","journal-title":"J. Comput. Appl. Math."},{"key":"2283_CR25","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1016\/S0377-2217(99)00122-8","volume":"124","author":"J Zhang","year":"2000","unstructured":"Zhang, J., Liu, Z., Ma, Z.: Some reverse location problems. European J. Oper. Res. 124, 77\u201388 (2000)","journal-title":"European J. Oper. Res."},{"key":"2283_CR26","doi-asserted-by":"publisher","first-page":"127","DOI":"10.1023\/A:1009829525096","volume":"3","author":"J Zhang","year":"1999","unstructured":"Zhang, J., Ma, Z.: Solution structure of some inverse combinatorial optimization problems. J. Comb. Optim. 3, 127\u2013139 (1999)","journal-title":"J. Comb. Optim."},{"key":"2283_CR27","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1007\/s00245-009-9075-z","volume":"61","author":"J Zhang","year":"2010","unstructured":"Zhang, J., Zhang, L.: An augmented Lagrangian method for a class of inverse quadratic programming problems. Appl. Math. Optim. 61, 57\u201383 (2010)","journal-title":"Appl. Math. Optim."},{"key":"2283_CR28","doi-asserted-by":"publisher","first-page":"171","DOI":"10.3934\/jimo.2013.9.171","volume":"9","author":"Y Zhang","year":"2013","unstructured":"Zhang, Y., Jiang, Y., Zhang, L., Zhang, J.: A perturbation approach for an inverse linear second-order cone programming. J. Ind. Manag. Optim. 9, 171\u2013189 (2013)","journal-title":"J. Ind. Manag. Optim."},{"key":"2283_CR29","doi-asserted-by":"publisher","first-page":"251","DOI":"10.1007\/s10898-022-01256-7","volume":"86","author":"Q Zhao","year":"2023","unstructured":"Zhao, Q., Guan, X., Jia, J., Qian, X., Pardalos, P.M.: The restricted inverse optimal value problem on shortest path under $$l_1$$ norm on trees. J. Global Optim. 86, 251\u2013284 (2023)","journal-title":"J. Global Optim."}],"container-title":["Optimization Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-026-02283-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11590-026-02283-z","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-026-02283-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,6,26]],"date-time":"2026-06-26T14:42:31Z","timestamp":1782484951000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11590-026-02283-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,6,1]]},"references-count":29,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2026,7]]}},"alternative-id":["2283"],"URL":"https:\/\/doi.org\/10.1007\/s11590-026-02283-z","relation":{},"ISSN":["1862-4472","1862-4480"],"issn-type":[{"value":"1862-4472","type":"print"},{"value":"1862-4480","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026,6,1]]},"assertion":[{"value":"3 December 2024","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"25 January 2026","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"1 June 2026","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors have no Conflict of interest to declare that are relevant to the content of this article.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}