{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,4]],"date-time":"2026-05-04T03:45:19Z","timestamp":1777866319484,"version":"3.51.4"},"reference-count":57,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2026,9,1]],"date-time":"2026-09-01T00:00:00Z","timestamp":1788220800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2026,9,1]],"date-time":"2026-09-01T00:00:00Z","timestamp":1788220800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"}],"funder":[{"DOI":"10.13039\/501100007957","name":"Chongqing Municipal Education Commission","doi-asserted-by":"publisher","award":["KJQN202500902"],"award-info":[{"award-number":["KJQN202500902"]}],"id":[{"id":"10.13039\/501100007957","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100015295","name":"Chongqing Social Science Planning Fund","doi-asserted-by":"publisher","award":["2025BS075"],"award-info":[{"award-number":["2025BS075"]}],"id":[{"id":"10.13039\/501100015295","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["12271071"],"award-info":[{"award-number":["12271071"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["11991024"],"award-info":[{"award-number":["11991024"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100002369","name":"Chongqing University","doi-asserted-by":"publisher","award":["CXQT20014"],"award-info":[{"award-number":["CXQT20014"]}],"id":[{"id":"10.13039\/501100002369","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100012457","name":"Chongqing Municipal Basic and Frontier Research Project","doi-asserted-by":"publisher","award":["cstc2021jcyjmsxmX0300"],"award-info":[{"award-number":["cstc2021jcyjmsxmX0300"]}],"id":[{"id":"10.13039\/501100012457","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100020595","name":"MOST","doi-asserted-by":"publisher","id":[{"id":"10.13039\/100020595","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100003711","name":"Ministry of Science and Technology","doi-asserted-by":"publisher","award":["111-2115- M-039-001-MY2"],"award-info":[{"award-number":["111-2115- M-039-001-MY2"]}],"id":[{"id":"10.13039\/501100003711","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Mathematics and Computers in Simulation"],"published-print":{"date-parts":[[2026,9]]},"DOI":"10.1016\/j.matcom.2026.03.031","type":"journal-article","created":{"date-parts":[[2026,3,27]],"date-time":"2026-03-27T03:50:48Z","timestamp":1774583448000},"page":"523-544","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":0,"special_numbering":"C","title":["A novel memory gradient method for unconstrained multiobjective optimization problems with application to image restoration"],"prefix":"10.1016","volume":"247","author":[{"given":"Jianwen","family":"Peng","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dong","family":"Liu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2697-122X","authenticated-orcid":false,"given":"Xueqing","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jen-Chih","family":"Yao","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"issue":"6","key":"10.1016\/j.matcom.2026.03.031_b1","doi-asserted-by":"crossref","first-page":"1148","DOI":"10.1287\/opre.40.6.1148","article-title":"On the minimization of completion time variance with a bicriteria extension","volume":"40","author":"De","year":"1992","journal-title":"Oper. Res."},{"issue":"8","key":"10.1016\/j.matcom.2026.03.031_b2","doi-asserted-by":"crossref","first-page":"5511","DOI":"10.1109\/TWC.2016.2560815","article-title":"Multi-objective optimization for robust power efficient and secure full-duplex wireless communication systems","volume":"15","author":"Sun","year":"2016","journal-title":"IEEE Trans. Wirel. Commun."},{"issue":"1","key":"10.1016\/j.matcom.2026.03.031_b3","doi-asserted-by":"crossref","first-page":"117","DOI":"10.1007\/PL00013342","article-title":"Olaf-a general modeling system to evaluate and optimize the location of an air polluting facility","volume":"23","author":"Fliege","year":"2001","journal-title":"OR-Spektrum"},{"key":"10.1016\/j.matcom.2026.03.031_b4","series-title":"Multicriteria Design Optimization: Procedures and Applications","author":"Eschenauer","year":"2012"},{"issue":"7","key":"10.1016\/j.matcom.2026.03.031_b5","doi-asserted-by":"crossref","first-page":"1147","DOI":"10.1016\/S0305-0548(03)00074-1","article-title":"A subjective assessment of alternative mission architectures for the human exploration of mars at NASA using multicriteria decision making","volume":"31","author":"Tavana","year":"2004","journal-title":"Comput. Oper. Res."},{"issue":"1","key":"10.1016\/j.matcom.2026.03.031_b6","doi-asserted-by":"crossref","first-page":"37","DOI":"10.1109\/TEVC.2021.3078478","article-title":"Accurate multi-objective low-rank and sparse model for hyperspectral image denoising method","volume":"27","author":"Wan","year":"2023","journal-title":"IEEE Trans. Evol. Comput."},{"issue":"2","key":"10.1016\/j.matcom.2026.03.031_b7","doi-asserted-by":"crossref","first-page":"182","DOI":"10.1109\/4235.996017","article-title":"A fast and elitist multi-objective genetic algorithm: NSGA-II","volume":"6","author":"Deb","year":"2002","journal-title":"IEEE Trans. Evol. Comput."},{"key":"10.1016\/j.matcom.2026.03.031_b8","doi-asserted-by":"crossref","unstructured":"W.S. Lai, J.B. Huang, N. Ahuja, M.H. Yang, Deep Laplacian Pyramid Networks for Fast and Accurate Super-Resolution, in: Proc. IEEE\/CVF Conf. Comput. Vis. Pattern Recognit. (CVPR), 2017, pp. 5835\u20135843.","DOI":"10.1109\/CVPR.2017.618"},{"key":"10.1016\/j.matcom.2026.03.031_b9","doi-asserted-by":"crossref","unstructured":"I. Laina, C. Rupprecht, V. Belagiannis, F. Tombari, N. Navab, Deeper Depth Prediction with Fully Convolutional Residual Networks, in: Proc. Int. Conf. 3D Vis. (3DV), 2016, pp. 239\u2013248.","DOI":"10.1109\/3DV.2016.32"},{"key":"10.1016\/j.matcom.2026.03.031_b10","doi-asserted-by":"crossref","unstructured":"J. Liang, H. Zeng, L. Zhang, Details or Artifacts: A Locally Discriminative Learning Approach to Realistic Image Super-Resolution, in: Proc. IEEE\/CVF Conf. Comput. Vis. Pattern Recognit. (CVPR), 2022, pp. 5657\u20135666.","DOI":"10.1109\/CVPR52688.2022.00557"},{"key":"10.1016\/j.matcom.2026.03.031_b11","doi-asserted-by":"crossref","unstructured":"A.J. Nebro, J.J. Durillo, J. Garcia-Nieto, C.A. Coello Coello, F. Luna, E. Alba, SMPSO: A New PSO-Based Metaheuristic for multi-objective Optimization, in: Proc. IEEE Symp. Comput. Intell. Multi-Criteria Decis. Making (MCDM), 2009, pp. 66\u201373.","DOI":"10.1109\/MCDM.2009.4938830"},{"issue":"6","key":"10.1016\/j.matcom.2026.03.031_b12","doi-asserted-by":"crossref","first-page":"712","DOI":"10.1109\/TEVC.2007.892759","article-title":"MOEA\/D: a multi-objective evolutionary algorithm based on decomposition","volume":"11","author":"Zhang","year":"2007","journal-title":"IEEE Trans. Evol. Comput."},{"key":"10.1016\/j.matcom.2026.03.031_b13","unstructured":"E. Zitzler, M. Laumanns, L. Thiele, SPEA2: Improving the Strength Pareto Evolutionary Algorithm, Tech. Rep. Gloriastrasse, 2001."},{"issue":"4","key":"10.1016\/j.matcom.2026.03.031_b14","doi-asserted-by":"crossref","first-page":"455","DOI":"10.1023\/A:1008306431147","article-title":"Efficient global optimization of expensive black-box functions","volume":"13","author":"Jones","year":"1998","journal-title":"J. Global Optim."},{"key":"10.1016\/j.matcom.2026.03.031_b15","series-title":"Proceedings of the 32nd ACM International Conference on Multimedia","first-page":"7483","article-title":"Perceptual-distortion balanced image super-resolution is a multi-objective optimization problem","author":"Zhu","year":"2024"},{"key":"10.1016\/j.matcom.2026.03.031_b16","first-page":"9851","article-title":"Differentiable expected hypervolume improvement for parallel multi-objective Bayesian optimization","volume":"vol. 33","author":"Daulton","year":"2020"},{"key":"10.1016\/j.matcom.2026.03.031_b17","first-page":"2187","article-title":"Parallel Bayesian optimization of multiple noisy objectives with expected hypervolume improvement","volume":"vol. 34","author":"Daulton","year":"2021"},{"key":"10.1016\/j.matcom.2026.03.031_b18","doi-asserted-by":"crossref","unstructured":"T. Wagner, M. Emmerich, A. Deutz, W. Ponweiser, On Expected-Improvement Criteria for Model-based Multi-objective Optimization, in: Proc. Parallel Problem Solving from Nature (PPSN), 2010, pp. 718\u2013727.","DOI":"10.1007\/978-3-642-15844-5_72"},{"issue":"3","key":"10.1016\/j.matcom.2026.03.031_b19","doi-asserted-by":"crossref","first-page":"479","DOI":"10.1007\/s001860000043","article-title":"Steepest descent methods for multicriteria optimization","volume":"51","author":"Fliege","year":"2000","journal-title":"Math. Methods Oper. Res."},{"issue":"15","key":"10.1016\/j.matcom.2026.03.031_b20","article-title":"Memory gradient method for multi-objective optimization","volume":"443","author":"Chen","year":"2024","journal-title":"Appl. Math. Comput."},{"issue":"2","key":"10.1016\/j.matcom.2026.03.031_b21","doi-asserted-by":"crossref","first-page":"395","DOI":"10.1016\/j.cam.2004.06.018","article-title":"A steepest descent method for vector optimization","volume":"175","author":"Drummond","year":"2005","journal-title":"J. Comput. Appl. Math."},{"issue":"2","key":"10.1016\/j.matcom.2026.03.031_b22","doi-asserted-by":"crossref","first-page":"602","DOI":"10.1137\/08071692X","article-title":"Newton\u2019s method for multi-objective optimization","volume":"20","author":"Fliege","year":"2009","journal-title":"SIAM J. Optim."},{"issue":"3","key":"10.1016\/j.matcom.2026.03.031_b23","doi-asserted-by":"crossref","first-page":"2388","DOI":"10.1137\/18M1191737","article-title":"Extended Newton methods for multi-objective optimization: majorizing function technique and convergence analysis","volume":"29","author":"Wang","year":"2019","journal-title":"SIAM J. Optim."},{"key":"10.1016\/j.matcom.2026.03.031_b24","doi-asserted-by":"crossref","first-page":"227","DOI":"10.1007\/s12532-022-00231-3","article-title":"A memetic procedure for global multi-objective optimization","volume":"15","author":"Lapucci","year":"2023","journal-title":"Math. Program. Comput."},{"key":"10.1016\/j.matcom.2026.03.031_b25","doi-asserted-by":"crossref","first-page":"33","DOI":"10.1007\/s10589-023-00454-7","article-title":"A limited memory Quasi-Newton approach for multi-objective optimization","volume":"85","author":"Lapucci","year":"2023","journal-title":"Comput. Optim. Appl."},{"key":"10.1016\/j.matcom.2026.03.031_b26","doi-asserted-by":"crossref","first-page":"1107","DOI":"10.1007\/s10957-022-02072-5","article-title":"A Quasi-Newton method with wolfe line searches for multi-objective optimization","volume":"194","author":"Prudente","year":"2022","journal-title":"J. Optim. Theory Appl."},{"issue":"3","key":"10.1016\/j.matcom.2026.03.031_b27","doi-asserted-by":"crossref","first-page":"889","DOI":"10.1007\/s10589-019-00146-1","article-title":"On the extension of the hager-zhang conjugate gradient method for vector optimization","volume":"76","author":"M.L.N. Gon\u00e7alves","year":"2020","journal-title":"Comput. Optim. Appl."},{"key":"10.1016\/j.matcom.2026.03.031_b28","article-title":"A study of liu-storey conjugate gradient methods for vector optimization","volume":"425","author":"M.L.N. Gon\u00e7alves","year":"2022","journal-title":"Appl. Comput. Math."},{"issue":"3","key":"10.1016\/j.matcom.2026.03.031_b29","doi-asserted-by":"crossref","first-page":"2690","DOI":"10.1137\/17M1126588","article-title":"Nonlinear conjugate gradient methods for vector optimization","volume":"28","author":"L.R. Lucambio P\u00e9rez","year":"2018","journal-title":"SIAM J. Optim."},{"key":"10.1016\/j.matcom.2026.03.031_b30","doi-asserted-by":"crossref","first-page":"217","DOI":"10.1007\/s10589-023-00548-2","article-title":"Alternative extension of the hager-zhang conjugate gradient method for vector optimization","volume":"88","author":"Hu","year":"2024","journal-title":"Comput. Optim. Appl."},{"issue":"8\u20139","key":"10.1016\/j.matcom.2026.03.031_b31","doi-asserted-by":"crossref","first-page":"1009","DOI":"10.1080\/02331934.2010.522710","article-title":"On the convergence of the projected gradient method for vector optimization","volume":"60","author":"Fukuda","year":"2011","journal-title":"Optimization"},{"issue":"3","key":"10.1016\/j.matcom.2026.03.031_b32","doi-asserted-by":"crossref","first-page":"473","DOI":"10.1007\/s10589-012-9501-z","article-title":"Inexact projected gradient method for vector optimization","volume":"54","author":"Fukuda","year":"2013","journal-title":"Comput. Optim. Appl."},{"issue":"6","key":"10.1016\/j.matcom.2026.03.031_b33","doi-asserted-by":"crossref","first-page":"1365","DOI":"10.1007\/s11590-018-1353-8","article-title":"Convergence analysis of a nonmonotone projected gradient method for multi-objective optimization problems","volume":"13","author":"Fazzio","year":"2019","journal-title":"Optim. Lett."},{"issue":"3","key":"10.1016\/j.matcom.2026.03.031_b34","doi-asserted-by":"crossref","first-page":"741","DOI":"10.1007\/s10589-020-00260-5","article-title":"Conditional gradient method for multi-objective optimization","volume":"78","author":"P.B. Assun\u00e7\u00e3o","year":"2021","journal-title":"Comput. Optim. Appl."},{"issue":"3","key":"10.1016\/j.matcom.2026.03.031_b35","doi-asserted-by":"crossref","first-page":"857","DOI":"10.1007\/s10589-023-00478-z","article-title":"Conditional gradient method for vector optimization","volume":"85","author":"Chen","year":"2023","journal-title":"Comput. Optim. Appl."},{"key":"10.1016\/j.matcom.2026.03.031_b36","doi-asserted-by":"crossref","first-page":"810","DOI":"10.1007\/s10957-024-02535-x","article-title":"On the extension of Dai-Liao conjugate gradient method for vector optimization","volume":"203","author":"Hu","year":"2024","journal-title":"J. Optim. Theory Appl."},{"key":"10.1016\/j.matcom.2026.03.031_b37","doi-asserted-by":"crossref","DOI":"10.1016\/j.cam.2025.116486","article-title":"A vector restricted variant MVHS+ CG method based algorithm for unconstrained vector optimization problems","volume":"463","author":"Hu","year":"2025","journal-title":"J. Comput. Appl. Math."},{"key":"10.1016\/j.matcom.2026.03.031_b38","first-page":"13","article-title":"APRP type conjugate gradient method without truncation for nonconvex vector optimization","volume":"203","author":"Chen","year":"2025","journal-title":"J. Optim. Theory Appl."},{"issue":"3","key":"10.1016\/j.matcom.2026.03.031_b39","doi-asserted-by":"crossref","first-page":"325","DOI":"10.1007\/s10589-006-8719-z","article-title":"Global convergence of a memory gradient method for unconstrained optimization","volume":"35","author":"Narushima","year":"2006","journal-title":"Comput. Optim. Appl."},{"issue":"8","key":"10.1016\/j.matcom.2026.03.031_b40","doi-asserted-by":"crossref","first-page":"1643","DOI":"10.1007\/s11590-011-0355-6","article-title":"A new variant of the memory gradient method for unconstrained optimization","volume":"6","author":"Zheng","year":"2012","journal-title":"Optim. Lett."},{"key":"10.1016\/j.matcom.2026.03.031_b41","doi-asserted-by":"crossref","first-page":"28","DOI":"10.1016\/j.camwa.2007.02.001","article-title":"Memory gradient method with goldstein line search","volume":"53","author":"Shi","year":"2007","journal-title":"Comput. Math. Appl."},{"issue":"1","key":"10.1016\/j.matcom.2026.03.031_b42","doi-asserted-by":"crossref","first-page":"53","DOI":"10.1515\/1569395054069008","article-title":"A new class of memory gradient methods with inexact line searches","volume":"13","author":"Shi","year":"2005","journal-title":"J. Numer. Math."},{"key":"10.1016\/j.matcom.2026.03.031_b43","first-page":"1","article-title":"A new super-memory gradient method with curve search rule","volume":"170","author":"Shi","year":"2008","journal-title":"Appl. Math. Comput."},{"issue":"11","key":"10.1016\/j.matcom.2026.03.031_b44","doi-asserted-by":"crossref","first-page":"2289","DOI":"10.1080\/02331934.2014.947500","article-title":"A modified quasi-Newton method for vector optimization problem","volume":"64","author":"Ansary","year":"2015","journal-title":"Optimization"},{"issue":"5","key":"10.1016\/j.matcom.2026.03.031_b45","doi-asserted-by":"crossref","first-page":"477","DOI":"10.1109\/TEVC.2005.861417","article-title":"A review of multi-objective test problems and a scalable test problem toolkit","volume":"10","author":"Huband","year":"2006","journal-title":"IEEE Trans. Evol. Comput."},{"issue":"3","key":"10.1016\/j.matcom.2026.03.031_b46","doi-asserted-by":"crossref","first-page":"631","DOI":"10.1137\/S1052623496307510","article-title":"Normal-boundary intersection: a new method for generating the Pareto surface in nonlinear multicriteria optimization problems","volume":"8","author":"Das","year":"1998","journal-title":"SIAM J. Optim."},{"issue":"3","key":"10.1016\/j.matcom.2026.03.031_b47","doi-asserted-by":"crossref","first-page":"557","DOI":"10.1023\/A:1017536311488","article-title":"Generalized homotopy approach to multi-objective optimization","volume":"110","author":"Hillermeier","year":"2001","journal-title":"J. Optim. Theory Appl."},{"key":"10.1016\/j.matcom.2026.03.031_b48","unstructured":"Y. Jin, M. Olhofer, B. Sendhoff, Dynamic weighted aggregation for evolutionary multi-objective optimization: why does it work and how?, in: Proceedings of the Genetic and Evolutionary Computation Conference, 2001, pp. 1042\u20131049."},{"issue":"2","key":"10.1016\/j.matcom.2026.03.031_b49","doi-asserted-by":"crossref","first-page":"463","DOI":"10.1137\/100784746","article-title":"Singular continuation: generating piecewise linear approximations to Pareto sets via global analysis","volume":"21","author":"Lovison","year":"2011","journal-title":"SIAM J. Optim."},{"key":"10.1016\/j.matcom.2026.03.031_b50","series-title":"Parallel Problem Solving from Nature-PPSN IX","first-page":"513","article-title":"Pareto set and EMOA behavior for simple multimodal multi-objective functions","author":"Preuss","year":"2006"},{"issue":"3","key":"10.1016\/j.matcom.2026.03.031_b51","doi-asserted-by":"crossref","first-page":"662","DOI":"10.1016\/j.ejor.2007.05.015","article-title":"Box-constrained multi-objective optimization: a gradient like method without a priori scalarization","volume":"188","author":"Miglierina","year":"2008","journal-title":"European J. Oper. Res."},{"issue":"4","key":"10.1016\/j.matcom.2026.03.031_b52","doi-asserted-by":"crossref","first-page":"559","DOI":"10.1007\/s10898-007-9265-7","article-title":"Convergence of stochastic search algorithms to finite size Pareto set approximations","volume":"41","author":"O. Sch\u00fctze","year":"2008","journal-title":"J. Global Optim."},{"key":"10.1016\/j.matcom.2026.03.031_b53","series-title":"Test problems for partially separable optimization and results for the routine PSPMIN","author":"Toint","year":"1983"},{"key":"10.1016\/j.matcom.2026.03.031_b54","first-page":"201","article-title":"Benchmarking optimization software with performance profiles","volume":"91","author":"Elizabeth","year":"2001","journal-title":"Math. Program."},{"issue":"3","key":"10.1016\/j.matcom.2026.03.031_b55","doi-asserted-by":"crossref","first-page":"1109","DOI":"10.1137\/10079731X","article-title":"Direct multisearch for multiobjective optimization","volume":"21","author":"A.L. Cust\u00f3dio","year":"2011","journal-title":"SIAM J. Optim."},{"issue":"3","key":"10.1016\/j.matcom.2026.03.031_b56","doi-asserted-by":"crossref","first-page":"570","DOI":"10.1080\/10556788.2022.2157000","article-title":"A Newton-type proximal gradient method for nonlinear multi-objective optimization problems","volume":"38","author":"Ansary","year":"2023","journal-title":"Optim. Methods Softw."},{"key":"10.1016\/j.matcom.2026.03.031_b57","doi-asserted-by":"crossref","DOI":"10.1016\/j.cam.2024.116483","article-title":"A three-block linearized generalized ADMM based iterative algorithm for separable convex programming with application to an image compression problem","volume":"462","author":"Zhang","year":"2025","journal-title":"J. Comput. Appl. Math."}],"container-title":["Mathematics and Computers in Simulation"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0378475426001229?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0378475426001229?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2026,4,30]],"date-time":"2026-04-30T08:27:03Z","timestamp":1777537623000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0378475426001229"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,9]]},"references-count":57,"alternative-id":["S0378475426001229"],"URL":"https:\/\/doi.org\/10.1016\/j.matcom.2026.03.031","relation":{},"ISSN":["0378-4754"],"issn-type":[{"value":"0378-4754","type":"print"}],"subject":[],"published":{"date-parts":[[2026,9]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"A novel memory gradient method for unconstrained multiobjective optimization problems with application to image restoration","name":"articletitle","label":"Article Title"},{"value":"Mathematics and Computers in Simulation","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.matcom.2026.03.031","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2026 International Association for Mathematics and Computers in Simulation (IMACS). Published by Elsevier B.V. All rights are reserved, including those for text and data mining, AI training, and similar technologies.","name":"copyright","label":"Copyright"}]}}