{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,16]],"date-time":"2026-03-16T11:47:39Z","timestamp":1773661659743,"version":"3.50.1"},"reference-count":23,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2026,1,21]],"date-time":"2026-01-21T00:00:00Z","timestamp":1768953600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2026,1,21]],"date-time":"2026-01-21T00:00:00Z","timestamp":1768953600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/501100007069","name":"Universit\u00e0 della Calabria","doi-asserted-by":"crossref","id":[{"id":"10.13039\/501100007069","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Soft Comput"],"published-print":{"date-parts":[[2026,3]]},"abstract":"<jats:title>Abstract<\/jats:title>\n                  <jats:p>We investigate Difference of Convex (DC) constrained optimization problems where both the objective function and the constraints are DC and nonsmooth. The problem has applications in a variety of fields, including quadratic programs with complementarity constraints and classification in Machine Learning. We introduce the Constrained Descent-Ascent DC algorithm (CDADC) which generalizes the standard Descent-Ascent framework to incorporate DC constraints using a piecewise affine approximation strategy. The algorithm utilizes the bundle technique to construct models for both the objective and constraint functions. It solves a sequence of convex quadratic subproblems designed to balance objective improvement, proximity to the current iterate, and constraint fulfilment. CDADC avoids evaluation of the objective function\u2019s concave part and, to minimize computational effort, implements bundle resetting whenever a serious step is achieved. We demonstrate finiteness and convergence of the algorithm to a point that satisfies a criterion associated with the B-stationarity notion. The algorithm\u2019s behaviour is illustrated through a couple of numerical examples<\/jats:p>","DOI":"10.1007\/s00500-025-10979-0","type":"journal-article","created":{"date-parts":[[2026,1,21]],"date-time":"2026-01-21T10:26:55Z","timestamp":1768991215000},"page":"1561-1568","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Extending the descent-ascent algorithm to constrained difference of convex programming"],"prefix":"10.1007","volume":"30","author":[{"given":"Narges","family":"Araboljadidi","sequence":"first","affiliation":[]},{"given":"Pietro","family":"D\u2019Alessandro","sequence":"additional","affiliation":[]},{"given":"Manlio","family":"Gaudioso","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2026,1,21]]},"reference":[{"issue":"1\u20134","key":"10979_CR1","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1007\/s10479-004-5022-1","volume":"133","author":"LTH An","year":"2005","unstructured":"An LTH, Tao PD (2005) The dc (difference of convex functions) programming and dca revisited with dc models of real world nonconvex optimization problems. Ann Oper Res 133(1\u20134):23\u201346","journal-title":"Ann Oper Res"},{"issue":"2","key":"10979_CR2","doi-asserted-by":"publisher","first-page":"411","DOI":"10.1007\/s10589-021-00304-4","volume":"80","author":"AM Bagirov","year":"2021","unstructured":"Bagirov AM, Hoseini Monjezi N, Taheri S (2021) An augmented subgradient method for minimizing nonsmooth dc functions. Comput Optim Appl 80(2):411\u2013438","journal-title":"Comput Optim Appl"},{"issue":"3","key":"10979_CR3","doi-asserted-by":"publisher","first-page":"1191","DOI":"10.1007\/s10957-023-02260-x","volume":"198","author":"R Correa","year":"2023","unstructured":"Correa R, L\u00f3pez MA, P\u00e9rez-Aros P (2023) Optimality conditions in dc-constrained mathematical programming problems. J Optim Theory Appl 198(3):1191\u20131225","journal-title":"J Optim Theory Appl"},{"key":"10979_CR4","doi-asserted-by":"publisher","first-page":"679","DOI":"10.1007\/s11228-020-00566-w","volume":"28","author":"W de Oliveira","year":"2020","unstructured":"de Oliveira W (2020) The abc of dc programming. Set-Valued Var Anal 28:679\u2013706","journal-title":"Set-Valued Var Anal"},{"issue":"1","key":"10979_CR5","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1007\/s10898-019-00833-7","volume":"76","author":"MV Dolgopolik","year":"2020","unstructured":"Dolgopolik MV (2020) New global optimality conditions for nonsmooth dc optimization problems. J Glob Optim 76(1):25\u201355","journal-title":"J Glob Optim"},{"issue":"4","key":"10979_CR6","doi-asserted-by":"publisher","first-page":"668","DOI":"10.1080\/10556788.2023.2167992","volume":"38","author":"MV Dolgopolik","year":"2023","unstructured":"Dolgopolik MV (2023) Steering exact penalty dca for nonsmooth dc optimisation problems with equality and inequality constraints. Optim Methods Softw 38(4):668\u2013697","journal-title":"Optim Methods Softw"},{"issue":"2","key":"10979_CR7","doi-asserted-by":"publisher","first-page":"657","DOI":"10.1287\/ijoc.2023.0142","volume":"36","author":"P D\u2019Alessandro","year":"2024","unstructured":"D\u2019Alessandro P, Gaudioso M, Giallombardo G, Miglionico G (2024) The descent-ascent algorithm for dc programming. INFORMS J Comput 36(2):657\u2013671","journal-title":"INFORMS J Comput"},{"issue":"1","key":"10979_CR8","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s10288-019-00425-x","volume":"18","author":"M Gaudioso","year":"2020","unstructured":"Gaudioso M, Giallombardo G, Miglionico G (2020) Essentials of numerical nonsmooth optimization. 4OR 18(1):1\u201347","journal-title":"4OR"},{"key":"10979_CR9","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1007\/s10898-017-0568-z","volume":"71","author":"M Gaudioso","year":"2018","unstructured":"Gaudioso M, Giallombardo G, Miglionico G, Bagirov AM (2018) Minimizing nonsmooth dc functions via successive dc piecewise-affine approximations. J Glob Optim 71:37\u201355","journal-title":"J Glob Optim"},{"issue":"1","key":"10979_CR10","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1080\/02331939208843808","volume":"25","author":"M Gaudioso","year":"1992","unstructured":"Gaudioso M, Monaco MF (1992) Variants to the cutting plane approach for convex nondifferentiable optimization. Optim 25(1):65\u201375","journal-title":"Optim"},{"key":"10979_CR11","doi-asserted-by":"publisher","DOI":"10.3390\/a16080394","author":"M Gaudioso","year":"2023","unstructured":"Gaudioso M, Taheri S, Bagirov AM, Karmitsa N (2023) Bundle enrichment method for nonsmooth difference of convex programming problems. Algorithms. https:\/\/doi.org\/10.3390\/a16080394","journal-title":"Algorithms"},{"issue":"2","key":"10979_CR12","doi-asserted-by":"publisher","first-page":"1892","DOI":"10.1137\/16M1115733","volume":"28","author":"K Joki","year":"2018","unstructured":"Joki K, Bagirov AM, Karmitsa N, M\u00e4kela MM, Taheri S (2018) Double bundle method for finding clarke stationary points in nonsmooth dc programming. SIAM J Optim 28(2):1892\u20131919","journal-title":"SIAM J Optim"},{"issue":"2","key":"10979_CR13","doi-asserted-by":"publisher","first-page":"285","DOI":"10.1007\/s10898-023-01325-5","volume":"88","author":"C Kanzow","year":"2024","unstructured":"Kanzow C, Neder T (2024) A bundle-type method for nonsmooth dc programs. J Glob Optim 88(2):285\u2013326","journal-title":"J Glob Optim"},{"issue":"3","key":"10979_CR14","doi-asserted-by":"publisher","first-page":"627","DOI":"10.1007\/s11590-016-1031-7","volume":"11","author":"W Khalaf","year":"2017","unstructured":"Khalaf W, Astorino A, D\u2019Alessandro P, Gaudioso M (2017) A dc optimization-based clustering technique for edge detection. Optim Lett 11(3):627\u2013640","journal-title":"Optim Lett"},{"issue":"3","key":"10979_CR15","doi-asserted-by":"publisher","first-page":"509","DOI":"10.1007\/s10898-011-9765-3","volume":"52","author":"HAL Thi","year":"2012","unstructured":"Thi HAL, Dinh TP, Van Ngai H (2012) Exact penalty and error bounds in dc programming. J Global Optim 52(3):509\u2013535","journal-title":"J Global Optim"},{"key":"10979_CR16","doi-asserted-by":"crossref","unstructured":"Makela MM, Neittaanmaki P (1992) Nonsmooth optimization: analysis and algorithms with applications to optimal control. World Scientific","DOI":"10.1142\/1493"},{"issue":"1","key":"10979_CR17","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1287\/moor.2016.0795","volume":"42","author":"J-S Pang","year":"2017","unstructured":"Pang J-S, Razaviyayn M, Alvarado A (2017) Computing b-stationary points of nonsmooth dc programs. Math Oper Res 42(1):95\u2013118","journal-title":"Math Oper Res"},{"key":"10979_CR18","doi-asserted-by":"publisher","first-page":"229","DOI":"10.1007\/978-3-030-34910-3_7","volume-title":"Numerical nonsmooth optimization: state of the art algorithms","author":"AS Strekalovsky","year":"2020","unstructured":"Strekalovsky AS (2020) Local search for nonsmooth dc optimization with dc equality and inequality constraints. Numerical nonsmooth optimization: state of the art algorithms. Springer International Publishing, pp 229\u2013261"},{"key":"10979_CR19","doi-asserted-by":"publisher","first-page":"229","DOI":"10.1016\/j.apm.2017.07.031","volume":"58","author":"AS Strekalovsky","year":"2018","unstructured":"Strekalovsky AS, Minarchenko IM (2018) A local search method for optimization problem with dc inequality constraints. Appl Math Model 58:229\u2013244","journal-title":"Appl Math Model"},{"key":"10979_CR20","doi-asserted-by":"publisher","first-page":"851","DOI":"10.1016\/j.cam.2013.08.010","volume":"259","author":"AH Tor","year":"2014","unstructured":"Tor AH, Bagirov A, Karas\u00f6zen B (2014) Aggregate codifferential method for nonsmooth dc optimization. J Comput Appl Math 259:851\u2013867","journal-title":"J Comput Appl Math"},{"key":"10979_CR21","doi-asserted-by":"crossref","unstructured":"Jean-Baptiste\u00a0Hiriart Urruty and Claude Lemar\u00e9chal\u00a0(1993) Convex analysis and minimization algorithms. Springer-Verlag.\u00a0","DOI":"10.1007\/978-3-662-02796-7"},{"issue":"4","key":"10979_CR22","doi-asserted-by":"publisher","first-page":"890","DOI":"10.1080\/10556788.2019.1595619","volume":"34","author":"W van Ackooij","year":"2019","unstructured":"van Ackooij W, de Oliveira W (2019) Non-smooth dc-constrained optimization: constraint qualification and minimizing methodologies. Optim Methods Softw 34(4):890\u2013920","journal-title":"Optim Methods Softw"},{"issue":"2","key":"10979_CR23","doi-asserted-by":"publisher","first-page":"451","DOI":"10.1007\/s10589-020-00241-8","volume":"78","author":"W van Ackooij","year":"2021","unstructured":"van Ackooij W, Demassey S, Javal P, Morais H, de Oliveira W, Swaminathan B (2021) A bundle method for nonsmooth dc programming with application to chance-constrained problems. Comput Optim Appl 78(2):451\u2013490","journal-title":"Comput Optim Appl"}],"container-title":["Soft Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00500-025-10979-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00500-025-10979-0","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00500-025-10979-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,16]],"date-time":"2026-03-16T10:47:22Z","timestamp":1773658042000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00500-025-10979-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,1,21]]},"references-count":23,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2026,3]]}},"alternative-id":["10979"],"URL":"https:\/\/doi.org\/10.1007\/s00500-025-10979-0","relation":{},"ISSN":["1432-7643","1433-7479"],"issn-type":[{"value":"1432-7643","type":"print"},{"value":"1433-7479","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026,1,21]]},"assertion":[{"value":"5 March 2025","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"18 November 2025","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"21 January 2026","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 authors have no relevant financial or non-financial interests to disclose.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflicts of interest"}}]}}