{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,26]],"date-time":"2025-02-26T07:10:02Z","timestamp":1740553802117,"version":"3.38.0"},"reference-count":35,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2024,12,23]],"date-time":"2024-12-23T00:00:00Z","timestamp":1734912000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,12,23]],"date-time":"2024-12-23T00:00:00Z","timestamp":1734912000000},"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":[[2025,3]]},"DOI":"10.1007\/s10898-024-01457-2","type":"journal-article","created":{"date-parts":[[2024,12,23]],"date-time":"2024-12-23T01:50:45Z","timestamp":1734918645000},"page":"535-557","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["On generalized KKT points for the Motzkin\u2013Straus program"],"prefix":"10.1007","volume":"91","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-4757-1965","authenticated-orcid":false,"given":"Guglielmo","family":"Beretta","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8110-1791","authenticated-orcid":false,"given":"Alessandro","family":"Torcinovich","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8992-9243","authenticated-orcid":false,"given":"Marcello","family":"Pelillo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2024,12,23]]},"reference":[{"key":"1457_CR1","doi-asserted-by":"publisher","first-page":"533","DOI":"10.4153\/CJM-1965-053-6","volume":"17","author":"TS Motzkin","year":"1965","unstructured":"Motzkin, T.S., Straus, E.G.: Maxima for graphs and a new proof of a theorem of Tur\u00e1n. Can. J. Math. 17, 533\u2013540 (1965). https:\/\/doi.org\/10.4153\/CJM-1965-053-6","journal-title":"Can. J. Math."},{"issue":"4","key":"1457_CR2","first-page":"411","volume":"2","author":"M Pelillo","year":"1996","unstructured":"Pelillo, M., Jagota, A.: Feasible and infeasible maxima in a quadratic program for maximum clique. J. Artif. Neural Netw. 2(4), 411\u2013420 (1996)","journal-title":"J. Artif. Neural Netw."},{"issue":"4","key":"1457_CR3","doi-asserted-by":"publisher","first-page":"989","DOI":"10.1007\/s10898-022-01187-3","volume":"84","author":"Q Tang","year":"2022","unstructured":"Tang, Q., Zhang, X., Zhao, C., Zhao, P.: On the maxima of Motzkin\u2013Straus programs and cliques of graphs. J. Glob. Optim. 84(4), 989\u20131003 (2022). https:\/\/doi.org\/10.1007\/s10898-022-01187-3","journal-title":"J. Glob. Optim."},{"key":"1457_CR4","doi-asserted-by":"publisher","first-page":"209","DOI":"10.1080\/00207169008803851","volume":"33","author":"PM Pardalos","year":"1990","unstructured":"Pardalos, P.M., Phillips, A.T.: A global optimization approach for solving the maximum clique problem. Int. J. Comput. Math. 33, 209\u2013216 (1990). https:\/\/doi.org\/10.1080\/00207169008803851","journal-title":"Int. J. Comput. Math."},{"issue":"2","key":"1457_CR5","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1023\/A:1008230200610","volume":"10","author":"IM Bomze","year":"1997","unstructured":"Bomze, I.M.: Evolution towards the maximum clique. J. Glob. Optim. 10(2), 143\u2013164 (1997). https:\/\/doi.org\/10.1023\/A:1008230200610","journal-title":"J. Glob. Optim."},{"issue":"3","key":"1457_CR6","doi-asserted-by":"publisher","first-page":"754","DOI":"10.1287\/moor.22.3.754","volume":"22","author":"LE Gibbons","year":"1997","unstructured":"Gibbons, L.E., Hearn, D.W., Pardalos, P.M., Ramana, M.V.: Continuous characterizations of the maximum clique problem. Math. Oper. Res. 22(3), 754\u2013768 (1997). https:\/\/doi.org\/10.1287\/moor.22.3.754","journal-title":"Math. Oper. Res."},{"issue":"4","key":"1457_CR7","doi-asserted-by":"publisher","first-page":"1161","DOI":"10.1287\/moor.2018.0954","volume":"44","author":"J Hungerford","year":"2017","unstructured":"Hungerford, J., Rinaldi, F.: A general regularized continuous formulation for the maximum clique problem. Math. Oper. Res. 44(4), 1161\u20131173 (2017). https:\/\/doi.org\/10.1287\/moor.2018.0954","journal-title":"Math. Oper. Res."},{"key":"1457_CR8","doi-asserted-by":"publisher","unstructured":"Wilf, H.S.: Spectral bounds for the clique and independence numbers of graphs. J. Comb. Theory Ser. B 40(1), 113\u2013117 (1986). https:\/\/doi.org\/10.1016\/0095-8956(86)90069-9","DOI":"10.1016\/0095-8956(86)90069-9"},{"key":"1457_CR9","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-1-4757-3023-4_1","volume-title":"Handbook of Combinatorial Optimization","author":"IM Bomze","year":"1999","unstructured":"Bomze, I.M., Budinich, M., Pardalos, P.M., Pelillo, M.: The maximum clique problem. In: Du, D.-Z., Pardalos, P.M. (eds.) Handbook of Combinatorial Optimization, pp. 1\u201374. Springer, Boston (1999). https:\/\/doi.org\/10.1007\/978-1-4757-3023-4_1"},{"issue":"2","key":"1457_CR10","doi-asserted-by":"publisher","first-page":"179","DOI":"10.1017\/S0963548301004928","volume":"11","author":"V Nikiforov","year":"2002","unstructured":"Nikiforov, V.: Some inequalities for the largest eigenvalue of a graph. Comb. Probab. Comput. 11(2), 179\u2013189 (2002). https:\/\/doi.org\/10.1017\/S0963548301004928","journal-title":"Comb. Probab. Comput."},{"issue":"3","key":"1457_CR11","doi-asserted-by":"publisher","first-page":"535","DOI":"10.1016\/S0166-218X(02)00386-4","volume":"127","author":"M Budinich","year":"2003","unstructured":"Budinich, M.: Exact bounds on the order of the maximum clique of a graph. Discrete Appl. Math. 127(3), 535\u2013543 (2003). https:\/\/doi.org\/10.1016\/S0166-218X(02)00386-4","journal-title":"Discrete Appl. Math."},{"issue":"2","key":"1457_CR12","doi-asserted-by":"publisher","first-page":"336","DOI":"10.1080\/10556788.2016.1172578","volume":"32","author":"V Stozhkov","year":"2017","unstructured":"Stozhkov, V., Pastukhov, G., Boginski, V., Pasiliao, E.L.: New analytical lower bounds on the clique number of a graph. Optim. Methods Softw. 32(2), 336\u2013368 (2017). https:\/\/doi.org\/10.1080\/10556788.2016.1172578","journal-title":"Optim. Methods Softw."},{"issue":"6","key":"1457_CR13","doi-asserted-by":"publisher","first-page":"1228","DOI":"10.1109\/72.883403","volume":"11","author":"IM Bomze","year":"2000","unstructured":"Bomze, I.M., Pelillo, M., Stix, V.: Approximating the maximum weight clique using replicator dynamics. IEEE Trans. Neural Netw. 11(6), 1228\u20131241 (2000). https:\/\/doi.org\/10.1109\/72.883403","journal-title":"IEEE Trans. Neural Netw."},{"issue":"1\u20133","key":"1457_CR14","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1016\/S0166-218X(01)00233-5","volume":"121","author":"IM Bomze","year":"2002","unstructured":"Bomze, I.M., Budinich, M., Pelillo, M., Rossi, C.: Annealed replication: a new heuristic for the maximum clique problem. Discrete Appl. Math. 121(1\u20133), 27\u201349 (2002). https:\/\/doi.org\/10.1016\/S0166-218X(01)00233-5","journal-title":"Discrete Appl. Math."},{"issue":"5","key":"1457_CR15","doi-asserted-by":"publisher","first-page":"1215","DOI":"10.1162\/neco.2006.18.5.1215","volume":"18","author":"M Pelillo","year":"2006","unstructured":"Pelillo, M., Torsello, A.: Payoff-monotonic game dynamics and the maximum clique problem. Neural Comput. 18(5), 1215\u20131258 (2006). https:\/\/doi.org\/10.1162\/neco.2006.18.5.1215","journal-title":"Neural Comput."},{"key":"1457_CR16","doi-asserted-by":"publisher","unstructured":"Daniluk, P., Firlik, G., Lesyng, B.: Implementation of a maximum clique search procedure on CUDA. J. Heuristics 25(2), 247\u2013271 (2019). https:\/\/doi.org\/10.1007\/s10732-018-9393-x","DOI":"10.1007\/s10732-018-9393-x"},{"issue":"2","key":"1457_CR17","doi-asserted-by":"publisher","first-page":"1076","DOI":"10.1137\/16M107428X","volume":"29","author":"P Bonami","year":"2019","unstructured":"Bonami, P., Lodi, A., Schweiger, J., Tramontani, A.: Solving quadratic programming by cutting planes. SIAM J. Optim. 29(2), 1076\u20131105 (2019). https:\/\/doi.org\/10.1137\/16M107428X","journal-title":"SIAM J. Optim."},{"issue":"1","key":"1457_CR18","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1109\/TPAMI.2007.250608","volume":"29","author":"M Pavan","year":"2007","unstructured":"Pavan, M., Pelillo, M.: Dominant sets and pairwise clustering. IEEE Trans. Pattern Anal. Mach. Intell. 29(1), 167\u2013172 (2007). https:\/\/doi.org\/10.1109\/TPAMI.2007.250608","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"issue":"1","key":"1457_CR19","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.ejor.2017.03.056","volume":"262","author":"S Rota Bul\u00f2","year":"2017","unstructured":"Rota Bul\u00f2, S., Pelillo, M.: Dominant-set clustering. Eur. J. Oper. Res. 262(1), 1\u201313 (2017). https:\/\/doi.org\/10.1016\/j.ejor.2017.03.056","journal-title":"Eur. J. Oper. Res."},{"issue":"2","key":"1457_CR20","doi-asserted-by":"publisher","first-page":"287","DOI":"10.1007\/s11590-008-0108-3","volume":"3","author":"S Rota Bul\u00f2","year":"2009","unstructured":"Rota Bul\u00f2, S., Pelillo, M.: A generalization of the Motzkin\u2013Straus theorem to hypergraphs. Optim. Lett. 3(2), 287\u2013295 (2009). https:\/\/doi.org\/10.1007\/s11590-008-0108-3","journal-title":"Optim. Lett."},{"key":"1457_CR21","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-18842-3","volume-title":"Linear and Nonlinear Programming","author":"DG Luenberger","year":"2016","unstructured":"Luenberger, D.G., Ye, Y.: Linear and Nonlinear Programming. Springer, Cham (2016)"},{"issue":"3","key":"1457_CR22","doi-asserted-by":"publisher","first-page":"394","DOI":"10.1137\/S00361445003756","volume":"44","author":"IM Bomze","year":"2002","unstructured":"Bomze, I.M.: Regularity versus degeneracy in dynamics, games, and optimization. SIAM Rev. 44(3), 394\u2013414 (2002). https:\/\/doi.org\/10.1137\/S00361445003756","journal-title":"SIAM Rev."},{"key":"1457_CR23","doi-asserted-by":"publisher","DOI":"10.1201\/9781315153452","volume-title":"Generalized Barycentric Coordinates in Computer Graphics and Computational Mechanics","author":"K Hormann","year":"2017","unstructured":"Hormann, K., Sukumar, N.: Generalized Barycentric Coordinates in Computer Graphics and Computational Mechanics. CRC Press, Boca Raton (2017)"},{"key":"1457_CR24","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-49316-9","volume-title":"Numerical Models for Differential Problems","author":"A Quarteroni","year":"2017","unstructured":"Quarteroni, A.: Numerical Models for Differential Problems. Springer, Cham (2017)"},{"key":"1457_CR25","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4613-0163-9","volume-title":"Algebraic Graph Theory. Graduate Texts in Mathematics","author":"C Godsil","year":"2001","unstructured":"Godsil, C., Royle, G.: Algebraic Graph Theory. Graduate Texts in Mathematics, vol. 207. Springer, New York (2001)"},{"key":"1457_CR26","volume-title":"Graph Theory","author":"R Diestel","year":"2005","unstructured":"Diestel, R.: Graph Theory. Springer, Heidelberg (2005)"},{"key":"1457_CR27","doi-asserted-by":"publisher","first-page":"145","DOI":"10.1016\/0025-5564(78)90077-9","volume":"40","author":"PD Taylor","year":"1978","unstructured":"Taylor, P.D., Jonker, L.B.: Evolutionarily stable strategies and game dynamics. Math. Biosci. 40, 145\u2013156 (1978). https:\/\/doi.org\/10.1016\/0025-5564(78)90077-9","journal-title":"Math. Biosci."},{"key":"1457_CR28","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9781139173179","volume-title":"Evolutionary Games and Population Dynamics","author":"J Hofbauer","year":"1998","unstructured":"Hofbauer, J., Sigmund, K.: Evolutionary Games and Population Dynamics. Cambridge University Press, Cambridge (1998)"},{"key":"1457_CR29","volume-title":"Evolutionary Game Theory","author":"J Weibull","year":"1995","unstructured":"Weibull, J.: Evolutionary Game Theory. MIT Press, Cambridge (1995)"},{"key":"1457_CR30","doi-asserted-by":"crossref","unstructured":"Beretta, G., Torcinovich, A., Pelillo, M.: On generalized KKT points of the Motzkin-Straus program. Paper presented at the 7th international conference on information systes, Kalamata, Greece, 2\u20137 June, 2024","DOI":"10.1007\/s10898-024-01457-2"},{"key":"1457_CR31","volume-title":"Matrix Analysis","author":"RA Horn","year":"2013","unstructured":"Horn, R.A., Johnson, C.R.: Matrix Analysis. Cambridge University Press, New York (2013)"},{"key":"1457_CR32","doi-asserted-by":"publisher","unstructured":"Pavan, M., Pelillo, M.: Dominant sets and hierarchical clustering. In: Proceedings of the 9th IEEE International Conference on Computer Vision, pp. 362\u2013369. IEEE Press, Piscataway (2003). https:\/\/doi.org\/10.1109\/ICCV.2003.1238367 . Paper presented at the 9th IEEE International Conference on Computer Vision (ICCV 2003), Nice, France, 13\u201316 October 2003","DOI":"10.1109\/ICCV.2003.1238367"},{"issue":"1","key":"1457_CR33","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1016\/0025-5564(82)90095-5","volume":"61","author":"E Akin","year":"1982","unstructured":"Akin, E., Hofbauer, J.: Recurrence of the unfit. Math. Biosci. 61(1), 51\u201362 (1982). https:\/\/doi.org\/10.1016\/0025-5564(82)90095-5","journal-title":"Math. Biosci."},{"key":"1457_CR34","doi-asserted-by":"publisher","first-page":"3279","DOI":"10.1007\/978-0-387-74759-0_562","volume-title":"Encyclopedia of Optimization","author":"M Pelillo","year":"2008","unstructured":"Pelillo, M.: Replicator dynamics in combinatorial optimization. In: Floudas, C.A., Pardalos, P.M. (eds.) Encyclopedia of Optimization, pp. 3279\u20133291. Springer, Boston (2008). https:\/\/doi.org\/10.1007\/978-0-387-74759-0_562"},{"issue":"3","key":"1457_CR35","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1007\/BF00318088","volume":"48","author":"IM Bomze","year":"1983","unstructured":"Bomze, I.M.: Lotka\u2013Volterra equation and replicator dynamics. Biol. Cybern. 48(3), 201\u2013211 (1983). https:\/\/doi.org\/10.1007\/BF00318088","journal-title":"Biol. Cybern."}],"container-title":["Journal of Global Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10898-024-01457-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10898-024-01457-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10898-024-01457-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,26]],"date-time":"2025-02-26T06:11:42Z","timestamp":1740550302000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10898-024-01457-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,12,23]]},"references-count":35,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2025,3]]}},"alternative-id":["1457"],"URL":"https:\/\/doi.org\/10.1007\/s10898-024-01457-2","relation":{},"ISSN":["0925-5001","1573-2916"],"issn-type":[{"type":"print","value":"0925-5001"},{"type":"electronic","value":"1573-2916"}],"subject":[],"published":{"date-parts":[[2024,12,23]]},"assertion":[{"value":"28 April 2023","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"4 December 2024","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"23 December 2024","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 conflict of interest to declare that are relevant to the content of this article.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}},{"value":"Not applicable.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Ethics approval"}},{"value":"Not applicable.","order":4,"name":"Ethics","group":{"name":"EthicsHeading","label":"Consent to participate"}},{"value":"Not applicable.","order":5,"name":"Ethics","group":{"name":"EthicsHeading","label":"Consent for publication"}},{"value":"Figures\u00a0,  and  have been produced using draw.io.","order":6,"name":"Ethics","group":{"name":"EthicsHeading","label":"Artwork"}},{"value":"A shorter version of this paper has been presented at the 7th International Conference on the Dynamics of Information Systems (DIS 2024) and will appear in the conference proceedings in the series Lecture Notes in Computer Science, Springer.","order":7,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conference Paper"}}]}}