On generalized KKT points for the Motzkin-Straus program

DOI10.1007/S10898-024-01457-2MaRDI QIDQ7008131zbMATH OpenFDO

Authors Guglielmo Beretta, Alessandro Torcinovich, Marcello Pelillo

Publication date 24 March 2025

Published in Journal of Global Optimization (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/S10898-024-01457-2

zbMATH Keywords

cliqueequitable partitionKKT pointsregular graphsreplicator dynamicsstandard quadratic optimization

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Quadratic programming (90C20) Combinatorial optimization (90C27) Programming involving graphs or networks (90C35)

Cites work

• A general regularized continuous formulation for the maximum clique problem
• A generalization of the Motzkin-Straus theorem to hypergraphs
• A global optimization approach for solving the maximum clique problem
• Annealed replication: A new heuristic for the maximum clique problem
• Continuous Characterizations of the Maximum Clique Problem
• Dominant-set clustering: a review
• Evolution towards the maximum clique
• Evolutionarily stable strategies and game dynamics
• Evolutionary Games and Population Dynamics
• Exact bounds on the order of the maximum clique of a graph.
• scientific article; zbMATH DE number 1600999 (Why is no real title available?)
• scientific article; zbMATH DE number 6118217 (Why is no real title available?)
• scientific article; zbMATH DE number 903638 (Why is no real title available?)
• scientific article; zbMATH DE number 6125590 (Why is no real title available?)
• scientific article; zbMATH DE number 2203240 (Why is no real title available?)
• Linear and nonlinear programming
• Lotka-Volterra equation and replicator dynamics: A two-dimensional classification
• Maxima for Graphs and a New Proof of a Theorem of Turán
• New analytical lower bounds on the clique number of a graph
• Numerical models for differential problems
• On the maxima of Motzkin-Straus programs and cliques of graphs
• Payoff-Monotonic Game Dynamics and the Maximum Clique Problem
• Recurrence of the unfit
• Regularity versus Degeneracy in Dynamics, Games, and Optimization: A Unified Approach to Different Aspects
• Solving Quadratic Programming by Cutting Planes
• Some Inequalities for the Largest Eigenvalue of a Graph
• Spectral bounds for the clique and independence numbers of graphs

This page was built for publication: On generalized KKT points for the Motzkin-Straus program

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7008131)