{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,24]],"date-time":"2026-07-24T06:13:52Z","timestamp":1784873632481,"version":"3.55.0"},"reference-count":13,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2023,8,30]],"date-time":"2023-08-30T00:00:00Z","timestamp":1693353600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,8,30]],"date-time":"2023-08-30T00:00:00Z","timestamp":1693353600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100007129","name":"Natural Science Foundation of Shandong Province","doi-asserted-by":"publisher","award":["ZR2021MA066"],"award-info":[{"award-number":["ZR2021MA066"]}],"id":[{"id":"10.13039\/501100007129","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J. Appl. Math. Comput."],"published-print":{"date-parts":[[2023,10]]},"DOI":"10.1007\/s12190-023-01911-6","type":"journal-article","created":{"date-parts":[[2023,8,30]],"date-time":"2023-08-30T13:03:14Z","timestamp":1693400594000},"page":"3987-3997","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Global convergence of a class new smooth penalty algorithm for constrained optimization problem"],"prefix":"10.1007","volume":"69","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-8418-3750","authenticated-orcid":false,"given":"Wenling","family":"Zhao","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Ruyu","family":"Wang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Daojin","family":"Song","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2023,8,30]]},"reference":[{"issue":"1","key":"1911_CR1","doi-asserted-by":"publisher","first-page":"211","DOI":"10.1137\/S1052623497324825","volume":"10","author":"A Auslender","year":"1999","unstructured":"Auslender, A.: Penalty and barrier methods: a unified framework. SIAM J. Optim. 10(1), 211\u2013230 (1999)","journal-title":"SIAM J. Optim."},{"issue":"1","key":"1911_CR2","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1287\/moor.22.1.43","volume":"22","author":"A Auslender","year":"1997","unstructured":"Auslender, A., Cominetti, R., Haddou, M.: Asymptotic analysis for penalty and barrier methods in convex and linear programming. Math. Oper. Res. 22(1), 43\u201362 (1997)","journal-title":"Math. Oper. Res."},{"key":"1911_CR3","doi-asserted-by":"crossref","unstructured":"Ben-Tal, A., Teboulle, M.: A smoothing technique for nondifferentiable optimization problems. In: Optimization: Proceedings of the Fifth French-German Conference Held in Castel-Novel (Varetz), France, Oct. 3\u20138, 1988, pp. 1\u201311. Springer (2006)","DOI":"10.1007\/BFb0083582"},{"issue":"2","key":"1911_CR4","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1007\/BF00249052","volume":"5","author":"O Mangasarian","year":"1996","unstructured":"Mangasarian, O., Chen, C.: A class of smoothing functions for nonlinear and mixed complementarity problems. Comput. Optim. Appl. 5(2), 97\u2013138 (1996)","journal-title":"Comput. Optim. Appl."},{"issue":"1","key":"1911_CR5","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1007\/BF01592244","volume":"71","author":"C Chen","year":"1995","unstructured":"Chen, C., Mangasarian, O.L.: Smoothing methods for convex inequalities and linear complementarity problems. Math. Program. 71(1), 51\u201369 (1995)","journal-title":"Math. Program."},{"key":"1911_CR6","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1007\/s10107-002-0332-z","volume":"96","author":"CC Gonzaga","year":"2003","unstructured":"Gonzaga, C.C., Castillo, R.A.: A nonlinear programming algorithm based on non-coercive penalty functions. Math. Program. 96, 87\u2013101 (2003)","journal-title":"Math. Program."},{"issue":"3","key":"1911_CR7","doi-asserted-by":"publisher","first-page":"486","DOI":"10.1137\/0804027","volume":"4","author":"M\u00c7 Pinar","year":"1994","unstructured":"Pinar, M.\u00c7., Zenios, S.A.: On smoothing exact penalty functions for convex constrained optimization. SIAM J. Optim. 4(3), 486\u2013511 (1994)","journal-title":"SIAM J. Optim."},{"issue":"1","key":"1911_CR8","doi-asserted-by":"publisher","first-page":"289","DOI":"10.1137\/S1052623497326095","volume":"10","author":"AM Rubinov","year":"1999","unstructured":"Rubinov, A.M., Glover, B.M., Yang, X.: Decreasing functions with applications to penalization. SIAM J. Optim. 10(1), 289\u2013313 (1999)","journal-title":"SIAM J. Optim."},{"issue":"1","key":"1911_CR9","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1007\/s10898-013-0111-9","volume":"58","author":"C Wang","year":"2014","unstructured":"Wang, C., Ma, C., Zhou, J.: A new class of exact penalty functions and penalty algorithms. J. Global Optim. 58(1), 51\u201373 (2014)","journal-title":"J. Global Optim."},{"key":"1911_CR10","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511983658","volume-title":"Mathematical Programs with Equilibrium Constraints","author":"Z-Q Luo","year":"1996","unstructured":"Luo, Z.-Q., Pang, J.-S., Ralph, D.: Mathematical Programs with Equilibrium Constraints. Cambridge University Press, Cambridge (1996)"},{"key":"1911_CR11","unstructured":"Babacan, S.D., Mancera, L., Molina, R., Katsaggelos, A.K.: Non-convex priors in Bayesian compressed sensing. In: 2009 17th European Signal Processing Conference, pp. 110\u2013114 (2009). IEEE"},{"key":"1911_CR12","first-page":"997","volume":"22","author":"M Kloft","year":"2009","unstructured":"Kloft, M., Brefeld, U., Laskov, P., M\u00fcller, K.-R., Zien, A., Sonnenburg, S.: Efficient and accurate $$\\ell _p$$-norm multiple kernel learning. NIPS 22, 997\u20131005 (2009)","journal-title":"NIPS"},{"issue":"3","key":"1911_CR13","doi-asserted-by":"crossref","first-page":"1001","DOI":"10.3934\/jimo.2018082","volume":"15","author":"C Zhang","year":"2019","unstructured":"Zhang, C., Wang, J., Xiu, N.: Robust and sparse portfolio model for index tracking. J. Ind. Manag. Optim. 15(3), 1001\u20131015 (2019)","journal-title":"J. Ind. Manag. Optim."}],"container-title":["Journal of Applied Mathematics and Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s12190-023-01911-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s12190-023-01911-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s12190-023-01911-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,10,27]],"date-time":"2024-10-27T05:26:39Z","timestamp":1730006799000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s12190-023-01911-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,8,30]]},"references-count":13,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2023,10]]}},"alternative-id":["1911"],"URL":"https:\/\/doi.org\/10.1007\/s12190-023-01911-6","relation":{},"ISSN":["1598-5865","1865-2085"],"issn-type":[{"value":"1598-5865","type":"print"},{"value":"1865-2085","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,8,30]]},"assertion":[{"value":"3 March 2023","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"8 August 2023","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"16 August 2023","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"30 August 2023","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare that they have no conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}