{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,29]],"date-time":"2022-03-29T05:46:01Z","timestamp":1648532761651},"reference-count":27,"publisher":"Walter de Gruyter GmbH","issue":"0","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"abstract":"<jats:title>Abstract<\/jats:title>\n               <jats:p>For nonlinear nonsmooth DC programming (difference of convex functions), we introduce a new redistributed proximal bundle method. The subgradient information of both the DC components is gathered from some neighbourhood of the current stability center and it is used to build separately an approximation for each component in the DC representation. Especially we employ the nonlinear redistributed technique to model the second component of DC function by constructing a local convexification cutting plane. The corresponding convexification parameter is adjusted dynamically and is taken sufficiently large to make the \u201daugmented\u201d linearization errors nonnegative. Based on above techniques we obtain a new convex cutting plane model of the original objective function. Based on this new approximation the redistributed proximal bundle method is designed and the convergence of the proposed algorithm to a Clarke stationary point is proved. A simple numerical experiment is given to show the validity of the presented algorithm.<\/jats:p>","DOI":"10.1515\/jnma-2019-0049","type":"journal-article","created":{"date-parts":[[2021,4,24]],"date-time":"2021-04-24T20:14:38Z","timestamp":1619295278000},"source":"Crossref","is-referenced-by-count":0,"title":["A Redistributed Bundle Algorithm Based on Local Convexification Models for Nonlinear Nonsmooth DC Programming"],"prefix":"10.1515","volume":"0","author":[{"given":"Jie","family":"Shen","sequence":"first","affiliation":[{"name":"School of Mathematics, Liaoning Normal University , Dalian , 116029 , China"}]},{"given":"Na","family":"Xu","sequence":"additional","affiliation":[{"name":"School of Mathematics, Liaoning Normal University , Dalian , 116029 , China"}]},{"given":"Fang-Fang","family":"Guo","sequence":"additional","affiliation":[{"name":"School of Mathematical Sciences, Dalian University of Technology , Dalian , 116024 , China"}]},{"given":"Han-Yang","family":"Li","sequence":"additional","affiliation":[{"name":"School of Mathematics, Liaoning Normal University , Dalian , 116029 , China"}]},{"given":"Pan","family":"Hu","sequence":"additional","affiliation":[{"name":"School of Mathematics, Liaoning Normal University , Dalian , 116029 , China"}]}],"member":"374","published-online":{"date-parts":[[2021,4,20]]},"reference":[{"key":"2021042420143256257_j_jnma-2019-0049_ref_001_w2aab3b7b1b1b6b1ab2b1b1Aa","doi-asserted-by":"crossref","unstructured":"K.Holmberg and H.Tuy, A production-transportation problem with stochastic demand and concave production costs, Math. Prog., 85: 157-179, 1999.","DOI":"10.1007\/s101070050050"},{"key":"2021042420143256257_j_jnma-2019-0049_ref_002_w2aab3b7b1b1b6b1ab2b1b2Aa","doi-asserted-by":"crossref","unstructured":"C.Pey-chun, P.Hansen, B. Jaumard, and H.Tuy, Solution of the multisource Weber and conditional Weber problems by d.c. programming, Oper. Res., 46: 548-562, 1998.","DOI":"10.1287\/opre.46.4.548"},{"key":"2021042420143256257_j_jnma-2019-0049_ref_003_w2aab3b7b1b1b6b1ab2b1b3Aa","doi-asserted-by":"crossref","unstructured":"H.A.Le Thi and Tao, P.D., The DC (difference of convex functions) programming and DCA revised with DC models of real world nonconvex optimization problems, Ann. Oper. Res., 133: 23-46, 2005.","DOI":"10.1007\/s10479-004-5022-1"},{"key":"2021042420143256257_j_jnma-2019-0049_ref_004_w2aab3b7b1b1b6b1ab2b1b4Aa","doi-asserted-by":"crossref","unstructured":"A. Astorino, A.Fuduli, and M.Gaudioso, Margin maximization in spherical separation, Comput. Optim. Appl., 53: 301-322, 2012.","DOI":"10.1007\/s10589-012-9486-7"},{"key":"2021042420143256257_j_jnma-2019-0049_ref_005_w2aab3b7b1b1b6b1ab2b1b5Aa","unstructured":"R. Horst and N.V.Thoai, DC programming: Overview, J. Optim. Theory Appl., 103: 1-43, 1999."},{"key":"2021042420143256257_j_jnma-2019-0049_ref_006_w2aab3b7b1b1b6b1ab2b1b6Aa","doi-asserted-by":"crossref","unstructured":"H.Tuy, Convex Analysis and Global Optimization, Kluwer Academic Publisher, Dordrescht, 1st ed, 1998.","DOI":"10.1007\/978-1-4757-2809-5"},{"key":"2021042420143256257_j_jnma-2019-0049_ref_007_w2aab3b7b1b1b6b1ab2b1b7Aa","doi-asserted-by":"crossref","unstructured":"A.M.Bagirov, A method for minimization of quasidifferentiable functions. Optim. Methods Softw., 17: 31-60, 2002.","DOI":"10.1080\/10556780290027837"},{"key":"2021042420143256257_j_jnma-2019-0049_ref_008_w2aab3b7b1b1b6b1ab2b1b8Aa","doi-asserted-by":"crossref","unstructured":"A.M.Bagirov and J.Ugon, Codifferetial method for minimizing nonsmooth DC functions, J. Global Optim.. 50: 3-22, 2011.","DOI":"10.1007\/s10898-010-9569-x"},{"key":"2021042420143256257_j_jnma-2019-0049_ref_009_w2aab3b7b1b1b6b1ab2b1b9Aa","doi-asserted-by":"crossref","unstructured":"J.C.O.Souza, P.R.Oliveira and A.Soubeyran, Global convergence of a proximal linearized algorithm for difference of convex functions, Optim. Lett., 10: 1529-1539, 2016.","DOI":"10.1007\/s11590-015-0969-1"},{"key":"2021042420143256257_j_jnma-2019-0049_ref_010_w2aab3b7b1b1b6b1ab2b1c10Aa","doi-asserted-by":"crossref","unstructured":"K.Joki, A.M.Bagirov, N.Karmitsa and M.M.Makela, A proximal bundle method for nonsmooth DC optimization utilizing nonconvex cutting planes, J. Global Optim. 68: 501-535, 2017.","DOI":"10.1007\/s10898-016-0488-3"},{"key":"2021042420143256257_j_jnma-2019-0049_ref_011_w2aab3b7b1b1b6b1ab2b1c11Aa","unstructured":"Rockafellar,R.T. Convex Analysis, Princeton University Press, Princeton, 1970."},{"key":"2021042420143256257_j_jnma-2019-0049_ref_012_w2aab3b7b1b1b6b1ab2b1c12Aa","doi-asserted-by":"crossref","unstructured":"A. Fudili, M. Gaudioso and G. Giallombardo, A DC piecewise affine model and a bundling technique in nonconvex nonsmooth minimization. Optim. Methods Softw., 19(1): 89-102, 2004.","DOI":"10.1080\/10556780410001648112"},{"key":"2021042420143256257_j_jnma-2019-0049_ref_013_w2aab3b7b1b1b6b1ab2b1c13Aa","unstructured":"Clarke, F.H., Optimization and Nonsmooth Analysis, Wiley, New York, 1983."},{"key":"2021042420143256257_j_jnma-2019-0049_ref_014_w2aab3b7b1b1b6b1ab2b1c14Aa","doi-asserted-by":"crossref","unstructured":"W. Hare and C. Lemar\u00e9chal, A redistributed proximal bundle method for nonconvex optimization. SIAM J. Optim., 20(5): 2442-2473, 2010.","DOI":"10.1137\/090754595"},{"key":"2021042420143256257_j_jnma-2019-0049_ref_015_w2aab3b7b1b1b6b1ab2b1c15Aa","doi-asserted-by":"crossref","unstructured":"An, L.T.H. and Tao, P.D., The DC (difference of convex functions) programming and DCA revised with DC models of real world nonconvex optimization problems, Journal of Global Optimization, 133(1): 23-46, 2005.","DOI":"10.1007\/s10479-004-5022-1"},{"key":"2021042420143256257_j_jnma-2019-0049_ref_016_w2aab3b7b1b1b6b1ab2b1c16Aa","unstructured":"Toland, J.F., On subdifferential calculus and duality in nonconvex optimization, Bull. Soc. Math. France, Memoire, 60: 173-180, 1979."},{"key":"2021042420143256257_j_jnma-2019-0049_ref_017_w2aab3b7b1b1b6b1ab2b1c17Aa","doi-asserted-by":"crossref","unstructured":"K.C.Kiwiel, Proximity control in bundle method for convex nondifferentiable minimization, Math. Prog., 46: 105-122, 1990.","DOI":"10.1007\/BF01585731"},{"key":"2021042420143256257_j_jnma-2019-0049_ref_018_w2aab3b7b1b1b6b1ab2b1c18Aa","doi-asserted-by":"crossref","unstructured":"M.M.Makela, Survey of bundle methods for nonsmooth optimization, Optim. Methods Softw., 17: 1-29, 2002.","DOI":"10.1080\/10556780290027828"},{"key":"2021042420143256257_j_jnma-2019-0049_ref_019_w2aab3b7b1b1b6b1ab2b1c19Aa","doi-asserted-by":"crossref","unstructured":"M.M.Makela and P.Neittaanmaki, Nonsmooth Optimization: Analysis and Algorithms with Applications to Optimal Control, World Scientific Publishing Co., Singapore, 1992.","DOI":"10.1142\/1493"},{"key":"2021042420143256257_j_jnma-2019-0049_ref_020_w2aab3b7b1b1b6b1ab2b1c20Aa","unstructured":"H. Schramm and J.Zowe, A version of the bundle idea for minimizing a nonsmooth function: Conceptual idea, convergence analysis, numerical results, SIAM J. Optim., 2: 121-152, 1992."},{"key":"2021042420143256257_j_jnma-2019-0049_ref_021_w2aab3b7b1b1b6b1ab2b1c21Aa","doi-asserted-by":"crossref","unstructured":"Jie Shen, Zun-Quan Xia, Li-Ping Pang, A proximal bundle method with inexact data for convex nondifferentiable minimization. Nonlinear Analysis A : theory, method and applications, 66: 2016-2027, 2007.","DOI":"10.1016\/j.na.2006.02.039"},{"key":"2021042420143256257_j_jnma-2019-0049_ref_022_w2aab3b7b1b1b6b1ab2b1c22Aa","doi-asserted-by":"crossref","unstructured":"Daniilidis, A., Sagastizabal, C., Solodov, M., Identifying structure of nonsmooth convex functions by the bundle techniques, SIAM. J. Optim., 20(2): 820-840, 2009.","DOI":"10.1137\/080729864"},{"key":"2021042420143256257_j_jnma-2019-0049_ref_023_w2aab3b7b1b1b6b1ab2b1c23Aa","doi-asserted-by":"crossref","unstructured":"Fletcher, R., Leyffer, S., Ralph, D. and Scholters, S., Local convergence of SQP methods for mathematical programs with equilibrium constraints, SIAM J. Optim., 17: 259-286, 2006.","DOI":"10.1137\/S1052623402407382"},{"key":"2021042420143256257_j_jnma-2019-0049_ref_024_w2aab3b7b1b1b6b1ab2b1c24Aa","doi-asserted-by":"crossref","unstructured":"W. Hare and C. Lemar\u00e9chal and M. Solodov, A proximal bundle method for nonsmooth nonconvex functions with inexact information. Comput. Optim. Appl., 63: 1-28, 2016.","DOI":"10.1007\/s10589-015-9762-4"},{"key":"2021042420143256257_j_jnma-2019-0049_ref_025_w2aab3b7b1b1b6b1ab2b1c25Aa","doi-asserted-by":"crossref","unstructured":"Jie Shen, Xiao-Qian Liu, Fang-Fang Guo, Shu-Xin Wang, An approximate redistributed proximal bundle method with inexact data for minimizing nonsmooth nonconvex functions. Mathematical Problems in Engineering, 2015 (2015), Article ID 215310, 9 pages.","DOI":"10.1155\/2015\/215310"},{"key":"2021042420143256257_j_jnma-2019-0049_ref_026_w2aab3b7b1b1b6b1ab2b1c26Aa","doi-asserted-by":"crossref","unstructured":"Rockafellar,R.T. and Wets, J.J.-B, Variational Analysis, Volum 317 of Grundlehren der Mathematischen Wissenschaften [Fundamental Principles of Mathematical Sciences]. Springer, Berlin, 1998.","DOI":"10.1007\/978-3-642-02431-3"},{"key":"2021042420143256257_j_jnma-2019-0049_ref_027_w2aab3b7b1b1b6b1ab2b1c27Aa","unstructured":"Polyak, B.T., Introduction to Optimization. Optimization Software. Inc., Publications Division, New York, 1987."}],"container-title":["Journal of Numerical Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.degruyter.com\/document\/doi\/10.1515\/jnma-2019-0049\/xml","content-type":"application\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/www.degruyter.com\/document\/doi\/10.1515\/jnma-2019-0049\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,24]],"date-time":"2021-04-24T20:15:18Z","timestamp":1619295318000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.degruyter.com\/document\/doi\/10.1515\/jnma-2019-0049\/html"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,4,20]]},"references-count":27,"journal-issue":{"issue":"0","published-online":{"date-parts":[[2021,4,20]]}},"alternative-id":["10.1515\/jnma-2019-0049"],"URL":"https:\/\/doi.org\/10.1515\/jnma-2019-0049","relation":{},"ISSN":["1569-3953","1570-2820"],"issn-type":[{"value":"1569-3953","type":"electronic"},{"value":"1570-2820","type":"print"}],"subject":[],"published":{"date-parts":[[2021,4,20]]}}}