{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,13]],"date-time":"2025-05-13T23:16:06Z","timestamp":1747178166234,"version":"3.40.5"},"reference-count":35,"publisher":"Informa UK Limited","issue":"1","content-domain":{"domain":["www.tandfonline.com"],"crossmark-restriction":true},"short-container-title":["Optimization Methods and Software"],"published-print":{"date-parts":[[2022,1,2]]},"DOI":"10.1080\/10556788.2020.1712601","type":"journal-article","created":{"date-parts":[[2020,1,15]],"date-time":"2020-01-15T10:19:02Z","timestamp":1579083542000},"page":"79-112","update-policy":"https:\/\/doi.org\/10.1080\/tandf_crossmark_01","source":"Crossref","is-referenced-by-count":1,"title":["An inexact first-order method for constrained nonlinear optimization"],"prefix":"10.1080","volume":"37","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-8821-7260","authenticated-orcid":false,"given":"Hao","family":"Wang","sequence":"first","affiliation":[{"name":"School of Information Science and Technology, ShanghaiTech University, Shanghai, People's Republic of China"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7639-8770","authenticated-orcid":false,"given":"Fan","family":"Zhang","sequence":"additional","affiliation":[{"name":"School of Information Science and Technology, ShanghaiTech University, Shanghai, People's Republic of China"},{"name":"Shanghai Institute of Microsystem and Information Technology, Chinese Academy of Sciences, Shanghai, People's Republic of China"},{"name":"University of Chinese Academy of Sciences, Beijing, People's Republic of China"}]},{"given":"Jiashan","family":"Wang","sequence":"additional","affiliation":[{"name":"Department of Mathematics, University of Washington, Seattle, WA, USA"}]},{"given":"Yuyang","family":"Rong","sequence":"additional","affiliation":[{"name":"School of Information Science and Technology, ShanghaiTech University, Shanghai, People's Republic of China"}]}],"member":"301","published-online":{"date-parts":[[2020,1,15]]},"reference":[{"key":"CIT0001","doi-asserted-by":"publisher","DOI":"10.1515\/9781400830244"},{"key":"CIT0002","doi-asserted-by":"publisher","DOI":"10.1137\/15M1008488"},{"key":"CIT0003","doi-asserted-by":"publisher","DOI":"10.1287\/mnsc.31.3.264"},{"key":"CIT0004","doi-asserted-by":"publisher","DOI":"10.1016\/S0167-6377(02)00231-6"},{"key":"CIT0005","doi-asserted-by":"publisher","DOI":"10.1137\/080716542"},{"key":"CIT0006","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611973365"},{"key":"CIT0007","doi-asserted-by":"crossref","unstructured":"L. Bottou, Stochastic learning, in Advanced lectures on machine learning, Springer, 2004, pp. 146\u2013168.","DOI":"10.1007\/978-3-540-28650-9_7"},{"key":"CIT0008","doi-asserted-by":"crossref","unstructured":"L. Bottou, Large-scale machine learning with stochastic gradient descent, in Proceedings of COMPSTAT'2010, Springer, 2010, pp. 177\u2013186.","DOI":"10.1007\/978-3-7908-2604-3_16"},{"key":"CIT0009","doi-asserted-by":"crossref","unstructured":"L. Bottou, Stochastic gradient descent tricks, in Neural networks: Tricks of the trade, Springer, 2012, pp. 421\u2013436.","DOI":"10.1007\/978-3-642-35289-8_25"},{"key":"CIT0010","doi-asserted-by":"publisher","DOI":"10.1016\/0022-247X(89)90111-X"},{"key":"CIT0011","doi-asserted-by":"publisher","DOI":"10.1137\/120880045"},{"key":"CIT0012","unstructured":"J.V. Burke, F.E. Curtis, H. Wang, and J. Wang, A dynamic penalty parameter updating strategy for matrix-free sequential quadratic optimization, Preprint (2018). Available at arXiv:1803.09224."},{"key":"CIT0013","doi-asserted-by":"publisher","DOI":"10.1137\/060674004"},{"key":"CIT0014","doi-asserted-by":"publisher","DOI":"10.1137\/080738222"},{"key":"CIT0015","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-003-0485-4"},{"key":"CIT0016","doi-asserted-by":"publisher","DOI":"10.1080\/10556780701394169"},{"key":"CIT0017","doi-asserted-by":"publisher","DOI":"10.1090\/S0002-9947-1975-0367131-6"},{"key":"CIT0018","doi-asserted-by":"publisher","DOI":"10.1002\/cpa.20042"},{"key":"CIT0019","first-page":"2121","volume":"12","author":"Duchi J.","year":"2011","journal-title":"J. Mach. Learn. Res."},{"volume-title":"Practical methods of optimization","year":"2013","author":"Fletcher R.","key":"CIT0020"},{"key":"CIT0021","doi-asserted-by":"publisher","DOI":"10.1007\/BF01582292"},{"key":"CIT0022","doi-asserted-by":"publisher","DOI":"10.1007\/s10589-014-9687-3"},{"key":"CIT0023","doi-asserted-by":"publisher","DOI":"10.1007\/BF00932858"},{"key":"CIT0024","doi-asserted-by":"publisher","DOI":"10.1007\/BF01588250"},{"key":"CIT0025","doi-asserted-by":"publisher","DOI":"10.1007\/BF00934594"},{"key":"CIT0026","unstructured":"R. Johnson and T. Zhang, Accelerating stochastic gradient descent using predictive variance reduction, in Advances in neural information processing systems. 2013, pp. 315\u2013323."},{"key":"CIT0027","doi-asserted-by":"publisher","DOI":"10.1287\/10-SSY011"},{"key":"CIT0028","doi-asserted-by":"crossref","unstructured":"W. Karush, Minima of functions of several variables with inequalities as side conditions, in Traces and Emergence of Nonlinear Programming, Springer, 2014, pp. 217\u2013245.","DOI":"10.1007\/978-3-0348-0439-4_10"},{"key":"CIT0029","doi-asserted-by":"crossref","unstructured":"H.W. Kuhn and A.W. Tucker, Nonlinear programming, in Traces and emergence of nonlinear programming, Springer, 2014, pp. 247\u2013258.","DOI":"10.1007\/978-3-0348-0439-4_11"},{"key":"CIT0030","doi-asserted-by":"publisher","DOI":"10.1145\/1111246.1111247"},{"key":"CIT0031","doi-asserted-by":"publisher","DOI":"10.1137\/110839072"},{"key":"CIT0032","doi-asserted-by":"publisher","DOI":"10.1137\/050626776"},{"key":"CIT0033","doi-asserted-by":"crossref","unstructured":"B.N. Pshenichnyj, The linearization method for constrained optimization, Springer Series in Computational Mathematics (English summary) Translated from the 1983 Russian original by Stephen S. Wilson., Vol. 22, Springer-Verlag, 1994.","DOI":"10.1007\/978-3-642-57918-9"},{"key":"CIT0034","doi-asserted-by":"publisher","DOI":"10.1007\/978-94-015-8390-9"},{"key":"CIT0035","doi-asserted-by":"publisher","DOI":"10.1137\/140961791"}],"container-title":["Optimization Methods and Software"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.tandfonline.com\/doi\/pdf\/10.1080\/10556788.2020.1712601","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,9,23]],"date-time":"2022-09-23T11:50:38Z","timestamp":1663933838000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.tandfonline.com\/doi\/full\/10.1080\/10556788.2020.1712601"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,1,15]]},"references-count":35,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2022,1,2]]}},"alternative-id":["10.1080\/10556788.2020.1712601"],"URL":"https:\/\/doi.org\/10.1080\/10556788.2020.1712601","relation":{},"ISSN":["1055-6788","1029-4937"],"issn-type":[{"type":"print","value":"1055-6788"},{"type":"electronic","value":"1029-4937"}],"subject":[],"published":{"date-parts":[[2020,1,15]]},"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":"2019-05-22","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2019-12-21","order":2,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2020-01-15","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}