{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T08:30:10Z","timestamp":1750235410893,"version":"3.37.3"},"reference-count":30,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2022,6,21]],"date-time":"2022-06-21T00:00:00Z","timestamp":1655769600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2022,6,21]],"date-time":"2022-06-21T00:00:00Z","timestamp":1655769600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["11731013","11971089"],"award-info":[{"award-number":["11731013","11971089"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["11871135"],"award-info":[{"award-number":["11871135"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Glob Optim"],"published-print":{"date-parts":[[2023,1]]},"DOI":"10.1007\/s10898-022-01196-2","type":"journal-article","created":{"date-parts":[[2022,6,21]],"date-time":"2022-06-21T03:29:27Z","timestamp":1655782167000},"page":"61-80","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Regrets of proximal method of multipliers for online non-convex optimization with long term constraints"],"prefix":"10.1007","volume":"85","author":[{"given":"Liwei","family":"Zhang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Haoyang","family":"Liu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6778-7085","authenticated-orcid":false,"given":"Xiantao","family":"Xiao","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,6,21]]},"reference":[{"key":"1196_CR1","unstructured":"M\u00e1rquez-Neila, P., Salzmann, M., Fua, P.: Imposing Hard Constraints on Deep Networks: Promises and Limitations (2017). arXiv:abs\/1706.02025"},{"key":"1196_CR2","unstructured":"Nandwani, Y., Pathak, A., Mausam, Singla, P.: A primal dual formulation for deep learning with constraints. In: Advances in Neural Information Processing Systems 32, pp. 12157\u201312168 (2019)"},{"issue":"172","key":"1196_CR3","first-page":"1","volume":"20","author":"A Cotter","year":"2019","unstructured":"Cotter, A., Jiang, H., Gupta, M., Wang, S., Narayan, T., You, S., Sridharan, K.: Optimization with non-differentiable constraints with applications to fairness, recall, churn, and other goals. Journal of Machine Learning Research 20(172), 1\u201359 (2019)","journal-title":"Journal of Machine Learning Research"},{"key":"1196_CR4","unstructured":"Szegedy, C., Zaremba, W., Sutskever, I., Bruna Estrach, J., Erhan, D., Goodfellow, I., Fergus, R.: Intriguing Properties of Neural Networks. (2014). 2nd International Conference on Learning Representations (ICLR)"},{"key":"1196_CR5","unstructured":"Goodfellow, I., Pouget-Abadie, J., Mirza, M., Xu, B., Warde-Farley, D., Ozair, S., Courville, A., Bengio, Y.: Generative adversarial nets. In: Ghahramani, Z., Welling, M., Cortes, C., Lawrence, N.D., Weinberger, K.Q. (eds.) Advances in Neural Information Processing Systems 27, pp. 2672\u20132680 (2014)"},{"issue":"3","key":"1196_CR6","doi-asserted-by":"publisher","first-page":"291","DOI":"10.1016\/j.jcss.2004.10.016","volume":"71","author":"A Kalai","year":"2005","unstructured":"Kalai, A., Vempala, S.: Efficient algorithms for online decision problems. J. Comput. System Sci. 71(3), 291\u2013307 (2005)","journal-title":"J. Comput. System Sci."},{"key":"1196_CR7","unstructured":"Shalev-Shwartz, S.: Online learning: Theory, algorithms, and applications. PhD thesis, The Hebrew University (2007)"},{"issue":"2","key":"1196_CR8","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1007\/s10994-007-5014-x","volume":"69","author":"S Shalev-Shwartz","year":"2007","unstructured":"Shalev-Shwartz, S., Singer, Y.: A primal-dual perspective of online learning algorithms. Mach. Learn. 69(2), 115\u2013142 (2007)","journal-title":"Mach. Learn."},{"issue":"1","key":"1196_CR9","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1006\/inco.1996.2612","volume":"132","author":"J Kivinen","year":"1997","unstructured":"Kivinen, J., Warmuth, M.K.: Exponentiated gradient versus gradient descent for linear predictors. Inform. and Comput. 132(1), 1\u201363 (1997)","journal-title":"Inform. and Comput."},{"issue":"6","key":"1196_CR10","doi-asserted-by":"publisher","first-page":"386","DOI":"10.1037\/h0042519","volume":"65","author":"F Rosenblatt","year":"1958","unstructured":"Rosenblatt, F.: The perceptron: A probabilistic model for information storage and organization in the brain. Psychol. Rev. 65(6), 386\u2013408 (1958)","journal-title":"Psychol. Rev."},{"issue":"4","key":"1196_CR11","doi-asserted-by":"publisher","first-page":"285","DOI":"10.1007\/BF00116827","volume":"2","author":"N Littlestone","year":"1988","unstructured":"Littlestone, N.: Learning quickly when irrelevant attributes abound: A new linear-threshold algorithm. Mach. Learn. 2(4), 285\u2013318 (1988)","journal-title":"Mach. Learn."},{"key":"1196_CR12","volume-title":"Foundations of Machine Learning. Adaptive Computation and Machine Learning","author":"M Mohri","year":"2012","unstructured":"Mohri, M., Rostamizadeh, A., Talwalkar, A.: Foundations of Machine Learning. Adaptive Computation and Machine Learning. MIT Press, Cambridge, MA (2012)"},{"key":"1196_CR13","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9781107298019","volume-title":"Understanding Machine Learning: From Theory to Algorithms","author":"S Shalev-Shwartz","year":"2014","unstructured":"Shalev-Shwartz, S., Ben-David, S.: Understanding Machine Learning: From Theory to Algorithms. Cambridge University Press, New York, NY (2014)"},{"key":"1196_CR14","doi-asserted-by":"crossref","unstructured":"Shalev-Shwartz, S.: Online learning and online convex optimization. Foundations and Trends\u00ae in Machine Learning 4(2), 107\u2013194 (2011)","DOI":"10.1561\/2200000018"},{"key":"1196_CR15","doi-asserted-by":"crossref","unstructured":"Hazan, E.: Introduction to online convex optimization. Foundations and Trends\u00ae in Optimization 2(3\u20134), 157\u2013325 (2015)","DOI":"10.1561\/2400000013"},{"issue":"2","key":"1196_CR16","doi-asserted-by":"publisher","first-page":"368","DOI":"10.1109\/TPAMI.2010.109","volume":"33","author":"S Ertekin","year":"2011","unstructured":"Ertekin, S., Bottou, L., Giles, C.L.: Nonconvex online support vector machines. IEEE Trans. Pattern Anal. Mach. Intell. 33(2), 368\u2013381 (2011)","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"issue":"3","key":"1196_CR17","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/1961189.1961200","volume":"2","author":"G Gasso","year":"2011","unstructured":"Gasso, G., Pappaioannou, A., Spivak, M., Bottou, L.: Batch and online learning algorithms for nonconvex neyman-pearson classification. ACM Trans. Intell. Syst. Technol. 2(3), 1\u201319 (2011)","journal-title":"ACM Trans. Intell. Syst. Technol."},{"key":"1196_CR18","unstructured":"Gao, X., Li, X., Zhang, S.: Online learning with non-convex losses and non-stationary regret. In: Storkey, A., Perez-Cruz, F. (eds.) Proceedings of the Twenty-First International Conference on Artificial Intelligence and Statistics. Proceedings of Machine Learning Research, vol. 84, pp.235\u2013243. Playa Blanca, Lanzarote, Canary Islands (2018)"},{"key":"1196_CR19","unstructured":"Hazan, E., Singh, K., Zhang, C.: Efficient regret minimization in non-convex games. In: Precup, D., Teh, Y.W. (eds.) Proceedings of the 34th International Conference on Machine Learning. Proceedings of Machine Learning Research, vol. 70, pp. 1433\u20131441. International Convention Centre, Sydney, Australia (2017)"},{"issue":"4","key":"1196_CR20","doi-asserted-by":"publisher","first-page":"759","DOI":"10.1162\/neco_a_01266","volume":"32","author":"HA Le Thi","year":"2020","unstructured":"Le Thi, H.A., Ho, V.T.: Online learning based on online dca and application to online classification. Neural Comput. 32(4), 759\u2013793 (2020)","journal-title":"Neural Comput."},{"key":"1196_CR21","doi-asserted-by":"crossref","unstructured":"Yang, L., Deng, L., Hajiesmaili, M.H., Tan, C., Wong, W.S.: An optimal algorithm for online non-convex learning. In: Abstracts of the 2018 ACM International Conference on Measurement and Modeling of Computer Systems. SIGMETRICS \u201918, pp.41\u201343, New York, NY, USA (2018)","DOI":"10.1145\/3219617.3219635"},{"key":"1196_CR22","unstructured":"Agarwal, N., Gonen, A., Hazan, E.: Learning in non-convex games with an optimization oracle. In: Beygelzimer, A., Hsu, D. (eds.) Proceedings of the Thirty-Second Conference on Learning Theory. Proceedings of Machine Learning Research, vol. 99, pp. 18\u201329. Phoenix, USA (2019)"},{"key":"1196_CR23","unstructured":"Suggala, A.S., Netrapalli, P.: Online Non-Convex Learning: Following the Perturbed Leader is Optimal. arXiv:abs\/1903.08110 (2019)"},{"key":"1196_CR24","unstructured":"Roy, A., Balasubramanian, K., Ghadimi, S., Mohapatra, P.: Multi-Point Bandit Algorithms for Nonstationary Online Nonconvex Optimization. arXiv:abs\/1907.13616 (2019)"},{"key":"1196_CR25","first-page":"2503","volume":"13","author":"M Mahdavi","year":"2012","unstructured":"Mahdavi, M., Jin, R., Yang, T.: Trading regret for efficiency: online convex optimization with long term constraints. J. Mach. Learn. Res. 13, 2503\u20132528 (2012)","journal-title":"J. Mach. Learn. Res."},{"key":"1196_CR26","unstructured":"Jenatton, R., Huang, J., Archambeau, C.: Adaptive algorithms for online convex optimization with long-term constraints. In: Proceedings of The 33rd International Conference on Machine Learning. Proceedings of Machine Learning Research, vol. 48, pp.402\u2013411. New York, New York, USA (2016)"},{"key":"1196_CR27","unstructured":"Yu, H., Neely, M.J.: A Low Complexity Algorithm with $$O(\\sqrt{T})$$ Regret and Finite Constraint Violations for Online Convex Optimization with Long Term Constraints. arXiv:abs\/1604.02218 (2016)"},{"issue":"2","key":"1196_CR28","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1287\/moor.1.2.97","volume":"1","author":"RT Rockafellar","year":"1976","unstructured":"Rockafellar, R.T.: Augmented Lagrangians and applications of the proximal point algorithm in convex programming. Math. Oper. Res. 1(2), 97\u2013116 (1976)","journal-title":"Math. Oper. Res."},{"key":"1196_CR29","unstructured":"Yu, H., Neely, M.J., Wei, X.: Online Convex Optimization with Stochastic Constraints. In: Advances in Neural Information Processing Systems, pp. 1428\u20131438 (2017)"},{"key":"1196_CR30","unstructured":"Beck, A.: First-order Methods in Optimization. MOS-SIAM Series on Optimization, vol. 25. Society for Industrial and Applied Mathematics (SIAM), Philadelphia, PA (2017)"}],"container-title":["Journal of Global Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10898-022-01196-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10898-022-01196-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10898-022-01196-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,7]],"date-time":"2023-01-07T08:07:11Z","timestamp":1673078831000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10898-022-01196-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,6,21]]},"references-count":30,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2023,1]]}},"alternative-id":["1196"],"URL":"https:\/\/doi.org\/10.1007\/s10898-022-01196-2","relation":{},"ISSN":["0925-5001","1573-2916"],"issn-type":[{"type":"print","value":"0925-5001"},{"type":"electronic","value":"1573-2916"}],"subject":[],"published":{"date-parts":[[2022,6,21]]},"assertion":[{"value":"28 April 2021","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"30 May 2022","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"21 June 2022","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}