{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T02:08:22Z","timestamp":1740103702428,"version":"3.37.3"},"reference-count":36,"publisher":"Wiley","license":[{"start":{"date-parts":[[2024,2,6]],"date-time":"2024-02-06T00:00:00Z","timestamp":1707177600000},"content-version":"unspecified","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61877032","11601061","JYTMS20231042"],"award-info":[{"award-number":["61877032","11601061","JYTMS20231042"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100007620","name":"Department of Education of Liaoning Province","doi-asserted-by":"publisher","award":["61877032","11601061","JYTMS20231042"],"award-info":[{"award-number":["61877032","11601061","JYTMS20231042"]}],"id":[{"id":"10.13039\/501100007620","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Complexity"],"published-print":{"date-parts":[[2024,2,6]]},"abstract":"<jats:p>An implementable algorithm for solving nonsmooth nonconvex constrained optimization is proposed by combining bundle ideas, proximity control, and the exact penalty function. We construct two kinds of approximations to nonconvex objective function; these two approximations correspond to the convex and concave behaviors of the objective function at the current point, which captures precisely the characteristic of the objective function. The penalty coefficients are increased only a finite number of times under the conditions of Slater constraint qualification and the boundedness of the constrained set, which limit the unnecessary penalty growth. The given algorithm converges to an approximate stationary point of the exact penalty function for constrained nonconvex optimization with weakly semismooth objective function. We also provide the results of some preliminary numerical testing to show the validity and efficiency of the proposed method.<\/jats:p>","DOI":"10.1155\/2024\/5720769","type":"journal-article","created":{"date-parts":[[2024,2,6]],"date-time":"2024-02-06T21:19:27Z","timestamp":1707254367000},"page":"1-11","source":"Crossref","is-referenced-by-count":0,"title":["A Nonconvex Proximal Bundle Method for Nonsmooth Constrained Optimization"],"prefix":"10.1155","volume":"2024","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-6157-3388","authenticated-orcid":true,"given":"Jie","family":"Shen","sequence":"first","affiliation":[{"name":"School of Mathematics, Liaoning Normal University, Dalian 116029, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Fang-Fang","family":"Guo","sequence":"additional","affiliation":[{"name":"School of Mathematical Sciences, Dalian University of Technology, Dalian 116024, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Na","family":"Xu","sequence":"additional","affiliation":[{"name":"School of Mathematics, Liaoning Normal University, Dalian 116029, China"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"311","reference":[{"volume-title":"Nonconvex Optimization in Mechanics. Smooth and Nonsmooth Algorithms, Heuristics and Engineering Applications","year":"1998","author":"E. S. Mistakidis","key":"1"},{"volume-title":"Nonsmooth Approach to Optimization Problems with Equilibrium Constraints. Theory, Applications and Numerical Results","year":"1998","author":"J. Outrata","key":"2"},{"volume-title":"Topics in Nonsmooth Mechanics","year":"1988","author":"J. J. Moreau","key":"3"},{"volume-title":"Nonsmooth Analysis and Control Theory","year":"1998","author":"F. H. Clarke","key":"4"},{"volume-title":"Nonlinear Multiobjective Optimization","year":"1999","author":"K. Miettinen","key":"5"},{"key":"6","doi-asserted-by":"publisher","DOI":"10.1137\/s1052623402411459"},{"key":"7","doi-asserted-by":"publisher","DOI":"10.1007\/bf01582892"},{"issue":"1","key":"8","first-page":"11","article-title":"A PVT-type algorithm for minimizing a nonsmooth convex function","volume":"29","author":"L. P. Pang","year":"2003","journal-title":"Serdica Mathematical Journal"},{"key":"9","doi-asserted-by":"publisher","DOI":"10.1007\/bf02935732"},{"key":"10","doi-asserted-by":"publisher","DOI":"10.1080\/10556780903236911"},{"key":"11","doi-asserted-by":"crossref","first-page":"112","DOI":"10.1007\/3-540-45586-8_4","article-title":"Lagrangian relaxation","volume-title":"Computational combinatorial optimization: optimal or provably near-optimal solutions","author":"C. Lemarechal","year":"2001"},{"key":"12","doi-asserted-by":"crossref","first-page":"555","DOI":"10.1007\/978-1-4614-7621-4_26","article-title":"Bundle method for non-convex minimization with inexact subgradients and function values","volume-title":"Computational and Analytical Mathematics, Volume 50 of Springer Proceedings in Mathematics and Statistics","author":"D. Noll","year":"2013"},{"key":"13","doi-asserted-by":"publisher","DOI":"10.1007\/s10589-015-9762-4"},{"key":"14","doi-asserted-by":"publisher","DOI":"10.1007\/s10957-014-0523-9"},{"key":"15","doi-asserted-by":"publisher","DOI":"10.1007\/bf01386389"},{"key":"16","doi-asserted-by":"publisher","DOI":"10.1137\/0108053"},{"key":"17","doi-asserted-by":"publisher","DOI":"10.1137\/040603875"},{"key":"18","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-007-0123-7"},{"key":"19","doi-asserted-by":"publisher","DOI":"10.1093\/imanum\/5.1.111"},{"key":"20","doi-asserted-by":"publisher","DOI":"10.1137\/0802008"},{"key":"21","doi-asserted-by":"publisher","DOI":"10.1137\/0806013"},{"key":"22","doi-asserted-by":"publisher","DOI":"10.1007\/s11228-010-0159-3"},{"key":"23","doi-asserted-by":"publisher","DOI":"10.1137\/090754595"},{"key":"24","doi-asserted-by":"publisher","DOI":"10.1080\/02331934.2013.840625"},{"key":"25","doi-asserted-by":"publisher","DOI":"10.1080\/10556780410001648112"},{"key":"26","doi-asserted-by":"publisher","DOI":"10.1137\/030601296"},{"key":"27","doi-asserted-by":"publisher","DOI":"10.1137\/050639673"},{"key":"28","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-007-0124-6"},{"key":"29","doi-asserted-by":"publisher","DOI":"10.1137\/0910013"},{"volume-title":"Optimization and Nonsmooth Analysis","year":"1983","author":"F. H. Clarke","key":"30"},{"key":"31","unstructured":"FuduliA.GaudiosoM.The proximal trajectory algorithm for convex minimization1998Arcavacata, ItalyUniversita della CalabriaTechnical Report 7\/98"},{"key":"32","doi-asserted-by":"publisher","DOI":"10.1007\/bf01585555"},{"key":"33","doi-asserted-by":"publisher","DOI":"10.1287\/moor.2.2.191"},{"key":"34","unstructured":"FletcherR.LeyfferS.A bundle filter method for nonsmooth nonlinear optimization1999Dundee, ScotlandThe University of DundeeNumerical Analysis Report NA\/195"},{"key":"35","unstructured":"FerrierC.Bornes Duales de Problemes d\u2019Optimisation Polynomiaux1997Toulouse, FranceUniversite Paul SabatierPh.D. thesis"},{"key":"36","doi-asserted-by":"publisher","DOI":"10.1051\/cocv:2000104"}],"container-title":["Complexity"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/downloads.hindawi.com\/journals\/complexity\/2024\/5720769.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/downloads.hindawi.com\/journals\/complexity\/2024\/5720769.xml","content-type":"application\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/downloads.hindawi.com\/journals\/complexity\/2024\/5720769.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,2,6]],"date-time":"2024-02-06T21:19:38Z","timestamp":1707254378000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.hindawi.com\/journals\/complexity\/2024\/5720769\/"}},"subtitle":[],"editor":[{"given":"Sigurdur F.","family":"Hafstein","sequence":"additional","affiliation":[],"role":[{"role":"editor","vocabulary":"crossref"}]}],"short-title":[],"issued":{"date-parts":[[2024,2,6]]},"references-count":36,"alternative-id":["5720769","5720769"],"URL":"https:\/\/doi.org\/10.1155\/2024\/5720769","relation":{},"ISSN":["1099-0526","1076-2787"],"issn-type":[{"type":"electronic","value":"1099-0526"},{"type":"print","value":"1076-2787"}],"subject":[],"published":{"date-parts":[[2024,2,6]]}}}