{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T05:16:04Z","timestamp":1767244564136,"version":"3.48.0"},"reference-count":59,"publisher":"MDPI AG","issue":"1","license":[{"start":{"date-parts":[[2025,12,24]],"date-time":"2025-12-24T00:00:00Z","timestamp":1766534400000},"content-version":"vor","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":"crossref","award":["12571102"],"award-info":[{"award-number":["12571102"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Axioms"],"abstract":"<jats:p>In this paper, we develop the extended proximal gradient algorithm with Nesterov\u2019s second acceleration (EAPGs) for constrained difference-of-convex (DC) optimization problems. EAPGs has two key links to existing methods: it extends APGs (for unconstrained DC problems) by adopting the constraint handling idea from Auslender\u2019s ESQM, and serves as a variant of ESQMe with extrapolation replaced by Nesterov\u2019s second acceleration. Under basic assumptions, we establish the subsequential convergence of EAPGs. By introducing a restart technique and leveraging the Kurdyka\u2013\u0141ojasiewicz (KL) property of a suitable potential function, we further prove its global convergence, analyze its convergence rate, and do so under weaker conditions than those for APGs. Additionally, we propose EAPGsr by adding practical restart criteria to EAPGs. Numerical experiments verify the criteria\u2019s efficiency and show that EAPGsr performs well against state-of-the-art methods for constrained and unconstrained DC problems.<\/jats:p>","DOI":"10.3390\/axioms15010007","type":"journal-article","created":{"date-parts":[[2025,12,24]],"date-time":"2025-12-24T16:41:19Z","timestamp":1766594479000},"page":"7","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["The Extended Second APG Method for Constrained DC Problems"],"prefix":"10.3390","volume":"15","author":[{"given":"Ziye","family":"Liu","sequence":"first","affiliation":[{"name":"Department of Mathematics, Jinan University, Guangzhou 510632, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Huitao","family":"Ke","sequence":"additional","affiliation":[{"name":"Department of Mathematics, Jinan University, Guangzhou 510632, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0854-4358","authenticated-orcid":false,"given":"Chunguang","family":"Liu","sequence":"additional","affiliation":[{"name":"Department of Mathematics, Jinan University, Guangzhou 510632, China"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"1968","published-online":{"date-parts":[[2025,12,24]]},"reference":[{"key":"ref_1","doi-asserted-by":"crossref","first-page":"5","DOI":"10.1007\/s10107-018-1235-y","article-title":"DC programming and DCA: Thirty years of developments","volume":"169","year":"2018","journal-title":"Math. Program."},{"key":"ref_2","doi-asserted-by":"crossref","first-page":"617","DOI":"10.1287\/opre.1100.0910","article-title":"Sequential Convex Approximations to Joint Chance Constrained Programs: A Monte Carlo Approach","volume":"59","author":"Hong","year":"2011","journal-title":"Oper. Res."},{"key":"ref_3","doi-asserted-by":"crossref","first-page":"705","DOI":"10.1007\/s10898-018-0671-9","article-title":"A DC programming approach for solving multicast network design problems via the Nesterov smoothing technique","volume":"72","author":"Geremew","year":"2018","journal-title":"J. Glob. Optim."},{"key":"ref_4","doi-asserted-by":"crossref","first-page":"1019","DOI":"10.1007\/s10898-021-01028-9","article-title":"Solving nonnegative sparsity-constrained optimization via DC quadratic-piecewise-linear approximations","volume":"81","author":"Shen","year":"2021","journal-title":"J. Glob. Optim."},{"key":"ref_5","doi-asserted-by":"crossref","first-page":"890","DOI":"10.1080\/10556788.2019.1595619","article-title":"Non-smooth DC-constrained optimization: Constraint qualification and minimizing methodologies","volume":"34","year":"2019","journal-title":"Optim. Methods Softw."},{"key":"ref_6","doi-asserted-by":"crossref","first-page":"1707","DOI":"10.1287\/moor.2021.1207","article-title":"Penalty and Augmented Lagrangian Methods for Constrained DC Programming","volume":"47","author":"Lu","year":"2022","journal-title":"Math. Oper. Res."},{"key":"ref_7","doi-asserted-by":"crossref","first-page":"95","DOI":"10.1287\/moor.2016.0795","article-title":"Computing B-Stationary Points of Nonsmooth DC Programs","volume":"42","author":"Pang","year":"2017","journal-title":"Math. Oper. Res."},{"key":"ref_8","doi-asserted-by":"crossref","first-page":"2984","DOI":"10.1109\/TSP.2014.2315167","article-title":"A new decomposition method for multiuser DC programming and its applications","volume":"62","author":"Alvarado","year":"2014","journal-title":"IEEE Trans. Signal. Process."},{"key":"ref_9","doi-asserted-by":"crossref","first-page":"307","DOI":"10.1007\/s10107-018-1236-x","article-title":"Minimization of transformed L1 penalty: Theory, difference of convex function algorithm, and robust application in compressed sensing","volume":"169","author":"Zhang","year":"2018","journal-title":"Math. Program."},{"key":"ref_10","doi-asserted-by":"crossref","first-page":"1950","DOI":"10.1109\/TSP.2014.2303946","article-title":"Optimal joint base station assignment and beamforming for heterogeneous networks","volume":"62","author":"Sanjabi","year":"2014","journal-title":"IEEE Trans. Signal. Process."},{"key":"ref_11","doi-asserted-by":"crossref","first-page":"111","DOI":"10.1145\/2184319.2184343","article-title":"Exact matrix completion via convex optimization","volume":"55","author":"Recht","year":"2012","journal-title":"Commun. ACM"},{"key":"ref_12","doi-asserted-by":"crossref","first-page":"2831","DOI":"10.1007\/s11590-021-01716-1","article-title":"On the superiority of pgms to pdcas in nonsmooth nonconvex sparse regression","volume":"15","author":"Nakayama","year":"2021","journal-title":"Optim. Lett."},{"key":"ref_13","doi-asserted-by":"crossref","first-page":"3008","DOI":"10.1109\/TAC.2014.2351694","article-title":"Selective l1 minimization for sparse recovery","volume":"59","author":"Bloch","year":"2014","journal-title":"IEEE Trans. Autom. Control"},{"key":"ref_14","doi-asserted-by":"crossref","first-page":"31","DOI":"10.1007\/s10915-021-01677-8","article-title":"An accelerated smoothing gradient method for nonconvex nonsmooth minimization in image processing","volume":"90","author":"Wang","year":"2022","journal-title":"J. Sci. Comput"},{"key":"ref_15","unstructured":"Hiriart-Urruty, J.-B. (1986). Algorithms for solving a class of nonconvex optimization Problems. Methods of subgradients. Fermat Days 85: Mathematics for Optimization, North-Holland."},{"key":"ref_16","doi-asserted-by":"crossref","unstructured":"Lee, J., and Leyffer, S. (2012). Sequential quadratic programming methods. Mixed Integer Nonlinear Programming, Springer.","DOI":"10.1007\/978-1-4614-1927-3"},{"key":"ref_17","doi-asserted-by":"crossref","first-page":"A536","DOI":"10.1137\/140952363","article-title":"Minimization of \u21131\u20132 for compressed sensing","volume":"37","author":"Yin","year":"2015","journal-title":"SIAM J. Sci. Comput."},{"key":"ref_18","doi-asserted-by":"crossref","first-page":"183","DOI":"10.1007\/s10957-012-0145-z","article-title":"An extended sequential quadratically constrained quadratic programming algorithm for nonlinear, semidefinite, and second-order cone programming","volume":"156","author":"Auslender","year":"2013","journal-title":"J. Optim. Theory Appl."},{"key":"ref_19","doi-asserted-by":"crossref","first-page":"1185","DOI":"10.1007\/s10589-025-00680-1","article-title":"An extended sequential quadratic method with extrapolation","volume":"91","author":"Zhang","year":"2025","journal-title":"Comput. Optim. Appl."},{"key":"ref_20","doi-asserted-by":"crossref","unstructured":"Gaudioso, M., Taheri, S., Bagirov, A.M., and Karmitsa, N. (2023). Bundle Enrichment Method for Nonsmooth Difference of Convex Programming Problems. Algorithms, 16.","DOI":"10.3390\/a16080394"},{"key":"ref_21","doi-asserted-by":"crossref","first-page":"263","DOI":"10.1007\/s10107-010-0394-2","article-title":"Approximation accuracy, gradient methods, and error bound for structured convex optimization","volume":"125","author":"Tseng","year":"2010","journal-title":"Math. Program."},{"key":"ref_22","doi-asserted-by":"crossref","first-page":"183","DOI":"10.1137\/080716542","article-title":"A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems","volume":"2","author":"Beck","year":"2009","journal-title":"SIAM J. Imaging Sci."},{"key":"ref_23","doi-asserted-by":"crossref","first-page":"697","DOI":"10.1137\/S1052623403427823","article-title":"Interior gradient and proximal methods for convex and conic optimization","volume":"16","author":"Auslender","year":"2006","journal-title":"SIAM J. Optim."},{"key":"ref_24","doi-asserted-by":"crossref","first-page":"124","DOI":"10.1137\/16M1055323","article-title":"Linear convergence of proximal gradient algorithm with extrapolation for a class of nonconvex nonsmooth minimization problems","volume":"27","author":"Wen","year":"2017","journal-title":"SIAM J. Optim."},{"key":"ref_25","doi-asserted-by":"crossref","first-page":"805","DOI":"10.1007\/s11590-018-1280-8","article-title":"The modified second apg method for dc optimization problems","volume":"13","author":"Lin","year":"2019","journal-title":"Optim. Lett."},{"key":"ref_26","doi-asserted-by":"crossref","first-page":"747","DOI":"10.1007\/s11590-024-02132-x","article-title":"The modified second APG method for a class of nonconvex nonsmooth problems","volume":"19","author":"Ren","year":"2025","journal-title":"Optim. Lett."},{"key":"ref_27","unstructured":"Lu, Z. (2012). Sequential convex programming methods for a class of structured nonlinear programming. arXiv."},{"key":"ref_28","doi-asserted-by":"crossref","first-page":"2024","DOI":"10.1137\/20M1314057","article-title":"Convergence rate analysis of a sequential convex programming method with line search for a class of constrained difference-of-convex optimization problems","volume":"31","author":"Yu","year":"2021","journal-title":"SIAM J. Optim."},{"key":"ref_29","unstructured":"Wilson, R.B. (1963). A Simplicial Method for Convex Programming. [Ph.D. Thesis, Harvard University]."},{"key":"ref_30","doi-asserted-by":"crossref","first-page":"64","DOI":"10.1287\/moor.1030.0069","article-title":"On the sequential quadratically constrained quadratic programming methods","volume":"29","author":"Solodov","year":"2004","journal-title":"Math. Oper. Res."},{"key":"ref_31","doi-asserted-by":"crossref","first-page":"1098","DOI":"10.1137\/S1052623401398120","article-title":"A sequential quadratically constrained quadratic programming method for differentiable convex minimization","volume":"13","author":"Fukushima","year":"2003","journal-title":"SIAM J. Optim."},{"key":"ref_32","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/s10107-007-0180-y","article-title":"Global convergence of an SQP method without boundedness assumptions on any of the iterative sequences","volume":"118","author":"Solodov","year":"2009","journal-title":"Math. Program."},{"key":"ref_33","doi-asserted-by":"crossref","first-page":"715","DOI":"10.1007\/s10208-013-9150-3","article-title":"Adaptive Restart for Accelerated Gradient Schemes","volume":"15","year":"2015","journal-title":"Found. Comput. Math."},{"key":"ref_34","unstructured":"Rockafellar, R.T., and Wets, R.J.B. (2009). Variational Analysis, Springer Science & Business Media. [3rd ed.]."},{"key":"ref_35","doi-asserted-by":"crossref","first-page":"556","DOI":"10.1137\/060670080","article-title":"Clarke subgradients of stratifiable functions","volume":"18","author":"Bolte","year":"2007","journal-title":"SIAM J. Optim."},{"key":"ref_36","doi-asserted-by":"crossref","first-page":"126070","DOI":"10.1109\/ACCESS.2025.3589260","article-title":"The Bregman Modified Second APG Method for DC Optimization Problems","volume":"13","author":"Wang","year":"2025","journal-title":"IEEE Access"},{"key":"ref_37","doi-asserted-by":"crossref","first-page":"438","DOI":"10.1287\/moor.1100.0449","article-title":"Proximal alternating minimization and projection methods for nonconvex problems: An approach based on the Kurdyka-\u0141ojasiewicz inequality","volume":"35","author":"Attouch","year":"2010","journal-title":"Math. Oper. Res."},{"key":"ref_38","doi-asserted-by":"crossref","first-page":"91","DOI":"10.1007\/s10107-011-0484-9","article-title":"Convergence of descent methods for semi-algebraic and tame problems: Proximal algorithms, forward-backward splitting, and regularized Gauss-Seidel methods","volume":"137","author":"Attouch","year":"2013","journal-title":"Math. Program."},{"key":"ref_39","doi-asserted-by":"crossref","first-page":"459","DOI":"10.1007\/s10107-013-0701-9","article-title":"Proximal alternating linearized minimization for nonconvex and nonsmooth problems","volume":"146","author":"Bolte","year":"2014","journal-title":"Math. Program."},{"key":"ref_40","doi-asserted-by":"crossref","first-page":"1199","DOI":"10.1007\/s10208-017-9366-8","article-title":"Calculus of the exponent of Kurdyka-\u0141ojasiewicz inequality and its applications to linear convergence of first-order methods","volume":"18","author":"Li","year":"2018","journal-title":"Found. Comput. Math."},{"key":"ref_41","doi-asserted-by":"crossref","first-page":"638","DOI":"10.1137\/22M1469663","article-title":"Convergence of a class of nonmonotone descent methods for Kurdyka-\u0141ojasiewicz optimization problems","volume":"33","author":"Qian","year":"2023","journal-title":"SIAM J. Optim."},{"key":"ref_42","doi-asserted-by":"crossref","first-page":"297","DOI":"10.1007\/s10589-017-9954-1","article-title":"A proximal difference-of-convex algorithm with extrapolation","volume":"69","author":"Wen","year":"2018","journal-title":"Comput. Optim. Appl."},{"key":"ref_43","doi-asserted-by":"crossref","first-page":"2415","DOI":"10.1287\/moor.2021.1214","article-title":"Extrapolated proximal subgradient algorithms for nonconvex and nonsmooth fractional programs","volume":"47","author":"Bot","year":"2022","journal-title":"Math. Oper. Res."},{"key":"ref_44","doi-asserted-by":"crossref","unstructured":"Nesterov, Y. (2004). Introductory Lectures on Convex Optimization: A Basic Course, Kluwer Academic Publishers.","DOI":"10.1007\/978-1-4419-8853-9"},{"key":"ref_45","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/s10444-022-10002-2","article-title":"Retraction-based first-order feasible methods for difference-of-convex programs with smooth inequality and simple geometric constraints","volume":"49","author":"Zhang","year":"2023","journal-title":"Adv. Comput. Math."},{"key":"ref_46","doi-asserted-by":"crossref","first-page":"538","DOI":"10.1137\/0803026","article-title":"Convergence analysis of a proximal-like minimization algorithm using Bregman functions","volume":"3","author":"Chen","year":"1993","journal-title":"SIAM J. Optim."},{"key":"ref_47","doi-asserted-by":"crossref","unstructured":"Rockafellar, R.T. (1970). Convex Analysis, Princeton University Press.","DOI":"10.1515\/9781400873173"},{"key":"ref_48","doi-asserted-by":"crossref","first-page":"682","DOI":"10.1287\/moor.2019.1008","article-title":"The proximal alternating direction method of multipliers in the nonconvex setting: Convergence analysis and rates","volume":"45","author":"Bot","year":"2020","journal-title":"Math. Oper. Res."},{"key":"ref_49","doi-asserted-by":"crossref","unstructured":"Rockafellar, R.T., and Wets, R.J.-B. (1998). Variational Analysis, Springer.","DOI":"10.1007\/978-3-642-02431-3"},{"key":"ref_50","doi-asserted-by":"crossref","first-page":"25","DOI":"10.1007\/s10107-004-0559-y","article-title":"On the implementation of a primal-dual interior point filter line search algorithm for large-scale nonlinear programming","volume":"106","author":"Biegler","year":"2006","journal-title":"Math. Program."},{"key":"ref_51","unstructured":"COIN-OR (2025, October 28). Ipopt (Interior Point Optimizer). Computer Software. Available online: https:\/\/projects.coin-or.org\/Ipopt."},{"key":"ref_52","doi-asserted-by":"crossref","first-page":"1465","DOI":"10.1137\/15M1028054","article-title":"Penalty methods for a class of non-Lipschitz optimization problems","volume":"26","author":"Chen","year":"2016","journal-title":"SIAM J. Optim."},{"key":"ref_53","doi-asserted-by":"crossref","first-page":"69","DOI":"10.1007\/s10589-019-00067-z","article-title":"A refined convergence analysis of pDCAe with applications to simultaneous sparse recovery and outlier detection","volume":"73","author":"Liu","year":"2019","journal-title":"Comput. Optim. Appl."},{"key":"ref_54","doi-asserted-by":"crossref","first-page":"2010","DOI":"10.1137\/13090540X","article-title":"A method for finding structured sparse solutions to non-negative least squares problems with applications","volume":"6","author":"Esser","year":"2013","journal-title":"SIAM J. Imag. Sci."},{"key":"ref_55","doi-asserted-by":"crossref","first-page":"178","DOI":"10.1007\/s10915-014-9930-1","article-title":"Computing sparse representation in a highly coherent dictionary based on difference of L1 and L2","volume":"64","author":"Lou","year":"2015","journal-title":"J. Sci. Comput."},{"key":"ref_56","doi-asserted-by":"crossref","first-page":"392","DOI":"10.1109\/JSTSP.2009.2039177","article-title":"Robust sampling and reconstruction methods for sparse signals in the presence of impulsive noise","volume":"4","author":"Carrillo","year":"2010","journal-title":"IEEE J. Sel. Top. Sign. Process."},{"key":"ref_57","doi-asserted-by":"crossref","first-page":"518","DOI":"10.4208\/ijnam2023-1022","article-title":"Convergence Rate Analysis of Accelerated Forward-Backward Algorithm with Generalized Nesterov Momentum Scheme","volume":"20","author":"Lin","year":"2023","journal-title":"Int. J. Numer. Anal. Model."},{"key":"ref_58","doi-asserted-by":"crossref","first-page":"108630","DOI":"10.1016\/j.cie.2022.108630","article-title":"Robust support vector machine classifier with truncated loss function by gradient algorithm","volume":"172","author":"Zhu","year":"2022","journal-title":"Comput. Ind. Eng."},{"key":"ref_59","unstructured":"Dua, D., and Graff, C. (2025, October 28). UCI Machine Learning Repository. Available online: http:\/\/archive.ics.uci.edu\/ml."}],"container-title":["Axioms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/2075-1680\/15\/1\/7\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T05:11:06Z","timestamp":1767244266000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/2075-1680\/15\/1\/7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,12,24]]},"references-count":59,"journal-issue":{"issue":"1","published-online":{"date-parts":[[2026,1]]}},"alternative-id":["axioms15010007"],"URL":"https:\/\/doi.org\/10.3390\/axioms15010007","relation":{},"ISSN":["2075-1680"],"issn-type":[{"type":"electronic","value":"2075-1680"}],"subject":[],"published":{"date-parts":[[2025,12,24]]}}}