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

DOI10.1007/S10878-014-9798-XMaRDI QIDQ5963658zbMATH OpenOpenAlexFDO

Authors Yan-Ming Chang, Yuejian Peng, 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

polynomial optimizationmaximum cliquehypergraph

Mathematics Subject Classification ID

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

Recommendations

• Connection between polynomial optimization and maximum cliques of non-uniform hypergraphs
• Maximum cliques of hypergraphs and polynomial optimization
• The connection between polynomial optimization, maximum cliques and Turán densities
• Connection between continuous optimization and Turán densities of non-uniform hypergraphs
• Some Motzkin-Straus type results for non-uniform hypergraphs

Cites work

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

Cited in

(8)

• A generalization of the Motzkin-Straus theorem to hypergraphs
• Connection between continuous optimization and Turán densities of non-uniform hypergraphs
• Homogeneous multilinear functions on hypergraph cliques
• Maximum cliques of hypergraphs and polynomial optimization
• A Hierarchy of Standard Polynomial Programming Formulations for the Maximum Clique Problem
• Connection between polynomial optimization and maximum cliques of non-uniform hypergraphs
• A homogeneous polynomial associated with general hypergraphs and its applications
• The connection between polynomial optimization, maximum cliques and Turán densities

Describes a project that uses

Uses Software

• QUALEX

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

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