{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T09:50:11Z","timestamp":1767261011894,"version":"3.41.0"},"reference-count":41,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2025,4,7]],"date-time":"2025-04-07T00:00:00Z","timestamp":1743984000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2025,4,7]],"date-time":"2025-04-07T00:00:00Z","timestamp":1743984000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/501100001809","name":"Hong Kong Research Grants Council","doi-asserted-by":"publisher","award":["PolyU153001\/22p"],"award-info":[{"award-number":["PolyU153001\/22p"]}],"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":["11901414","11871359"],"award-info":[{"award-number":["11901414","11871359"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100004377","name":"The Hong Kong Polytechnic University","doi-asserted-by":"crossref","id":[{"id":"10.13039\/501100004377","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Comput Optim Appl"],"published-print":{"date-parts":[[2025,7]]},"abstract":"Abstract<\/jats:title>\n We revisit and adapt the extended sequential quadratic method (ESQM) in Auslender (J Optim Theory Appl 156:183\u2013212, 2013) for solving a class of difference-of-convex optimization problems whose constraints are defined as the intersection of level sets of Lipschitz differentiable functions and a simple compact convex set. Particularly, for this class of problems, we develop a variant of ESQM, called ESQM with extrapolation (\n \n $$\\hbox {ESQM}_{\\textrm{e}}$$<\/jats:tex-math>\n \n \n ESQM<\/mml:mtext>\n e<\/mml:mtext>\n <\/mml:msub>\n <\/mml:math>\n <\/jats:alternatives>\n <\/jats:inline-formula>), which incorporates Nesterov\u2019s extrapolation techniques for empirical acceleration. Under standard constraint qualifications, we show that the sequence generated by \n \n $$\\hbox {ESQM}_{\\textrm{e}}$$<\/jats:tex-math>\n \n \n ESQM<\/mml:mtext>\n e<\/mml:mtext>\n <\/mml:msub>\n <\/mml:math>\n <\/jats:alternatives>\n <\/jats:inline-formula> clusters at a critical point if the extrapolation parameters are uniformly bounded above by a certain threshold. Convergence of the whole sequence and the convergence rate are established by assuming Kurdyka-\u0141ojasiewicz (KL) property of a suitable potential function and imposing additional differentiability assumptions on the objective and constraint functions. In addition, when the objective and constraint functions are all convex, we show that linear convergence can be established if a certain exact penalty function is known to be a KL function with exponent \n \n $$\\frac{1}{2}$$<\/jats:tex-math>\n \n \n 1<\/mml:mn>\n 2<\/mml:mn>\n <\/mml:mfrac>\n <\/mml:math>\n <\/jats:alternatives>\n <\/jats:inline-formula>; we also discuss how the KL exponent of such an exact penalty function can be deduced from that of the original<\/jats:italic> extended objective (i.e., sum of the objective and the indicator function of the constraint set). Finally, we perform numerical experiments to demonstrate the empirical acceleration of \n \n $$\\hbox {ESQM}_{\\textrm{e}}$$<\/jats:tex-math>\n \n \n ESQM<\/mml:mtext>\n e<\/mml:mtext>\n <\/mml:msub>\n <\/mml:math>\n <\/jats:alternatives>\n <\/jats:inline-formula> over a basic version of ESQM, and illustrate its effectiveness by comparing with the natural competing algorithm \n \n $$\\hbox {SCP}_{\\textrm{ls}}$$<\/jats:tex-math>\n \n \n SCP<\/mml:mtext>\n ls<\/mml:mtext>\n <\/mml:msub>\n <\/mml:math>\n <\/jats:alternatives>\n <\/jats:inline-formula> from Yu et al. (SIAM J Optim 31:2024\u20132054, 2021).\n<\/jats:p>","DOI":"10.1007\/s10589-025-00680-1","type":"journal-article","created":{"date-parts":[[2025,4,7]],"date-time":"2025-04-07T19:10:33Z","timestamp":1744053033000},"page":"1185-1225","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["An extended sequential quadratic method with extrapolation"],"prefix":"10.1007","volume":"91","author":[{"given":"Yongle","family":"Zhang","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5862-2986","authenticated-orcid":false,"given":"Ting Kei","family":"Pong","sequence":"additional","affiliation":[]},{"given":"Shiqi","family":"Xu","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2025,4,7]]},"reference":[{"key":"680_CR1","doi-asserted-by":"publisher","first-page":"269","DOI":"10.1137\/16M1058200","volume":"27","author":"S Adachi","year":"2017","unstructured":"Adachi, S., Iwata, S., Nakatsukasa, Y., Takeda, A.: Solving the trust-region subproblem by a generalized eigenvalue problem. SIAM J. Optim. 27, 269\u2013291 (2017)","journal-title":"SIAM J. Optim."},{"key":"680_CR2","doi-asserted-by":"publisher","first-page":"438","DOI":"10.1287\/moor.1100.0449","volume":"35","author":"H Attouch","year":"2010","unstructured":"Attouch, H., Bolte, J., Redont, P., Soubeyran, A.: Proximal alternating minimization and projection methods for nonconvex problems: an approach based on the Kurdyka-\u0141ojasiewicz inequality. Math. Oper. Res. 35, 438\u2013457 (2010)","journal-title":"Math. Oper. Res."},{"key":"680_CR3","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1007\/s10107-011-0484-9","volume":"137","author":"H Attouch","year":"2013","unstructured":"Attouch, H., Bolte, J., Svaiter, B.F.: Convergence of descent methods for semi-algebraic and tame problems: proximal algorithms, forward-backward splitting, and regularized Gauss-Seidel methods. Math. Program. 137, 91\u2013129 (2013)","journal-title":"Math. Program."},{"key":"680_CR4","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1007\/s10957-012-0145-z","volume":"156","author":"A Auslender","year":"2013","unstructured":"Auslender, A.: An extended sequential quadratically constrained quadratic programming algorithm for nonlinear, semidefinite, and second-order cone programming. J. Optim. Theory Appl. 156, 183\u2013212 (2013)","journal-title":"J. Optim. Theory Appl."},{"key":"680_CR5","doi-asserted-by":"publisher","first-page":"3232","DOI":"10.1137\/090763317","volume":"20","author":"A Auslender","year":"2010","unstructured":"Auslender, A., Shefi, B., Teboulle, M.: A moving balls approximation method for a class of smooth constrained minimization problems. SIAM J. Optim. 20, 3232\u20133259 (2010)","journal-title":"SIAM J. Optim."},{"key":"680_CR6","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1007\/s101070050083","volume":"86","author":"HH Bauschke","year":"1999","unstructured":"Bauschke, H.H., Borwein, J.M., Li, W.: Strong conical hull intersection property, bounded linear regularity, Jameson\u2019s property (G), and error bounds in convex optimization. Math. Program. 86, 135\u2013160 (1999)","journal-title":"Math. Program."},{"key":"680_CR7","doi-asserted-by":"publisher","first-page":"2419","DOI":"10.1109\/TIP.2009.2028250","volume":"18","author":"A Beck","year":"2009","unstructured":"Beck, A., Teboulle, M.: Fast gradient-based algorithms for constrained total variation image denoising and deblurring problems. IEEE Trans. Image Process. 18, 2419\u20132434 (2009)","journal-title":"IEEE Trans. Image Process."},{"key":"680_CR8","doi-asserted-by":"publisher","first-page":"165","DOI":"10.1007\/s12532-011-0029-5","volume":"3","author":"SR Becker","year":"2011","unstructured":"Becker, S.R., Cand\u00e8s, E.J., Grant, M.C.: Templates for convex cone problems with applications to sparse signal recovery. Math. Program. Comput. 3, 165\u2013218 (2011)","journal-title":"Math. Program. Comput."},{"key":"680_CR9","doi-asserted-by":"publisher","first-page":"1205","DOI":"10.1137\/050644641","volume":"17","author":"J Bolte","year":"2007","unstructured":"Bolte, J., Daniilidis, A., Lewis, A.: The \u0141ojasiewicz inequality for nonsmooth subanalytic functions with applications to subgradient dynamical systems. SIAM J. Optim. 17, 1205\u20131223 (2007)","journal-title":"SIAM J. Optim."},{"key":"680_CR10","doi-asserted-by":"publisher","first-page":"556","DOI":"10.1137\/060670080","volume":"18","author":"J Bolte","year":"2007","unstructured":"Bolte, J., Daniilidis, A., Lewis, A., Shiota, M.: Clarke subgradients of stratifiable functions. SIAM J. Optim. 18, 556\u2013572 (2007)","journal-title":"SIAM J. Optim."},{"key":"680_CR11","doi-asserted-by":"publisher","first-page":"471","DOI":"10.1007\/s10107-016-1091-6","volume":"165","author":"J Bolte","year":"2017","unstructured":"Bolte, J., Nguyen, T.P., Peypouquet, J., Suter, B.W.: From error bounds to the complexity of first-order descent methods for convex functions. Math. Program. 165, 471\u2013507 (2017)","journal-title":"Math. Program."},{"key":"680_CR12","doi-asserted-by":"publisher","first-page":"442","DOI":"10.1287\/moor.2015.0735","volume":"41","author":"J Bolte","year":"2016","unstructured":"Bolte, J., Pauwels, E.: Majorization-minimization procedures and convergence of SQP methods for semi-algebraic and tame programs. Math. Oper. Res. 41, 442\u2013465 (2016)","journal-title":"Math. Oper. Res."},{"key":"680_CR13","doi-asserted-by":"publisher","first-page":"459","DOI":"10.1007\/s10107-013-0701-9","volume":"146","author":"J Bolte","year":"2014","unstructured":"Bolte, J., Sabach, S., Teboulle, M.: Proximal alternating linearized minimization for nonconvex and nonsmooth problems. Math. Program. 146, 459\u2013494 (2014)","journal-title":"Math. Program."},{"key":"680_CR14","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/S0377-0427(00)00360-5","volume":"122","author":"C Brezinski","year":"2000","unstructured":"Brezinski, C.: Convergence acceleration during the 20th century. J. Comput. Appl. Math. 122, 1\u201321 (2000)","journal-title":"J. Comput. Appl. Math."},{"key":"680_CR15","doi-asserted-by":"publisher","first-page":"589","DOI":"10.1016\/j.crma.2008.03.014","volume":"346","author":"EJ Cand\u00e8s","year":"2008","unstructured":"Cand\u00e8s, E.J.: The restricted isometry property and its implications for compressed sensing. C.R. Math. 346, 589\u2013592 (2008)","journal-title":"C.R. Math."},{"key":"680_CR16","doi-asserted-by":"publisher","first-page":"392","DOI":"10.1109\/JSTSP.2009.2039177","volume":"4","author":"RE Carrillo","year":"2010","unstructured":"Carrillo, R.E., Barner, K.E., Aysal, T.C.: Robust sampling and reconstruction methods for sparse signals in the presence of impulsive noise. IEEE J. Sel. Top. Signal Process. 4, 392\u2013408 (2010)","journal-title":"IEEE J. Sel. Top. Signal Process."},{"key":"680_CR17","doi-asserted-by":"publisher","first-page":"1465","DOI":"10.1137\/15M1028054","volume":"26","author":"X Chen","year":"2016","unstructured":"Chen, X., Lu, Z., Pong, T.K.: Penalty methods for a class of non-Lipschitz optimization problems. SIAM J. Optim. 26, 1465\u20131492 (2016)","journal-title":"SIAM J. Optim."},{"key":"680_CR18","doi-asserted-by":"publisher","first-page":"715","DOI":"10.1007\/s10208-013-9150-3","volume":"15","author":"B O\u2019Donoghue","year":"2015","unstructured":"O\u2019Donoghue, B., Cand\u00e8s, E.J.: Adaptive restart for accelerated gradient schemes. Found. Comput. Math. 15, 715\u2013732 (2015)","journal-title":"Found. Comput. Math."},{"key":"680_CR19","doi-asserted-by":"publisher","first-page":"2010","DOI":"10.1137\/13090540X","volume":"6","author":"E Esser","year":"2013","unstructured":"Esser, E., Lou, Y., Xin, J.: A method for finding structured sparse solutions to non-negative least squares problems with applications. SIAM J. Imag. Sci. 6, 2010\u20132046 (2013)","journal-title":"SIAM J. Imag. Sci."},{"key":"680_CR20","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1007\/978-1-4614-1927-3_6","volume-title":"Mixed Integer Nonlinear Programming","author":"PE Gill","year":"2012","unstructured":"Gill, P.E., Wong, E.: Sequential quadratic programming methods. In: Lee, J., Leyffer, S. (eds.) Mixed Integer Nonlinear Programming, pp. 147\u2013224. Springer, New York (2012)"},{"key":"680_CR21","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1016\/S0377-0427(00)00403-9","volume":"123","author":"A Hadjidimos","year":"2000","unstructured":"Hadjidimos, A.: Successive overrelaxation (SOR) and related methods. J. Comput. Appl. Math. 123, 177\u2013199 (2000)","journal-title":"J. Comput. Appl. Math."},{"key":"680_CR22","doi-asserted-by":"publisher","DOI":"10.1002\/9781118548387","volume-title":"Applied Logistic Regression","author":"JDW Hosmer","year":"2013","unstructured":"Hosmer, J.D.W., Lemeshow, S., Sturdivant, R.X.: Applied Logistic Regression, 3rd edn. Wiley, Hoboken (2013)","edition":"3"},{"key":"680_CR23","doi-asserted-by":"publisher","first-page":"1199","DOI":"10.1007\/s10208-017-9366-8","volume":"18","author":"G Li","year":"2018","unstructured":"Li, G., Pong, T.K.: Calculus of the exponent of Kurdyka-\u0141ojasiewicz inequality and its applications to linear convergence of first-order methods. Found. Comput. Math. 18, 1199\u20131232 (2018)","journal-title":"Found. Comput. Math."},{"key":"680_CR24","doi-asserted-by":"publisher","first-page":"3345","DOI":"10.1137\/19M1291388","volume":"30","author":"F Lieder","year":"2020","unstructured":"Lieder, F.: Solving large scale cubic regularization by a generalized eigenvalue problem. SIAM J. Optim. 30, 3345\u20133358 (2020)","journal-title":"SIAM J. Optim."},{"key":"680_CR25","doi-asserted-by":"publisher","first-page":"964","DOI":"10.1137\/0716071","volume":"16","author":"PL Lions","year":"1979","unstructured":"Lions, P.L., Mercier, B.: Splitting algorithms for the sum of two nonlinear operators. SIAM J. Numer. Anal. 16, 964\u2013979 (1979)","journal-title":"SIAM J. Numer. Anal."},{"issue":"1","key":"680_CR26","doi-asserted-by":"publisher","first-page":"178","DOI":"10.1007\/s10915-014-9930-1","volume":"64","author":"Y Lou","year":"2015","unstructured":"Lou, Y., Yin, P., He, Q., Xin, J.: Computing sparse representation in a highly coherent dictionary based on difference of L1 and L2. J. Sci. Comput. 64(1), 178\u2013196 (2015)","journal-title":"J. Sci. Comput."},{"key":"680_CR27","doi-asserted-by":"publisher","first-page":"273","DOI":"10.1007\/s10589-013-9635-7","volume":"58","author":"TK Pong","year":"2014","unstructured":"Pong, T.K., Wolkowicz, H.: The generalized trust region subproblem. Comput. Optim. Appl. 58, 273\u2013322 (2014)","journal-title":"Comput. Optim. Appl."},{"key":"680_CR28","first-page":"543","volume":"269","author":"Y Nesterov","year":"1983","unstructured":"Nesterov, Y.: A method for unconstrained convex minimization problem with the rate of convergence O ($$\\frac{1}{k^2}$$). Doklady AN USSR 269, 543\u2013547 (1983)","journal-title":"Doklady AN USSR"},{"key":"680_CR29","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4419-8853-9","volume-title":"Introductory Lectures on Convex Optimization: A Basic Course","author":"Y Nesterov","year":"2004","unstructured":"Nesterov, Y.: Introductory Lectures on Convex Optimization: A Basic Course. Kluwer Academic Publishers, Boston (2004)"},{"key":"680_CR30","doi-asserted-by":"publisher","first-page":"127","DOI":"10.1007\/s10107-004-0552-5","volume":"103","author":"Y Nesterov","year":"2005","unstructured":"Nesterov, Y.: Smooth minimization of non-smooth functions. Math. Program. 103, 127\u2013152 (2005)","journal-title":"Math. Program."},{"key":"680_CR31","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1007\/s10107-012-0629-5","volume":"140","author":"Y Nesterov","year":"2013","unstructured":"Nesterov, Y.: Gradient methods for minimizing composite objective function. Math. Program. 140, 125\u2013161 (2013)","journal-title":"Math. Program."},{"issue":"5","key":"680_CR32","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0041-5553(64)90137-5","volume":"4","author":"BT Polyak","year":"1964","unstructured":"Polyak, B.T.: Some methods of speeding up the convergence of iteration methods. USSR Comput. Math. Math. Phys. 4(5), 1\u201317 (1964)","journal-title":"USSR Comput. Math. Math. Phys."},{"key":"680_CR33","doi-asserted-by":"publisher","first-page":"271","DOI":"10.1137\/0313015","volume":"13","author":"SM Robinson","year":"1975","unstructured":"Robinson, S.M.: An application of error bounds for convex programming in a linear space. SIAM J. Control 13, 271\u2013273 (1975)","journal-title":"SIAM J. Control"},{"key":"680_CR34","doi-asserted-by":"publisher","DOI":"10.1515\/9781400873173","volume-title":"Convex Analysis","author":"RT Rockafellar","year":"1970","unstructured":"Rockafellar, R.T.: Convex Analysis. Princeton University Press, Princeton (1970)"},{"key":"680_CR35","volume-title":"Variational Analysis","author":"RT Rockafellar","year":"1997","unstructured":"Rockafellar, R.T., Wets, R.J.-B.: Variational Analysis. Springer, Berlin (1997)"},{"key":"680_CR36","doi-asserted-by":"publisher","first-page":"199","DOI":"10.1137\/1029042","volume":"29","author":"DA Smith","year":"1987","unstructured":"Smith, D.A., Ford, W.F., Sidi, A.: Extrapolation methods for vector sequences. SIAM Rev. 29, 199\u2013233 (1987)","journal-title":"SIAM Rev."},{"key":"680_CR37","doi-asserted-by":"publisher","first-page":"124","DOI":"10.1137\/16M1055323","volume":"27","author":"B Wen","year":"2017","unstructured":"Wen, B., Chen, X., Pong, T.K.: Linear convergence of proximal gradient algorithm with extrapolation for a class of nonconvex nonsmooth minimization problems. SIAM J. Optim. 27, 124\u2013145 (2017)","journal-title":"SIAM J. Optim."},{"key":"680_CR38","doi-asserted-by":"publisher","first-page":"297","DOI":"10.1007\/s10589-017-9954-1","volume":"69","author":"B Wen","year":"2018","unstructured":"Wen, B., Chen, X., Pong, T.K.: A proximal difference-of-convex algorithm with extrapolation. Comput. Optim. Appl. 69, 297\u2013324 (2018)","journal-title":"Comput. Optim. Appl."},{"key":"680_CR39","doi-asserted-by":"publisher","first-page":"A536","DOI":"10.1137\/140952363","volume":"37","author":"P Yin","year":"2015","unstructured":"Yin, P., Lou, Y., He, Q., Xin, J.: Minimization of $$\\ell _{1-2}$$ for compressed sensing. SIAM J. Sci. Comput. 37, A536\u2013A563 (2015)","journal-title":"SIAM J. Sci. Comput."},{"key":"680_CR40","doi-asserted-by":"publisher","first-page":"2024","DOI":"10.1137\/20M1314057","volume":"31","author":"P Yu","year":"2021","unstructured":"Yu, P., Pong, T.K., Lu, Z.: Convergence rate analysis of a sequential convex programming method with line search for a class of constrained difference-of-convex optimization problems. SIAM J. Optim. 31, 2024\u20132054 (2021)","journal-title":"SIAM J. Optim."},{"key":"680_CR41","doi-asserted-by":"publisher","first-page":"8","DOI":"10.1007\/s10444-022-10002-2","volume":"49","author":"Y Zhang","year":"2023","unstructured":"Zhang, Y., Li, G., Pong, T.K., Xu, S.: Retraction-based first-order feasible methods for difference-of-convex programs with smooth inequality and simple geometric constraints. Adv. Comput. Math. 49, 8 (2023)","journal-title":"Adv. Comput. Math."}],"container-title":["Computational Optimization and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-025-00680-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10589-025-00680-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-025-00680-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,9]],"date-time":"2025-06-09T23:01:47Z","timestamp":1749510107000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10589-025-00680-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,4,7]]},"references-count":41,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2025,7]]}},"alternative-id":["680"],"URL":"https:\/\/doi.org\/10.1007\/s10589-025-00680-1","relation":{},"ISSN":["0926-6003","1573-2894"],"issn-type":[{"type":"print","value":"0926-6003"},{"type":"electronic","value":"1573-2894"}],"subject":[],"published":{"date-parts":[[2025,4,7]]},"assertion":[{"value":"24 December 2023","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"17 March 2025","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"7 April 2025","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The second author is an editorial board member of this journal.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}