Connection between a class of polynomial optimization problems and maximum cliques of non-uniform hypergraphs

DOI10.1007/s10878-014-9798-xzbMath1360.90256OpenAlexW2083611171MaRDI QIDQ5963658

Yue Jian Peng, Yan-Ming Chang, Yuping Yao

Publication date: 23 February 2016

Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10878-014-9798-x

zbMATH Keywords

hypergraphmaximum cliquepolynomial optimization

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Nonlinear programming (90C30)

Related Items (4)

Maximum cliques of hypergraphs and polynomial optimization ⋮ Connection between continuous optimization and Turán densities of non-uniform hypergraphs ⋮ The connection between polynomial optimization, maximum cliques and Turán densities ⋮ Connection between polynomial optimization and maximum cliques of non-uniform hypergraphs

Uses Software

• QUALEX

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Extremal problems whose solutions are the blowups of the small Witt- designs
• An extension of the Motzkin-Straus theorem to non-uniform hypergraphs and its applications
• A generalization of the Motzkin-Straus theorem to hypergraphs
• Hypergraphs do not jump
• On the maximal number of edges in a homogeneous hypergraph not containing prohibited subgraphs
• Evolution towards the maximum clique
• Exact bounds on the order of the maximum clique of a graph.
• A new trust region technique for the maximum weight clique problem
• A global optimization approach for solving the maximum clique problem
• Continuous Characterizations of the Maximum Clique Problem
• Maxima for Graphs and a New Proof of a Theorem of Turán

This page was built for publication: Connection between a class of polynomial optimization problems and maximum cliques of non-uniform hypergraphs