乐胖代购免代理版

{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,4,1]],"date-time":"2025-04-01T04:26:09Z","timestamp":1743481569294,"version":"3.37.3"},"reference-count":71,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"10","funder":[{"DOI":"10.13039\/501100012166","name":"National Key Research and Development Program of China","doi-asserted-by":"publisher","award":["2018AAA0100100"],"id":[{"id":"10.13039\/501100012166","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61906001,62136008,U21A20512"],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE\/CAA J. Autom. Sinica"],"published-print":{"date-parts":[[2022,10]]},"DOI":"10.1109\/jas.2022.105875","type":"journal-article","created":{"date-parts":[[2022,9,13]],"date-time":"2022-09-13T19:42:43Z","timestamp":1663098163000},"page":"1801-1817","source":"Crossref","is-referenced-by-count":46,"title":["Integrating Conjugate Gradients Into Evolutionary Algorithms for Large-Scale Continuous Multi-Objective Optimization"],"prefix":"10.1109","volume":"9","author":[{"given":"Ye","family":"Tian","sequence":"first","affiliation":[{"name":"Information Materials and Intelligent Sensing Laboratory of Anhui Province, Institutes of Physical Science and Information Technology, Anhui University,China"}]},{"given":"Haowen","family":"Chen","sequence":"additional","affiliation":[{"name":"Information Materials and Intelligent Sensing Laboratory of Anhui Province, Institutes of Physical Science and Information Technology, Anhui University,China"}]},{"given":"Haiping","family":"Ma","sequence":"additional","affiliation":[{"name":"Information Materials and Intelligent Sensing Laboratory of Anhui Province, Institutes of Physical Science and Information Technology, Anhui University,China"}]},{"given":"Xingyi","family":"Zhang","sequence":"additional","affiliation":[{"name":"Key Laboratory of Intelligent Computing and Signal Processing of Ministry of Education, School of Artificial Intelligence, Anhui University,Hefei,China,230601"}]},{"given":"Kay Chen","family":"Tan","sequence":"additional","affiliation":[{"name":"The Hong Kong Polytechnic University,Department of Computing,Hong Kong SAR,China"}]},{"given":"Yaochu","family":"Jin","sequence":"additional","affiliation":[{"name":"Bielefeld University,Faculty of Technology,Bielefeld,Germany,33619"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/CEC.2013.6557903"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2020.2967501"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/BMEI.2010.5639364"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1118\/1.4941007"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/TCYB.2016.2600577"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1145\/3470971"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2017.2704782"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/TCYB.2020.2979930"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/TCYB.2019.2906383"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2015.2395073"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1006\/hmat.1996.2146"},{"article-title":"Adam: A method for stochastic optimization","volume-title":"Proc. 3rd Int. Conf. Learning Representations","author":"Kingma","key":"ref12"},{"volume-title":"Nonlinear Programming: Analysis and Methods","year":"2003","author":"Avriel","key":"ref13"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1090\/s0025-5718-1970-0274029-x"},{"volume-title":"Linear Programming","year":"1983","author":"Murty","key":"ref15"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/TCSII.2018.2842085"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1137\/0111030"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1017\/s0962492900002518"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1007\/s10957-016-0892-3"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/TNNLS.2021.3061630"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2007.892759"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1038\/s41598-017-18940-4"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/TSMCC.2008.919172"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2019.2918140"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/4235.996017"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2017.2749619"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1145\/3205651.3208250"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2016.2600642"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1109\/tevc.2019.2896002"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2021.3119933"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v31i1.10664"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1109\/TCYB.2020.3041325"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1109\/JAS.2022.105437"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1007\/s40747-021-00553-0"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2021.3111209"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2018.10.007"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1109\/TCYB.2020.2985081"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2021.3110780"},{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2018.2881153"},{"key":"ref40","first-page":"372","article-title":"A method for solving a convex programming problem with convergence rate o(1\/k2)","volume":"27","author":"Nesterov","year":"1983","journal-title":"Sov. Math. Dokl."},{"issue":"2","key":"ref41","first-page":"26","article-title":"Lecture 6.5-RMSProp: Divide the gradient by a running average of its recent magnitude","volume":"4","author":"Tieleman","year":"2012","journal-title":"COURSERA: Neural Networks Mach. Learn."},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1090\/S0025-5718-1967-0224273-2"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1090\/psapm\/006\/0084178"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1093\/comjnl\/7.2.149"},{"key":"ref45","doi-asserted-by":"publisher","DOI":"10.1007\/s00158-009-0460-7"},{"key":"ref46","doi-asserted-by":"publisher","DOI":"10.1016\/0270-0255(82)90038-0"},{"key":"ref47","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4615-5563-6"},{"key":"ref48","doi-asserted-by":"publisher","DOI":"10.1007\/s001860000043"},{"key":"ref49","doi-asserted-by":"publisher","DOI":"10.1007\/s10596-016-9562-7"},{"key":"ref50","doi-asserted-by":"publisher","DOI":"10.1137\/08071692X"},{"key":"ref51","doi-asserted-by":"publisher","DOI":"10.1007\/s00158-014-1125-8"},{"key":"ref52","doi-asserted-by":"publisher","DOI":"10.1080\/0305215X.2015.1111068"},{"key":"ref53","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2011.08.037"},{"key":"ref54","doi-asserted-by":"publisher","DOI":"10.1145\/1143997.1144116"},{"key":"ref55","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2018.04.027"},{"key":"ref56","doi-asserted-by":"publisher","DOI":"10.1109\/4235.728207"},{"key":"ref57","doi-asserted-by":"publisher","DOI":"10.1109\/CEC.2008.4631304"},{"volume-title":"Finite Difference Schemes and Partial Differential Equations","year":"1989","author":"Strikwerda","key":"ref58"},{"key":"ref59","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-07124-4"},{"key":"ref60","doi-asserted-by":"publisher","DOI":"10.1109\/CEC.2018.8477730"},{"volume-title":"Robust Engineering","year":"2000","author":"Taguchi","key":"ref61"},{"issue":"2","key":"ref62","first-page":"115","article-title":"Simulated binary crossover for continuous search space","volume":"9","author":"Deb","year":"1995","journal-title":"Complex Syst."},{"issue":"4","key":"ref63","first-page":"30","article-title":"A combined genetic adaptive search (GeneAS) for engineering design","volume":"26","author":"Deb","year":"1996","journal-title":"Comput. Sci. Inf."},{"key":"ref64","doi-asserted-by":"publisher","DOI":"10.1109\/MHS.1995.494215"},{"key":"ref65","doi-asserted-by":"publisher","DOI":"10.1162\/106365600568202"},{"key":"ref66","doi-asserted-by":"publisher","DOI":"10.1007\/1-84628-137-7_6"},{"key":"ref67","doi-asserted-by":"publisher","DOI":"10.1007\/s10710-005-6164-x"},{"key":"ref68","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2020.3013290"},{"key":"ref69","doi-asserted-by":"publisher","DOI":"10.1109\/mci.2017.2742868"},{"key":"ref70","doi-asserted-by":"publisher","DOI":"10.1109\/tevc.2020.3004012"},{"key":"ref71","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2019.105896"}],"container-title":["IEEE\/CAA Journal of Automatica Sinica"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/6570654\/9889133\/09889139.pdf?arnumber=9889139","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,1,24]],"date-time":"2024-01-24T02:32:57Z","timestamp":1706063577000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9889139\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,10]]},"references-count":71,"journal-issue":{"issue":"10"},"URL":"https:\/\/doi.org\/10.1109\/jas.2022.105875","relation":{},"ISSN":["2329-9266","2329-9274"],"issn-type":[{"type":"print","value":"2329-9266"},{"type":"electronic","value":"2329-9274"}],"subject":[],"published":{"date-parts":[[2022,10]]}}}