{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T11:45:01Z","timestamp":1740138301991,"version":"3.37.3"},"reference-count":13,"publisher":"Informa UK Limited","issue":"5","funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["11971089","11571059","11731013"],"award-info":[{"award-number":["11971089","11571059","11731013"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["www.tandfonline.com"],"crossmark-restriction":true},"short-container-title":["Optimization Methods and Software"],"published-print":{"date-parts":[[2020,9,2]]},"DOI":"10.1080\/10556788.2020.1738435","type":"journal-article","created":{"date-parts":[[2020,3,10]],"date-time":"2020-03-10T07:24:17Z","timestamp":1583825057000},"page":"1022-1049","update-policy":"https:\/\/2.zoppoz.workers.dev:443\/https\/doi.org\/10.1080\/tandf_crossmark_01","source":"Crossref","is-referenced-by-count":1,"title":["The rate of convergence of proximal method of multipliers for nonlinear programming"],"prefix":"10.1080","volume":"35","author":[{"given":"Yule","family":"Zhang","sequence":"first","affiliation":[{"name":"School of Mathematical Sciences, Dalian University of Technology, Dalian, People's Republic of China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jia","family":"Wu","sequence":"additional","affiliation":[{"name":"School of Mathematical Sciences, Dalian University of Technology, Dalian, People's Republic of China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Liwei","family":"Zhang","sequence":"additional","affiliation":[{"name":"School of Mathematical Sciences, Dalian University of Technology, Dalian, People's Republic of China"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"301","published-online":{"date-parts":[[2020,3,10]]},"reference":[{"volume-title":"Constrained Optimization and Lagrange Multiplier Methods","year":"1982","author":"Bertsekas D.P.","key":"CIT0001"},{"key":"CIT0002","doi-asserted-by":"publisher","DOI":"10.1137\/0728030"},{"key":"CIT0003","doi-asserted-by":"publisher","DOI":"10.1007\/BF00940582"},{"key":"CIT0004","doi-asserted-by":"publisher","DOI":"10.2307\/1907852"},{"key":"CIT0005","doi-asserted-by":"publisher","DOI":"10.1007\/BF00927673"},{"key":"CIT0006","doi-asserted-by":"publisher","DOI":"10.1007\/BF01585750"},{"key":"CIT0007","doi-asserted-by":"publisher","DOI":"10.1023\/A:1019200322441"},{"key":"CIT0008","unstructured":"M.J.D. Powell, A method for nonlinear constraints in minimization problems, in Optimization, R. Fletcher, ed., Academic Press, New York, 1972, pp. 283\u2013298."},{"key":"CIT0009","doi-asserted-by":"publisher","DOI":"10.1007\/BF01580138"},{"key":"CIT0010","doi-asserted-by":"publisher","DOI":"10.1007\/BF00934777"},{"key":"CIT0011","doi-asserted-by":"publisher","DOI":"10.1287\/moor.1.2.97"},{"key":"CIT0012","doi-asserted-by":"publisher","DOI":"10.1137\/0314056"},{"key":"CIT0013","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-007-0105-9"}],"container-title":["Optimization Methods and Software"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/www.tandfonline.com\/doi\/pdf\/10.1080\/10556788.2020.1738435","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,2]],"date-time":"2021-05-02T07:42:42Z","timestamp":1619941362000},"score":1,"resource":{"primary":{"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/www.tandfonline.com\/doi\/full\/10.1080\/10556788.2020.1738435"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,3,10]]},"references-count":13,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2020,9,2]]}},"alternative-id":["10.1080\/10556788.2020.1738435"],"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/doi.org\/10.1080\/10556788.2020.1738435","relation":{},"ISSN":["1055-6788","1029-4937"],"issn-type":[{"type":"print","value":"1055-6788"},{"type":"electronic","value":"1029-4937"}],"subject":[],"published":{"date-parts":[[2020,3,10]]},"assertion":[{"value":"The publishing and review policy for this title is described in its Aims & Scope.","order":1,"name":"peerreview_statement","label":"Peer Review Statement"},{"value":"https:\/\/2.zoppoz.workers.dev:443\/http\/www.tandfonline.com\/action\/journalInformation?show=aimsScope&journalCode=goms20","URL":"https:\/\/2.zoppoz.workers.dev:443\/http\/www.tandfonline.com\/action\/journalInformation?show=aimsScope&journalCode=goms20","order":2,"name":"aims_and_scope_url","label":"Aim & Scope"},{"value":"2019-04-23","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2020-03-01","order":2,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2020-03-10","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}