Regularized standard polynomial programming formulations for the maximum clique problem

Mykyta Makovenko (), Sergiy Butenko () and Miltiades Pardalos ()
Additional contact information
Mykyta Makovenko: Texas A&M University
Sergiy Butenko: Texas A&M University
Miltiades Pardalos: Texas A&M University

Computational Optimization and Applications, 2025, vol. 92, issue 3, No 7, 923-949

Abstract: Abstract Recently, a novel hierarchy of standard polynomial programming formulations for the maximum clique problem has been proposed, inspired by the classical Motzkin–Straus formulation. The k-th formulation ( $${{\textbf {P}}}^k$$ P k ) in this hierarchy expresses the problem of finding a maximum clique in a given graph G as maximization of degree-k multi-linear polynomial over the standard simplex, and every local maximizer of ( $${{\textbf {P}}}^{k+1}$$ P k + 1 ) is also a local maximizer of ( $${{\textbf {P}}}^k$$ P k ) for $$k\in \{2,\ldots , \omega -1\}$$ k ∈ { 2 , … , ω - 1 } , where $$\omega $$ ω is the clique number of G. In particular, every local maximizer of ( $${{\textbf {P}}}^\omega $$ P ω ) is global. Similarly to Motzkin–Straus formulation, ( $${{\textbf {P}}}^k$$ P k ) allows “spurious” local maxima, whose support does not correspond to a clique and needs to be further processed to obtain a clique. This drawback motivated several regularizations of Motzkin–Straus formulation proposed in the literature. This paper generalizes one such regularization to ( $${{\textbf {P}}}^k$$ P k ), to ensure that each local maximizer of the regularized formulation corresponds to a maximal clique with at least $$k-1$$ k - 1 vertices in G, and vice versa. The performance of a local optimization solver on the original and proposed regularized formulations for $$k\in \{2, 3, 4, 5\}$$ k ∈ { 2 , 3 , 4 , 5 } is compared through extensive numerical experiments. The results indicate that both approaches are competitive and that the multi-linear structure of ( $${{\textbf {P}}}^k$$ P k ) can be advantageous to the correspondence between local maxima and maximal cliques ensured by regularized formulations.

Keywords: Maximum clique problem; Standard polynomial programming; Motzkin–Straus formulation; Continuous approaches to discrete optimization; Global optimization (search for similar items in EconPapers)
Date: 2025
References: Add references at CitEc
Citations:

Downloads: (external link)
http://link.springer.com/10.1007/s10589-025-00674-z Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:coopap:v:92:y:2025:i:3:d:10.1007_s10589-025-00674-z

Ordering information: This journal article can be ordered from
http://www.springer.com/math/journal/10589

DOI: 10.1007/s10589-025-00674-z

Access Statistics for this article

Computational Optimization and Applications is currently edited by William W. Hager

More articles in Computational Optimization and Applications from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().