Continuous Characterizations of the Maximum Clique Problem
From MaRDI portal
Recommendations
- A continuous characterization of the maximum vertex-weighted clique in hypergraphs
- A Hierarchy of Standard Polynomial Programming Formulations for the Maximum Clique Problem
- On the maxima of Motzkin-Straus programs and cliques of graphs
- A nonconvex quadratic optimization approach to the maximum edge weight clique problem
- A new trust region technique for the maximum weight clique problem
Cited in
(63)- Annealed replication: A new heuristic for the maximum clique problem
- Maximum cliques of hypergraphs and polynomial optimization
- A linear complementarity based characterization of the weighted independence number and the independent domination number in graphs
- A continuous characterization of the maximum vertex-weighted clique in hypergraphs
- A nonconvex quadratic optimization approach to the maximum edge weight clique problem
- Exact bounds on the order of the maximum clique of a graph.
- The convergence rate analysis of the symmetric ADMM for the nonconvex separable optimization problems
- Extensions of the standard quadratic optimization problem: strong duality, optimality, hidden convexity and S-lemma
- Local linear convergence of the alternating direction method of multipliers for nonconvex separable optimization problems
- Inexact proximal memoryless quasi-Newton methods based on the Broyden family for minimizing composite functions
- On the maxima of Motzkin-Straus programs and cliques of graphs
- A study on sequential minimal optimization methods for standard quadratic problems
- Continuous cubic formulations for cluster detection problems in networks
- On standard quadratic programs with exact and inexact doubly nonnegative relaxations
- On sparsity of the solution to a random quadratic optimization problem
- Global solutions of nonconvex standard quadratic programs via mixed integer linear programming reformulations
- The clique problem for graphs with a few eigenvalues of the same sign
- A Motzkin-Straus type result for 3-uniform hypergraphs
- Solving the maximum clique problem with symmetric rank-one non-negative matrix approximation
- On Motzkin-Straus type results for non-uniform hypergraphs
- Strong duality and KKT conditions in nonconvex optimization with a single equality constraint and geometric constraint
- A new trust region technique for the maximum weight clique problem
- On a polynomial fractional formulation for independence number of a graph
- Continuous quadratic programming formulations of optimization problems on graphs
- Using SVM to combine global heuristics for the standard quadratic problem
- A discrete and continuous study of the \textsc{Max-Chain-Formation} problem
- Maximum weighted induced subgraphs
- Linear convergence of proximal gradient algorithm with extrapolation for a class of nonconvex nonsmooth minimization problems
- The fundamental theorem of linear programming: extensions and applications
- Connections between continuous and combinatorial optimization problems through an extension of the fundamental theorem of Linear Programming
- A spinorial formulation of the maximum clique problem of a graph
- New Analysis on Sparse Solutions to Random Standard Quadratic Optimization Problems and Extensions
- Sparse solutions to random standard quadratic optimization problems
- A gradient-based approach for discrete optimum design
- Solving Quadratic Programming by Cutting Planes
- A new branch-and-bound algorithm for standard quadratic programming problems
- On graph-Lagrangians of hypergraphs containing dense subgraphs
- On the largest graph-Lagrangian of 3-graphs with fixed number of edges
- A tutorial on branch and cut algorithms for the maximum stable set problem
- On cliques and Lagrangians of hypergraphs
- On Lagrangians of \(r\)-uniform hypergraphs
- Trust your data or not -- StQP remains StQP: community detection via robust standard quadratic optimization
- Finite convergence of sum-of-squares hierarchies for the stability number of a graph
- A general regularized continuous formulation for the maximum clique problem
- An axiomatic duality framework for the theta body and related convex corners
- A survey on graphs with convex quadratic stability number
- A Continuous-Based Approach for Partial Clique Enumeration
- Improving an upper bound on the stability number of a graph
- A Hierarchy of Standard Polynomial Programming Formulations for the Maximum Clique Problem
- Some Motzkin-Straus type results for non-uniform hypergraphs
- Connection between a class of polynomial optimization problems and maximum cliques of non-uniform hypergraphs
- Nonconvex homogeneous optimization: a general framework and optimality conditions of first and second-order
- On the hardness of deciding the finite convergence of Lasserre hierarchies
- Computational complexity of sum-of-squares bounds for copositive programs
- Regularized standard polynomial programming formulations for the maximum clique problem
- Copositive matrices, sums of squares and the stability number of a graph
- On generalized KKT points for the Motzkin-Straus program
- An exact bit-parallel algorithm for the maximum clique problem
- Indirect unstructured hex-dominant mesh generation using tetrahedra recombination
- A continuous characterization of the maximum-edge biclique problem
- Fixed interval scheduling: models, applications, computational complexity and algorithms
- New and old bounds for standard quadratic optimization: dominance, equivalence and incomparability
- A clique algorithm for standard quadratic programming
This page was built for publication: Continuous Characterizations of the Maximum Clique Problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4361794)
