{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,5]],"date-time":"2026-06-05T16:43:26Z","timestamp":1780677806795,"version":"3.54.1"},"reference-count":29,"publisher":"Informa UK Limited","issue":"4","funder":[{"DOI":"10.13039\/501100003593","name":"National Council for Scientific and Technological Development","doi-asserted-by":"publisher","award":["312777\/2020-5"],"award-info":[{"award-number":["312777\/2020-5"]}],"id":[{"id":"10.13039\/501100003593","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":[[2023,7,4]]},"DOI":"10.1080\/10556788.2023.2189711","type":"journal-article","created":{"date-parts":[[2023,3,28]],"date-time":"2023-03-28T10:56:12Z","timestamp":1680000972000},"page":"781-803","update-policy":"https:\/\/doi.org\/10.1080\/tandf_crossmark_01","source":"Crossref","is-referenced-by-count":2,"title":["Worst-case evaluation complexity of a quadratic penalty method for nonconvex optimization"],"prefix":"10.1080","volume":"38","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-3284-3371","authenticated-orcid":false,"given":"Geovani Nunes","family":"Grapiglia","sequence":"first","affiliation":[{"name":"ICTEAM\/INMA, Universit\u00e9 catholique de Louvain, Louvain-la-Neuve, Belgium"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"301","published-online":{"date-parts":[[2023,3,28]]},"reference":[{"key":"CIT0001","doi-asserted-by":"publisher","DOI":"10.1137\/15M1031631"},{"key":"CIT0002","doi-asserted-by":"publisher","DOI":"10.1137\/17M1127107"},{"key":"CIT0003","volume-title":"On the Complexity of An Inexact Restoration Method for Constrained Optimization","author":"Bueno L.F.","year":"2018"},{"key":"CIT0004","doi-asserted-by":"publisher","DOI":"10.1002\/sapm1962411291"},{"key":"CIT0005","first-page":"548","volume":"3","author":"Camp G.D.","year":"1955","journal-title":"J.\u00a0Oper. Res. Soc. Am."},{"key":"CIT0006","doi-asserted-by":"publisher","DOI":"10.1137\/11082381X"},{"key":"CIT0007","doi-asserted-by":"publisher","DOI":"10.1093\/imanum\/drr035"},{"key":"CIT0008","doi-asserted-by":"publisher","DOI":"10.1137\/120869687"},{"key":"CIT0009","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-012-0617-9"},{"key":"CIT0010","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-016-1016-4"},{"key":"CIT0011","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-12767-1_2"},{"key":"CIT0012","doi-asserted-by":"publisher","DOI":"10.1090\/S0002-9904-1943-07818-4"},{"key":"CIT0013","doi-asserted-by":"publisher","DOI":"10.1137\/16M1108650"},{"key":"CIT0014","doi-asserted-by":"publisher","DOI":"10.1287\/moor.2020.1079"},{"key":"CIT0015","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-72040-7_5"},{"key":"CIT0016","volume-title":"Nonlinear Programming: Sequential Unconstrained Minimization Techniques","author":"Fiacco A.V.","year":"1968"},{"key":"CIT0017","doi-asserted-by":"publisher","DOI":"10.1080\/10556788.2020.1818082"},{"key":"CIT0018","doi-asserted-by":"publisher","DOI":"10.1007\/s10589-017-9928-3"},{"key":"CIT0019","doi-asserted-by":"publisher","DOI":"10.1093\/imanum\/draa021"},{"key":"CIT0020","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-018-1290-4"},{"key":"CIT0021","doi-asserted-by":"publisher","DOI":"10.1137\/18M1171011"},{"key":"CIT0022","unstructured":"Z. Li, P-Y. Chen, S. Liu, S. Lu, and Y. Xu, Rate-improved inexact augmented Lagrangian method for constrained nonconvex optimization, in Proceedings of The 24th International Conference on Artificial Intelligence and Statistics, PMLR; 130, 2021, pp.\u00a02170\u20132178."},{"key":"CIT0023","unstructured":"Z. Li and Y. Xu, Augmented Lagrangian based first-order methods for convex-constrained programs with weakly-convex objective, (2020). Available at arXiv: 2003.08880 [math.OC]."},{"key":"CIT0024","unstructured":"Q. Lin, R. Ma, and Y. Xu, Inexact proximal-point methods for constrained nonconvex optimization, (2020). Available at arXiv: 1908.11518v4 [math.OC]."},{"key":"CIT0025","doi-asserted-by":"publisher","DOI":"10.1137\/17M1115472"},{"key":"CIT0026","unstructured":"J.G. Melo, R.D.C. Monteiro, and H. Wang, Iteration-complexity of an inexact proximal point accelerated augmented Lagrangian method for solving linearly constrained smooth nonconvex composite problems, (2020). Available at arXiv: 2006.08048 [math.OC]."},{"key":"CIT0027","doi-asserted-by":"publisher","DOI":"10.1007\/b98874"},{"issue":"1","key":"CIT0028","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/s10915-020-01359-x","volume":"86","author":"Xie Y.","year":"2021","journal-title":"J.\u00a0Sci. Comput."},{"key":"CIT0029","doi-asserted-by":"publisher","DOI":"10.1287\/mnsc.13.5.344"}],"container-title":["Optimization Methods and Software"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.tandfonline.com\/doi\/pdf\/10.1080\/10556788.2023.2189711","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,7,18]],"date-time":"2023-07-18T12:33:44Z","timestamp":1689683624000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.tandfonline.com\/doi\/full\/10.1080\/10556788.2023.2189711"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,3,28]]},"references-count":29,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2023,7,4]]}},"alternative-id":["10.1080\/10556788.2023.2189711"],"URL":"https:\/\/doi.org\/10.1080\/10556788.2023.2189711","relation":{},"ISSN":["1055-6788","1029-4937"],"issn-type":[{"value":"1055-6788","type":"print"},{"value":"1029-4937","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,3,28]]},"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":"http:\/\/www.tandfonline.com\/action\/journalInformation?show=aimsScope&journalCode=goms20","URL":"http:\/\/www.tandfonline.com\/action\/journalInformation?show=aimsScope&journalCode=goms20","order":2,"name":"aims_and_scope_url","label":"Aim & Scope"},{"value":"2021-08-10","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2023-03-04","order":2,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2023-03-28","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}