{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,23]],"date-time":"2026-01-23T16:23:37Z","timestamp":1769185417837,"version":"3.49.0"},"reference-count":82,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2022,3,3]],"date-time":"2022-03-03T00:00:00Z","timestamp":1646265600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,3,3]],"date-time":"2022-03-03T00:00:00Z","timestamp":1646265600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["DMS-2053493"],"award-info":[{"award-number":["DMS-2053493"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Comput Optim Appl"],"published-print":{"date-parts":[[2022,5]]},"DOI":"10.1007\/s10589-022-00358-y","type":"journal-article","created":{"date-parts":[[2022,3,3]],"date-time":"2022-03-03T18:02:30Z","timestamp":1646330550000},"page":"175-224","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":28,"title":["Complexity of an inexact proximal-point penalty method for constrained smooth non-convex optimization"],"prefix":"10.1007","volume":"82","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-2943-3267","authenticated-orcid":false,"given":"Qihang","family":"Lin","sequence":"first","affiliation":[]},{"given":"Runchao","family":"Ma","sequence":"additional","affiliation":[]},{"given":"Yangyang","family":"Xu","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,3,3]]},"reference":[{"key":"358_CR1","unstructured":"Allen-Zhu, Z.: Natasha: Faster non-convex stochastic optimization via strongly non-convex parameter. In: Proceedings of the 34th International Conference on Machine Learning (ICML), pp. 89\u201397 (2017)"},{"issue":"2","key":"358_CR2","doi-asserted-by":"publisher","first-page":"438","DOI":"10.1287\/moor.1100.0449","volume":"35","author":"H Attouch","year":"2010","unstructured":"Attouch, H., Bolte, J., Redont, P., Soubeyran, A.: Proximal alternating minimization and projection methods for nonconvex problems: an approach based on the Kurdyka-\u0142ojasiewicz inequality. Math. Oper. Res. 35(2), 438\u2013457 (2010)","journal-title":"Math. Oper. Res."},{"key":"358_CR3","unstructured":"Basu, K., Nandy, P.: Optimal convergence for stochastic optimization with multiple expectation constraints. arXiv preprint arXiv:1906.03401 (2019)"},{"key":"358_CR4","doi-asserted-by":"crossref","unstructured":"Bayandina, A., Dvurechensky, P., Gasnikov, A., Stonyakin, F., Titov, A.: Mirror descent and convex optimization problems with non-smooth inequality constraints. In: Large-Scale and Distributed Optimization, pp. 181\u2013213. Springer (2018)","DOI":"10.1007\/978-3-319-97478-1_8"},{"key":"358_CR5","unstructured":"Birgin, E., Mart\u00ednez, J.: Complexity and performance of an augmented Lagrangian algorithm. arXiv preprint arXiv:1907.02401 (2019)"},{"issue":"1","key":"358_CR6","doi-asserted-by":"publisher","first-page":"139","DOI":"10.1007\/s10107-009-0264-y","volume":"125","author":"EG Birgin","year":"2010","unstructured":"Birgin, E.G., Floudas, C.A., Mart\u00ednez, J.M.: Global minimization using an augmented Lagrangian method with variable lower-level constraints. Math. Program. 125(1), 139\u2013162 (2010)","journal-title":"Math. Program."},{"issue":"1","key":"358_CR7","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1007\/s10589-017-9937-2","volume":"69","author":"EG Birgin","year":"2018","unstructured":"Birgin, E.G., Haeser, G., Ramos, A.: Augmented Lagrangians with constrained subproblems and convergence to second-order stationary points. Comput. Optim. Appl. 69(1), 51\u201375 (2018)","journal-title":"Comput. Optim. Appl."},{"key":"358_CR8","unstructured":"Boob, D., Deng, Q., Lan, G.: Proximal point methods for optimization with nonconvex functional constraints. arXiv preprint arXiv:1908.02734 (2019)"},{"issue":"4","key":"358_CR9","doi-asserted-by":"publisher","first-page":"968","DOI":"10.1137\/0329054","volume":"29","author":"JV Burke","year":"1991","unstructured":"Burke, J.V.: An exact penalization viewpoint of constrained optimization. SIAM J. Control Optim. 29(4), 968\u2013998 (1991)","journal-title":"SIAM J. Control Optim."},{"issue":"2","key":"358_CR10","doi-asserted-by":"publisher","first-page":"471","DOI":"10.1137\/S1052623403426532","volume":"16","author":"RH Byrd","year":"2005","unstructured":"Byrd, R.H., Gould, N.I., Nocedal, J., Waltz, R.A.: On the convergence of successive linear-quadratic programming algorithms. SIAM J. Optim. 16(2), 471\u2013489 (2005)","journal-title":"SIAM J. Optim."},{"issue":"4","key":"358_CR11","doi-asserted-by":"publisher","first-page":"1721","DOI":"10.1137\/11082381X","volume":"21","author":"C Cartis","year":"2011","unstructured":"Cartis, C., Gould, N.I., Toint, P.L.: On the evaluation complexity of composite function minimization with applications to nonconvex nonlinear programming. SIAM J. Optim. 21(4), 1721\u20131739 (2011)","journal-title":"SIAM J. Optim."},{"issue":"1\u20132","key":"358_CR12","doi-asserted-by":"publisher","first-page":"93","DOI":"10.1007\/s10107-012-0617-9","volume":"144","author":"C Cartis","year":"2014","unstructured":"Cartis, C., Gould, N.I., Toint, P.L.: On the complexity of finding first-order critical points in constrained nonlinear optimization. Math. Program. 144(1\u20132), 93\u2013106 (2014)","journal-title":"Math. Program."},{"issue":"1\u20132","key":"358_CR13","doi-asserted-by":"publisher","first-page":"611","DOI":"10.1007\/s10107-016-1016-4","volume":"161","author":"C Cartis","year":"2017","unstructured":"Cartis, C., Gould, N.I., Toint, P.L.: Corrigendum: on the complexity of finding first-order critical points in constrained nonlinear optimization. Math. Program. 161(1\u20132), 611\u2013626 (2017)","journal-title":"Math. Program."},{"issue":"2\u20133","key":"358_CR14","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1023\/A:1013637720281","volume":"47","author":"K Crammer","year":"2002","unstructured":"Crammer, K., Singer, Y.: On the learnability and design of output codes for multiclass problems. Mach. Learn. 47(2\u20133), 201\u2013233 (2002)","journal-title":"Mach. Learn."},{"issue":"1","key":"358_CR15","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1080\/10556788.2015.1071813","volume":"31","author":"FE Curtis","year":"2016","unstructured":"Curtis, F.E., Gould, N.I., Jiang, H., Robinson, D.P.: Adaptive augmented Lagrangian methods: algorithms and practical numerical experience. Optim. Methods Softw. 31(1), 157\u2013186 (2016)","journal-title":"Optim. Methods Softw."},{"key":"358_CR16","doi-asserted-by":"crossref","unstructured":"Davis, D., Drusvyatskiy, D.: Stochastic model-based minimization of weakly convex functions. arXiv preprint arXiv:1803.06523 (2018)","DOI":"10.1137\/18M1178244"},{"key":"358_CR17","doi-asserted-by":"crossref","unstructured":"Davis, D., Drusvyatskiy, D.: Stochastic subgradient method converges at the rate $$o (k^{-1\/4})$$ on weakly convex functions. arXiv preprint arXiv:1802.02988 (2018)","DOI":"10.1007\/s10208-018-09409-5"},{"key":"358_CR18","unstructured":"Davis, D., Grimmer, B.: Proximally guided stochastic subgradient method for nonsmooth, nonconvex problems. arXiv preprint arXiv:1707.03505 (2017)"},{"issue":"1","key":"358_CR19","doi-asserted-by":"publisher","first-page":"72","DOI":"10.1137\/0323007","volume":"23","author":"G Di Pillo","year":"1985","unstructured":"Di Pillo, G., Grippo, L.: A continuously differentiable exact penalty function for nonlinear programming problems with inequality constraints. SIAM J. Control Optim. 23(1), 72\u201384 (1985)","journal-title":"SIAM J. Control Optim."},{"issue":"1","key":"358_CR20","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/BF02591986","volume":"36","author":"G Di Pillo","year":"1986","unstructured":"Di Pillo, G., Grippo, L.: An exact penalty function method with global convergence properties for nonlinear programming problems. Math. Program. 36(1), 1\u201318 (1986)","journal-title":"Math. Program."},{"key":"358_CR21","doi-asserted-by":"crossref","unstructured":"Drusvyatskiy, D., Paquette, C.: Efficiency of minimizing compositions of convex functions and smooth maps. Math. Program. (2018)","DOI":"10.1007\/s10107-018-1311-3"},{"issue":"2","key":"358_CR22","doi-asserted-by":"publisher","first-page":"384","DOI":"10.1137\/10081085X","volume":"22","author":"D Fern\u00e1ndez","year":"2012","unstructured":"Fern\u00e1ndez, D., Solodov, M.V.: Local convergence of exact and inexact augmented Lagrangian methods under the second-order sufficient optimality condition. SIAM J. Optim. 22(2), 384\u2013407 (2012)","journal-title":"SIAM J. Optim."},{"key":"358_CR23","doi-asserted-by":"crossref","unstructured":"Fletcher, R.: Penalty functions. In: Mathematical Programming The State of the Art, pp. 87\u2013114. Springer (1983)","DOI":"10.1007\/978-3-642-68874-4_5"},{"issue":"3","key":"358_CR24","doi-asserted-by":"publisher","first-page":"863","DOI":"10.1137\/S1052623402419789","volume":"15","author":"MP Friedlander","year":"2005","unstructured":"Friedlander, M.P., Saunders, M.A.: A globally convergent linearly constrained Lagrangian method for nonlinear optimization. SIAM J. Optim. 15(3), 863\u2013897 (2005)","journal-title":"SIAM J. Optim."},{"issue":"4","key":"358_CR25","doi-asserted-by":"publisher","first-page":"2341","DOI":"10.1137\/120880811","volume":"23","author":"S Ghadimi","year":"2013","unstructured":"Ghadimi, S., Lan, G.: Stochastic first- and zeroth-order methods for nonconvex stochastic programming. SIAM J. Optim. 23(4), 2341\u20132368 (2013). https:\/\/doi.org\/10.1137\/120880811","journal-title":"SIAM J. Optim."},{"issue":"1\u20132","key":"358_CR26","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1007\/s10107-015-0871-8","volume":"156","author":"S Ghadimi","year":"2016","unstructured":"Ghadimi, S., Lan, G.: Accelerated gradient methods for nonconvex nonlinear and stochastic programming. Math. Program. 156(1\u20132), 59\u201399 (2016). https:\/\/doi.org\/10.1007\/s10107-015-0871-8","journal-title":"Math. Program."},{"key":"358_CR27","unstructured":"Gon\u00e7alves, M.L., Melo, J.G., Monteiro, R.D.: Convergence rate bounds for a proximal admm with over-relaxation stepsize parameter for solving nonconvex linearly constrained problems. arXiv preprint arXiv:1702.01850 (2017)"},{"issue":"1","key":"358_CR28","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1137\/0726007","volume":"26","author":"NIM Gould","year":"1989","unstructured":"Gould, N.I.M.: On the convergence of a sequential penalty function method for constrained minimization. SIAM J. Numer. Anal. 26(1), 107\u2013128 (1989)","journal-title":"SIAM J. Numer. Anal."},{"key":"358_CR29","unstructured":"Grapiglia, G.N., Yuan, Y.x.: On the complexity of an augmented Lagrangian method for nonconvex optimization. arXiv preprint arXiv:1906.05622 (2019)"},{"issue":"1\u20132","key":"358_CR30","doi-asserted-by":"publisher","first-page":"263","DOI":"10.1007\/s10107-018-1290-4","volume":"178","author":"G Haeser","year":"2019","unstructured":"Haeser, G., Liu, H., Ye, Y.: Optimality condition and complexity analysis for linearly-constrained optimization without differentiability on the boundary. Math. Program. 178(1\u20132), 263\u2013299 (2019)","journal-title":"Math. Program."},{"issue":"1\u20132","key":"358_CR31","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1007\/s10107-019-01365-4","volume":"176","author":"D Hajinezhad","year":"2019","unstructured":"Hajinezhad, D., Hong, M.: Perturbed proximal primal-dual algorithm for nonconvex nonsmooth optimization. Math. Program. 176(1\u20132), 207\u2013245 (2019)","journal-title":"Math. Program."},{"key":"358_CR32","unstructured":"Hong, M.: Decomposing linearly constrained nonconvex problems by a proximal primal dual approach: algorithms, convergence, and applications. arXiv preprint arXiv:1604.00543 (2016)"},{"key":"358_CR33","unstructured":"Hong, M., Lee, J.D., Razaviyayn, M.: Gradient primal-dual algorithm converges to second-order stationary solutions for nonconvex distributed optimization. arXiv preprint arXiv:1802.08941 (2018)"},{"issue":"1","key":"358_CR34","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1007\/s10589-018-0034-y","volume":"72","author":"B Jiang","year":"2019","unstructured":"Jiang, B., Lin, T., Ma, S., Zhang, S.: Structured nonconvex and nonsmooth optimization: algorithms and iteration complexity analysis. Comput. Optim. Appl. 72(1), 115\u2013157 (2019)","journal-title":"Comput. Optim. Appl."},{"key":"358_CR35","unstructured":"Jiang, B., Meng, X., Wen, Z., Chen, X.: An exact penalty approach for optimization with nonnegative orthogonality constraints. arXiv preprint arXiv:1907.12424 (2019)"},{"issue":"4","key":"358_CR36","doi-asserted-by":"publisher","first-page":"2566","DOI":"10.1137\/18M1171011","volume":"29","author":"W Kong","year":"2019","unstructured":"Kong, W., Melo, J.G., Monteiro, R.D.: Complexity of a quadratic penalty accelerated inexact proximal point method for solving linearly constrained nonconvex composite programs. SIAM J. Optim. 29(4), 2566\u20132593 (2019)","journal-title":"SIAM J. Optim."},{"key":"358_CR37","unstructured":"Kong, W., Melo, J.G., Monteiro, R.D.: Iteration-complexity of a proximal augmented Lagrangian method for solving nonconvex composite optimization problems with nonlinear convex constraints. arXiv preprint arXiv:2008.07080 (2020)"},{"issue":"1\u20132","key":"358_CR38","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1007\/s10107-012-0588-x","volume":"138","author":"G Lan","year":"2013","unstructured":"Lan, G., Monteiro, R.D.: Iteration-complexity of first-order penalty methods for convex programming. Math. Program. 138(1\u20132), 115\u2013139 (2013)","journal-title":"Math. Program."},{"key":"358_CR39","unstructured":"Lan, G., Yang, Y.: Accelerated stochastic algorithms for nonconvex finite-sum and multi-block optimization. arXiv:1805.05411 (2018)"},{"key":"358_CR40","unstructured":"Lan, G., Zhou, Z.: Algorithms for stochastic optimization with expectation constraints. arXiv preprint arXiv:1604.03887 (2016)"},{"key":"358_CR41","unstructured":"Li, Z., Chen, P.Y., Liu, S., Lu, S., Xu, Y.: Rate-improved inexact augmented Lagrangian method for constrained nonconvex optimization. arXiv preprint arXiv:2007.01284 (2020)"},{"key":"358_CR42","unstructured":"Li, Z., Xu, Y.: Augmented Lagrangian based first-order methods for convex and nonconvex programs: nonergodic convergence and iteration complexity. arXiv preprint arXiv:2003.08880 (2020)"},{"key":"358_CR43","unstructured":"Lin, Q., Ma, R., Xu, Y.: Inexact proximal-point penalty methods for non-convex optimization with non-convex constraints. arXiv preprint arXiv:190811518v1 (2019)"},{"key":"358_CR44","unstructured":"Lin, Q., Ma, R., Yang, T.: Level-set methods for finite-sum constrained convex optimization. In: International Conference on Machine Learning, pp. 3118\u20133127 (2018)"},{"key":"358_CR45","doi-asserted-by":"crossref","unstructured":"Lin, Q., Xiao, L.: An adaptive accelerated proximal gradient method and its homotopy continuation for sparse optimization. Comput. Optim. Appl. 60(3) (2015)","DOI":"10.1007\/s10589-014-9694-4"},{"key":"358_CR46","unstructured":"Lu, S., Razaviyayn, M., Yang, B., Huang, K., Hong, M.: Snap: Finding approximate second-order stationary solutions efficiently for non-convex linearly constrained problems. arXiv preprint arXiv:1907.04450 (2019)"},{"key":"358_CR47","unstructured":"Ma, R., Lin, Q., Yang, T.: Proximally constrained methods for weakly convex optimization with weakly convex constraints. arXiv preprint arXiv:1908.01871 (2019)"},{"key":"358_CR48","unstructured":"Melo, J.G., Monteiro, R.D.: Iteration-complexity of a Jacobi-type non-euclidean ADMM for multi-block linearly constrained nonconvex programs. arXiv preprint arXiv:1705.07229 (2017)"},{"key":"358_CR49","unstructured":"Melo, J.G., Monteiro, R.D.: Iteration-complexity of an inner accelerated inexact proximal augmented Lagrangian method based on the classical Lagrangian function and a full Lagrange multiplier update. arXiv preprint arXiv:2008.00562 (2020)"},{"key":"358_CR50","unstructured":"Melo, J.G., Monteiro, R.D., Wang, H.: Iteration-complexity of an inexact proximal accelerated augmented Lagrangian method for solving linearly constrained smooth nonconvex composite optimization problems. arXiv preprint arXiv:2006.08048 (2020)"},{"issue":"2","key":"358_CR51","doi-asserted-by":"publisher","first-page":"305","DOI":"10.1080\/10556788.2017.1380642","volume":"34","author":"I Necoara","year":"2019","unstructured":"Necoara, I., Patrascu, A., Glineur, F.: Complexity of first-order inexact Lagrangian and penalty methods for conic convex programming. Optim. Methods Softw. 34(2), 305\u2013335 (2019)","journal-title":"Optim. Methods Softw."},{"key":"358_CR52","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4419-8853-9","volume-title":"Introductory lectures on convex optimization : a basic course","author":"Y Nesterov","year":"2004","unstructured":"Nesterov, Y.: Introductory lectures on convex optimization\u202f: a basic course. Kluwer Academic Publ, Dordrecht (2004)"},{"issue":"1","key":"358_CR53","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1007\/s10107-010-0421-3","volume":"127","author":"Y Nesterov","year":"2011","unstructured":"Nesterov, Y.: Barrier subgradient method. Math. Program. 127(1), 31\u201356 (2011)","journal-title":"Math. Program."},{"issue":"1","key":"358_CR54","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1007\/s10107-012-0629-5","volume":"140","author":"Y Nesterov","year":"2013","unstructured":"Nesterov, Y.: Gradient methods for minimizing composite functions. Math. Program. 140(1), 125\u2013161 (2013)","journal-title":"Math. Program."},{"key":"358_CR55","unstructured":"Nouiehed, M., Lee, J.D., Razaviyayn, M.: Convergence to second-order stationarity for constrained non-convex optimization. arXiv preprint arXiv:1810.02024 (2018)"},{"key":"358_CR56","doi-asserted-by":"crossref","unstructured":"O\u2019Neill, M., Wright, S.J.: A log-barrier newton-cg method for bound constrained optimization with complexity guarantees. arXiv preprint arXiv:1904.03563 (2019)","DOI":"10.1093\/imanum\/drz074"},{"issue":"3","key":"358_CR57","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1007\/BF01580880","volume":"35","author":"MJ Powell","year":"1986","unstructured":"Powell, M.J., Yuan, Y.: A recursive quadratic programming algorithm that uses differentiable exact penalty functions. Math. Program. 35(3), 265\u2013278 (1986)","journal-title":"Math. Program."},{"key":"358_CR58","unstructured":"Reddi, S.J., Hefny, A., Sra, S., P\u00f3cz\u00f3s, B., Smola, A.: Stochastic variance reduction for nonconvex optimization. In: Proceedings of the 33rd International Conference on International Conference on Machine Learning (ICML), pp. 314\u2013323. JMLR.org (2016)"},{"key":"358_CR59","doi-asserted-by":"publisher","DOI":"10.1515\/9781400873173","volume-title":"Convex Analysis","author":"R Rockafellar","year":"1970","unstructured":"Rockafellar, R.: Convex Analysis. Princeton University Press, Princeton Mathematical Series, Princeton (1970)"},{"key":"358_CR60","unstructured":"Sahin, M.F., eftekhari, A., Alacaoglu, A., Latorre, F., Cevher, V.: An inexact augmented Lagrangian framework for nonconvex optimization with nonlinear constraints. In: Advances in Neural Information Processing Systems (2019)"},{"issue":"1","key":"358_CR61","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s10589-018-0033-z","volume":"72","author":"Q Tran-Dinh","year":"2019","unstructured":"Tran-Dinh, Q.: Proximal alternating penalty algorithms for nonsmooth constrained convex optimization. Comput. Optim. Appl. 72(1), 1\u201343 (2019)","journal-title":"Comput. Optim. Appl."},{"key":"358_CR62","doi-asserted-by":"crossref","unstructured":"Tran-Dinh, Q., Cevher, V.: A primal-dual algorithmic framework for constrained convex minimization. arXiv preprint arXiv:1406.5403 (2014)","DOI":"10.1137\/130944539"},{"key":"358_CR63","unstructured":"Tran-Dinh, Q., Kyrillidis, A., Cevher, V.: Composite self-concordant minimization. arXiv preprint arXiv 1308 (2013)"},{"issue":"4","key":"358_CR64","doi-asserted-by":"publisher","first-page":"1718","DOI":"10.1137\/130944539","volume":"24","author":"Q Tran-Dinh","year":"2014","unstructured":"Tran-Dinh, Q., Kyrillidis, A., Cevher, V.: An inexact proximal path-following algorithm for constrained convex minimization. SIAM J. Optim. 24(4), 1718\u20131745 (2014)","journal-title":"SIAM J. Optim."},{"issue":"4","key":"358_CR65","doi-asserted-by":"publisher","first-page":"1326","DOI":"10.1287\/moor.2017.0907","volume":"43","author":"Q Tran-Dinh","year":"2018","unstructured":"Tran-Dinh, Q., Kyrillidis, A., Cevher, V.: A single-phase, proximal path-following framework. Math. Oper. Res. 43(4), 1326\u20131347 (2018)","journal-title":"Math. Oper. Res."},{"key":"358_CR66","unstructured":"Wang, F., Xu, Z., Xu, H.K.: Convergence of bregman alternating direction method with multipliers for nonconvex composite problems. arXiv preprint arXiv:1410.8625 (2014)"},{"key":"358_CR67","unstructured":"Wang, S., Chang, T.H., Cui, Y., Pang, J.S.: Clustering by orthogonal nmf model and non-convex penalty optimization. arXiv preprint arXiv:1906.00570 (2019)"},{"issue":"306","key":"358_CR68","doi-asserted-by":"publisher","first-page":"1793","DOI":"10.1090\/mcom\/3178","volume":"86","author":"X Wang","year":"2017","unstructured":"Wang, X., Ma, S., Yuan, Y.X.: Penalty methods with stochastic approximation for stochastic nonlinear programming. Math. Comput. 86(306), 1793\u20131820 (2017)","journal-title":"Math. Comput."},{"issue":"1","key":"358_CR69","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1007\/s10915-018-0757-z","volume":"78","author":"Y Wang","year":"2019","unstructured":"Wang, Y., Yin, W., Zeng, J.: Global convergence of Admm in nonconvex nonsmooth optimization. J. Sci. Comput. 78(1), 29\u201363 (2019)","journal-title":"J. Sci. Comput."},{"key":"358_CR70","unstructured":"Wei, X., Neely, M.J.: Primal-dual frank-wolfe for constrained stochastic programs with convex and non-convex objectives. arXiv preprint arXiv:1806.00709 (2018)"},{"key":"358_CR71","unstructured":"Wei, X., Yu, H., Ling, Q., Neely, M.: Solving non-smooth constrained programs with lower complexity than $${O}(1\/\\varepsilon )$$: a primal-dual homotopy smoothing approach. In: Advances in Neural Information Processing Systems, pp. 3995\u20134005 (2018)"},{"key":"358_CR72","unstructured":"Weston, J., Watkins, C.: Multi-class support vector machines. Tech. rep, Citeseer (1998)"},{"key":"358_CR73","unstructured":"Xie, Y., Wright, S.J.: Complexity of proximal augmented Lagrangian for nonconvex optimization with nonlinear equality constraints. arXiv preprint arXiv:1908.00131 (2019)"},{"key":"358_CR74","unstructured":"Xu, Y.: First-order methods for constrained convex programming based on linearized augmented Lagrangian function. arXiv preprint arXiv:1711.08020 (2017)"},{"key":"358_CR75","unstructured":"Xu, Y.: Primal-dual stochastic gradient method for convex programs with many functional constraints. arXiv preprint arXiv:1802.02724 (2018)"},{"key":"358_CR76","doi-asserted-by":"crossref","unstructured":"Xu, Y.: Iteration complexity of inexact augmented Lagrangian methods for constrained convex programming. Math. Program. Ser. A 1\u201346 (2019)","DOI":"10.1007\/s10107-019-01425-9"},{"key":"358_CR77","unstructured":"Yang, T., Lin, Q., Zhang, L.: A richer theory of convex constrained optimization with reduced projections and improved rates. In: Proceedings of the 34th International Conference on Machine Learning-vol. 70, pp. 3901\u20133910. JMLR. org (2017)"},{"key":"358_CR78","unstructured":"Yu, H., Neely, M., Wei, X.: Online convex optimization with stochastic constraints. In: Advances in Neural Information Processing Systems, pp. 1428\u20131438 (2017)"},{"issue":"2","key":"358_CR79","doi-asserted-by":"publisher","first-page":"759","DOI":"10.1137\/16M1059011","volume":"27","author":"H Yu","year":"2017","unstructured":"Yu, H., Neely, M.J.: A simple parallel algorithm with an $${O}(1\/t)$$ convergence rate for general convex programs. SIAM J. Optim. 27(2), 759\u2013783 (2017)","journal-title":"SIAM J. Optim."},{"key":"358_CR80","unstructured":"Zhang, J., Luo, Z.: A global dual error bound and its application to the analysis of linearly constrained nonconvex optimization. arXiv preprint arXiv:2006.16440 (2020)"},{"issue":"3","key":"358_CR81","doi-asserted-by":"publisher","first-page":"2272","DOI":"10.1137\/19M1242276","volume":"30","author":"J Zhang","year":"2020","unstructured":"Zhang, J., Luo, Z.Q.: A proximal alternating direction method of multiplier for linearly constrained nonconvex minimization. SIAM J. Optim. 30(3), 2272\u20132302 (2020)","journal-title":"SIAM J. Optim."},{"key":"358_CR82","unstructured":"Zhang, S., He, N.: On the convergence rate of stochastic mirror descent for nonsmooth nonconvex optimization. arXiv preprint arXiv:1806.04781 (2018)"}],"container-title":["Computational Optimization and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-022-00358-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10589-022-00358-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-022-00358-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,4,9]],"date-time":"2022-04-09T12:08:30Z","timestamp":1649506110000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10589-022-00358-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,3,3]]},"references-count":82,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2022,5]]}},"alternative-id":["358"],"URL":"https:\/\/doi.org\/10.1007\/s10589-022-00358-y","relation":{},"ISSN":["0926-6003","1573-2894"],"issn-type":[{"value":"0926-6003","type":"print"},{"value":"1573-2894","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,3,3]]},"assertion":[{"value":"30 November 2020","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"4 February 2022","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"3 March 2022","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}