{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,25]],"date-time":"2026-04-25T03:38:51Z","timestamp":1777088331417,"version":"3.51.4"},"reference-count":51,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T00:00:00Z","timestamp":1775001600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T00:00:00Z","timestamp":1775001600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Glob Optim"],"published-print":{"date-parts":[[2026,4]]},"DOI":"10.1007\/s10898-026-01609-6","type":"journal-article","created":{"date-parts":[[2026,4,4]],"date-time":"2026-04-04T01:10:57Z","timestamp":1775265057000},"page":"1137-1166","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Outer approximation scheme for weakly convex constrained optimization problems"],"prefix":"10.1007","volume":"94","author":[{"given":"Ewa M.","family":"Bednarczuk","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2538-0762","authenticated-orcid":false,"given":"Giovanni","family":"Bruccola","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jean-Christophe","family":"Pesquet","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Krzysztof","family":"Rutkowski","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2026,4,4]]},"reference":[{"key":"1609_CR1","unstructured":"Jourani, A.: Subdifferentiability and subdifferential monotonicity of-paraconvex functions. Control and Cybernetics 25(4) (1996)"},{"key":"1609_CR2","volume-title":"Foundations of Mathematical Optimization: Convex Analysis Without Linearity","author":"DE Pallaschke","year":"2013","unstructured":"Pallaschke, D.E., Rolewicz, S.: Foundations of Mathematical Optimization: Convex Analysis Without Linearity, vol. 388. Springer, Dordrecht (2013)"},{"key":"1609_CR3","volume-title":"Abstract Convexity and Global Optimization","author":"AM Rubinov","year":"2013","unstructured":"Rubinov, A.M.: Abstract Convexity and Global Optimization, vol. 44. Springer, Boston (2013)"},{"key":"1609_CR4","volume-title":"Abstract Convex Analysis","author":"I Singer","year":"1997","unstructured":"Singer, I.: Abstract Convex Analysis. John Wiley & Sons, Oxford (1997)"},{"issue":"1","key":"1609_CR5","doi-asserted-by":"publisher","first-page":"89","DOI":"10.1137\/21M1465445","volume":"33","author":"F Atenas","year":"2023","unstructured":"Atenas, F., Sagastiz\u00e0bal, C., Silva, P.J.S., Solodov, M.: A unified analysis of descent sequences in weakly convex optimization, including convergence rates for bundle methods. SIAM J. Optim. 33(1), 89\u2013115 (2023). https:\/\/doi.org\/10.1137\/21M1465445","journal-title":"SIAM J. Optim."},{"key":"1609_CR6","doi-asserted-by":"publisher","first-page":"628","DOI":"10.1007\/s10957-020-01800-z","volume":"188","author":"A B\u00f6hm","year":"2021","unstructured":"B\u00f6hm, A., Wright, S.J.: Variable smoothing for weakly convex composite functions. J. Optim. Theory Appl. 188, 628\u2013649 (2021)","journal-title":"J. Optim. Theory Appl."},{"key":"1609_CR7","unstructured":"Khanh, P.D., Mordukhovich, B., Phat, V.T., Tran, D.B.: Inexact proximal methods for weakly convex functions. arXiv2307.15596 (2023) arXiv:2307.15596 [math.OC]"},{"issue":"2","key":"1609_CR8","doi-asserted-by":"publisher","first-page":"538","DOI":"10.1137\/S036301299732626X","volume":"38","author":"PL Combettes","year":"2000","unstructured":"Combettes, P.L.: Strong convergence of block-iterative outer approximation methods for convex optimization. SIAM J. Control. Optim. 38(2), 538\u2013565 (2000)","journal-title":"SIAM J. Control. Optim."},{"issue":"9","key":"1609_CR9","doi-asserted-by":"publisher","first-page":"1213","DOI":"10.1109\/TIP.2004.832922","volume":"13","author":"PL Combettes","year":"2004","unstructured":"Combettes, P.L., Pesquet, J.-C.: Image restoration subject to a total variation constraint. IEEE Trans. Image Process. 13(9), 1213\u20131222 (2004)","journal-title":"IEEE Trans. Image Process."},{"issue":"1","key":"1609_CR10","doi-asserted-by":"publisher","first-page":"321","DOI":"10.1007\/s10107-016-0985-7","volume":"160","author":"Y Drori","year":"2016","unstructured":"Drori, Y., Teboulle, M.: An optimal variant of Kelley\u2019s cutting-plane method. Math. Program. 160(1), 321\u2013351 (2016)","journal-title":"Math. Program."},{"issue":"4","key":"1609_CR11","doi-asserted-by":"publisher","first-page":"703","DOI":"10.1137\/0108053","volume":"8","author":"JE Kelley Jr","year":"1960","unstructured":"Kelley, J.E., Jr.: The cutting-plane method for solving convex programs. J. Soc. Ind. Appl. Math. 8(4), 703\u2013712 (1960)","journal-title":"J. Soc. Ind. Appl. Math."},{"key":"1609_CR12","doi-asserted-by":"crossref","unstructured":"Cegielski, A., Censor, Y.: Opial-type theorems and the common fixed point problem. Fixed-Point Algorithms for Inverse Problems in Science and Engineering, 155\u2013183 (2011)","DOI":"10.1007\/978-1-4419-9569-8_9"},{"key":"1609_CR13","doi-asserted-by":"crossref","unstructured":"Combettes, P.L.: Quasi-Fej\u00e9rian analysis of some optimization algorithms. In: Studies in Computational Mathematics vol. 8, pp. 115\u2013152. Elsevier, New York (2001)","DOI":"10.1016\/S1570-579X(01)80010-0"},{"issue":"2","key":"1609_CR14","first-page":"587","volume":"16","author":"Y Censor","year":"2009","unstructured":"Censor, Y., Segal, A.: The split common fixed point problem for directed operators. J. Convex Anal. 16(2), 587\u2013600 (2009)","journal-title":"J. Convex Anal."},{"key":"1609_CR15","volume-title":"Algorithmic Developments for the Convex Feasibility Problem","author":"M Zaknoon","year":"2003","unstructured":"Zaknoon, M.: Algorithmic Developments for the Convex Feasibility Problem. University of Haifa, Israel (2003)"},{"issue":"1","key":"1609_CR16","doi-asserted-by":"publisher","first-page":"105","DOI":"10.1007\/BF01585731","volume":"46","author":"KC Kiwiel","year":"1990","unstructured":"Kiwiel, K.C.: Proximity control in bundle methods for convex nondifferentiable minimization. Math. Program. 46(1), 105\u2013122 (1990)","journal-title":"Math. Program."},{"key":"1609_CR17","doi-asserted-by":"publisher","first-page":"593","DOI":"10.1023\/A:1022650107080","volume":"102","author":"L Luk\u0161an","year":"1999","unstructured":"Luk\u0161an, L., Vl\u010dek, J.: Globally convergent variable metric method for convex nonsmooth unconstrained minimization1. J. Optim. Theory Appl. 102, 593\u2013613 (1999)","journal-title":"J. Optim. Theory Appl."},{"key":"1609_CR18","doi-asserted-by":"crossref","unstructured":"Bienstock, D., Chen, C., Munoz, G.: Intersection cuts for polynomial optimization. In: International Conference on Integer Programming and Combinatorial Optimization, pp. 72\u201387 (2019). Springer","DOI":"10.1007\/978-3-030-17953-3_6"},{"issue":"1","key":"1609_CR19","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1007\/BF01443618","volume":"18","author":"H Tuy","year":"1988","unstructured":"Tuy, H., Van Thuong, N.: On the global minimization of a convex function under general nonconvex constraints. Appl. Math. Optim. 18(1), 119\u2013142 (1988)","journal-title":"Appl. Math. Optim."},{"issue":"1","key":"1609_CR20","doi-asserted-by":"publisher","first-page":"156","DOI":"10.1007\/s10957-009-9590-8","volume":"144","author":"S Yamada","year":"2010","unstructured":"Yamada, S., Tanaka, T., Tanino, T.: Outer approximation method incorporating a quadratic approximation for a dc programming problem. J. Optim. Theory Appl. 144(1), 156\u2013183 (2010)","journal-title":"J. Optim. Theory Appl."},{"issue":"1","key":"1609_CR21","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1137\/18M1178244","volume":"29","author":"D Davis","year":"2019","unstructured":"Davis, D., Drusvyatskiy, D.: Stochastic model-based minimization of weakly convex functions. SIAM J. Optim. 29(1), 207\u2013239 (2019)","journal-title":"SIAM J. Optim."},{"issue":"1","key":"1609_CR22","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1186\/s13660-019-1955-4","volume":"2019","author":"T Zhang","year":"2019","unstructured":"Zhang, T., Shen, Z.: A fundamental proof of convergence of alternating direction method of multipliers for weakly convex optimization. Journal of Inequalities and Applications 2019(1), 1\u201321 (2019)","journal-title":"Journal of Inequalities and Applications"},{"key":"1609_CR23","doi-asserted-by":"crossref","unstructured":"Liu, Q., Gu, Y., So, H.C.: D.O.A. estimation in impulsive noise via low-rank matrix approximation and weakly convex optimization. IEEE Trans. Aerosp. Electron. Syst. 55(6), 3603\u20133616 (2019)","DOI":"10.1109\/TAES.2019.2909728"},{"issue":"6","key":"1609_CR24","doi-asserted-by":"publisher","first-page":"1597","DOI":"10.1109\/TSP.2015.2502551","volume":"64","author":"I Bayram","year":"2015","unstructured":"Bayram, I.: On the convergence of the iterative shrinkage\/thresholding algorithm with a weakly convex penalty. IEEE Trans. Signal Process. 64(6), 1597\u20131608 (2015)","journal-title":"IEEE Trans. Signal Process."},{"issue":"2","key":"1609_CR25","doi-asserted-by":"publisher","first-page":"827","DOI":"10.1137\/140976601","volume":"8","author":"T M\u00f6llenhoff","year":"2015","unstructured":"M\u00f6llenhoff, T., Strekalovskiy, E., Moeller, M., Cremers, D.: The primal-dual hybrid gradient method for semiconvex splittings. SIAM J. Imag. Sci. 8(2), 827\u2013857 (2015)","journal-title":"SIAM J. Imag. Sci."},{"key":"1609_CR26","doi-asserted-by":"crossref","unstructured":"Nikolova, M.: Estimation of binary images by minimizing convex criteria. In: Proceedings 1998 International Conference on Image Processing. ICIP98 (Cat. No. 98CB36269), vol. 2, pp. 108\u2013112 (1998). IEEE","DOI":"10.1109\/ICIP.1998.723327"},{"issue":"6","key":"1609_CR27","doi-asserted-by":"publisher","first-page":"825","DOI":"10.1007\/s10851-019-00937-5","volume":"62","author":"I Selesnick","year":"2020","unstructured":"Selesnick, I., Lanza, A., Morigi, S., Sgallari, F.: Non-convex total variation regularization for convex denoising of signals. Journal of Mathematical Imaging and Vision 62(6), 825\u2013841 (2020)","journal-title":"Journal of Mathematical Imaging and Vision"},{"issue":"3","key":"1609_CR28","doi-asserted-by":"publisher","first-page":"1087","DOI":"10.1080\/10556788.2021.1895152","volume":"37","author":"H Rafique","year":"2022","unstructured":"Rafique, H., Liu, M., Lin, Q., Yang, T.: Weakly-convex-concave min-max optimization: provable algorithms and applications in machine learning. Optimization Methods and Software 37(3), 1087\u20131121 (2022)","journal-title":"Optimization Methods and Software"},{"issue":"1","key":"1609_CR29","doi-asserted-by":"publisher","first-page":"113","DOI":"10.1016\/j.jmaa.2010.04.039","volume":"371","author":"MV Balashov","year":"2010","unstructured":"Balashov, M.V., Repov\u0161, D.: Weakly convex sets and modulus of nonconvexity. J. Math. Anal. Appl. 371(1), 113\u2013127 (2010). https:\/\/doi.org\/10.1016\/j.jmaa.2010.04.039","journal-title":"J. Math. Anal. Appl."},{"key":"1609_CR30","doi-asserted-by":"publisher","unstructured":"Lopushanski, M.: Weakly convex sets in asymmetric seminormed spaces and their properties: Uniform continuity of multifunction intersection. In: 2018 International Conference on Applied Mathematics & Computer Science (ICAMCS), pp. 10\u2013107 (2018). https:\/\/doi.org\/10.1109\/ICAMCS46079.2018.00010","DOI":"10.1109\/ICAMCS46079.2018.00010"},{"issue":"1","key":"1609_CR31","doi-asserted-by":"publisher","first-page":"215","DOI":"10.1007\/s10107-021-01742-y","volume":"197","author":"D Boob","year":"2023","unstructured":"Boob, D., Deng, Q., Lan, G.: Stochastic first-order methods for convex and nonconvex functional constrained optimization. Math. Program. 197(1), 215\u2013279 (2023)","journal-title":"Math. Program."},{"key":"1609_CR32","unstructured":"Ma, R., Lin, Q., Yang, T.: Quadratically regularized subgradient methods for weakly convex optimization with weakly convex constraints. In: International Conference on Machine Learning, pp. 6554\u20136564 (2020). PMLR"},{"key":"1609_CR33","doi-asserted-by":"publisher","DOI":"10.1007\/b138356","volume-title":"Semiconcave Functions, Hamilton-Jacobi Equations, and Optimal Control","author":"P Cannarsa","year":"2004","unstructured":"Cannarsa, P., Sinestrari, C.: Semiconcave Functions, Hamilton-Jacobi Equations, and Optimal Control, vol. 58. Springer, Boston (2004)"},{"key":"1609_CR34","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-48311-5","volume-title":"Convex Analysis and Monotone Operator Theory in Hilbert Spaces","author":"HH Bauschke","year":"2017","unstructured":"Bauschke, H.H., Combettes, P.L.: Convex Analysis and Monotone Operator Theory in Hilbert Spaces. Springer, Berlin (2017)"},{"key":"1609_CR35","doi-asserted-by":"publisher","unstructured":"Bednarczuk, E.M., Bruccola, G.: On global solvability of a class of possibly nonconvex qcqp problems in Hilbert spaces. Optimization , 1\u201320 (2023). https:\/\/doi.org\/10.1080\/02331934.2023.2281640","DOI":"10.1080\/02331934.2023.2281640"},{"issue":"1","key":"1609_CR36","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1137\/1038003","volume":"38","author":"L Vandenberghe","year":"1996","unstructured":"Vandenberghe, L., Boyd, S.: Semidefinite programming. SIAM review 38(1), 49\u201395 (1996)","journal-title":"Semidefinite programming. SIAM review"},{"key":"1609_CR37","doi-asserted-by":"crossref","unstructured":"Ben-Tal, A., Den\u00a0Hertog, D., Laurent, M.: Hidden Convexity in Partially Separable Optimization. , Technical Report 2011-70, Tilburg University, Center for Economic Research (2011)","DOI":"10.2139\/ssrn.1865208"},{"issue":"1","key":"1609_CR38","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1007\/BF02592331","volume":"72","author":"A Ben-Tal","year":"1996","unstructured":"Ben-Tal, A., Teboulle, M.: Hidden convexity in some nonconvex quadratically constrained quadratic programming. Math. Program. 72(1), 51\u201363 (1996)","journal-title":"Math. Program."},{"key":"1609_CR39","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1007\/s10107-011-0462-2","volume":"129","author":"X Bao","year":"2011","unstructured":"Bao, X., Sahinidis, N.V., Tawarmalani, M.: Semidefinite relaxations for quadratically constrained quadratic programming: A review and comparisons. Math. Program. 129, 129\u2013157 (2011)","journal-title":"Math. Program."},{"key":"1609_CR40","doi-asserted-by":"crossref","unstructured":"Shapiro, A., Scheinberg, K.: Duality and optimality conditions. In: Handbook of Semidefinite Programming, pp. 67\u2013110. Springer, Boston (2000)","DOI":"10.1007\/978-1-4615-4381-7_4"},{"key":"1609_CR41","unstructured":"Kim, S., Kojima, M.: Equivalent sufficient conditions for global optimality of quadratically constrained quadratic program. arXiv2303.05874 (2023) arXiv:2303.05874 [math.OC]"},{"key":"1609_CR42","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1007\/BF01588787","volume":"49","author":"MJD Powell","year":"1990","unstructured":"Powell, M.J.D., Yuan, Y.: A trust region algorithm for equality constrained optimization. Math. Program. 49, 189\u2013211 (1990)","journal-title":"Math. Program."},{"issue":"3\u20134","key":"1609_CR43","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1080\/10556789308805542","volume":"2","author":"JJ Mor\u00e9","year":"1993","unstructured":"Mor\u00e9, J.J.: Generalizations of the trust region problem. Optimization methods and Software 2(3\u20134), 189\u2013209 (1993)","journal-title":"Optimization methods and Software"},{"key":"1609_CR44","doi-asserted-by":"publisher","first-page":"171","DOI":"10.1007\/s10107-013-0716-2","volume":"147","author":"V Jeyakumar","year":"2014","unstructured":"Jeyakumar, V., Li, G.: Trust-region problems with linear inequality constraints: exact SDP relaxation, global optimality and robust optimization. Math. Program. 147, 171\u2013206 (2014)","journal-title":"Math. Program."},{"key":"1609_CR45","unstructured":"Gurobi Optimization, LLC: Gurobi Optimizer Reference Manual (2023). https:\/\/www.gurobi.com"},{"key":"1609_CR46","doi-asserted-by":"crossref","unstructured":"Khachiyan, L., Boros, E., Borys, K., Gurvich, V., Elbassioni, K.: Generating all vertices of a polyhedron is hard. Twentieth Anniversary Volume: Discrete & Computational Geometry, 1\u201317 (2009)","DOI":"10.1007\/978-0-387-87363-3_17"},{"issue":"7825","key":"1609_CR47","doi-asserted-by":"publisher","first-page":"357","DOI":"10.1038\/s41586-020-2649-2","volume":"585","author":"CR Harris","year":"2020","unstructured":"Harris, C.R., Millman, K.J., Walt, S.J., Gommers, R., Virtanen, P., Cournapeau, D., Wieser, E., Taylor, J., Berg, S., Smith, N.J., Kern, R., Picus, M., Hoyer, S., Kerkwijk, M.H., Brett, M., Haldane, A., R\u00edo, J.F., Wiebe, M., Peterson, P., G\u00e9rard-Marchant, P., Sheppard, K., Reddy, T., Weckesser, W., Abbasi, H., Gohlke, C., Oliphant, T.E.: Array programming with NumPy. Nature 585(7825), 357\u2013362 (2020). https:\/\/doi.org\/10.1038\/s41586-020-2649-2","journal-title":"Nature"},{"key":"1609_CR48","volume-title":"Numerical Optimization","author":"J Nocedal","year":"2006","unstructured":"Nocedal, J., Wright, S.J.: Numerical Optimization. Springer, New York (2006)"},{"key":"1609_CR49","unstructured":"Kraft, D.: A software package for sequential quadratic programming. Forschungsbericht- Deutsche Forschungs- und Versuchsanstalt fur Luft- und Raumfahrt (1988)"},{"key":"1609_CR50","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611971217","volume-title":"Solving Least Squares Problems","author":"CL Lawson","year":"1995","unstructured":"Lawson, C.L., Hanson, R.J.: Solving Least Squares Problems. SIAM, Philadelphia (1995)"},{"key":"1609_CR51","doi-asserted-by":"publisher","unstructured":"Virtanen, P., Gommers, R., Oliphant, T.E., Haberland, M., Reddy, T., Cournapeau, D., Burovski, E., Peterson, P., Weckesser, W., Bright, J., van der Walt, S.J., Brett, M., Wilson, J., Millman, K.J., Mayorov, N., Nelson, A.R.J., Jones, E., Kern, R., Larson, E., Carey, C.J., Polat, \u0130, Feng, Y., Moore, E.W., VanderPlas, J., Laxalde, D., Perktold, J., Cimrman, R., Henriksen, I., Quintero, E.A., Harris, C.R., Archibald, A.M., Ribeiro, A.H., Pedregosa, F., van Mulbregt, P.: SciPy 1.0 Contributors: SciPy 1.0: Fundamental Algorithms for Scientific Computing in Python. Nat. Methods 17, 261\u2013272 (2020). https:\/\/doi.org\/10.1038\/s41592-019-0686-2","DOI":"10.1038\/s41592-019-0686-2"}],"container-title":["Journal of Global Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10898-026-01609-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10898-026-01609-6","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10898-026-01609-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,4,25]],"date-time":"2026-04-25T02:57:06Z","timestamp":1777085826000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10898-026-01609-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,4]]},"references-count":51,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2026,4]]}},"alternative-id":["1609"],"URL":"https:\/\/doi.org\/10.1007\/s10898-026-01609-6","relation":{},"ISSN":["0925-5001","1573-2916"],"issn-type":[{"value":"0925-5001","type":"print"},{"value":"1573-2916","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026,4]]},"assertion":[{"value":"4 November 2024","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"23 March 2026","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"4 April 2026","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}