Pages that link to "Item:Q4361794"

The following pages link to Continuous Characterizations of the Maximum Clique Problem (Q4361794):

Displaying 45 items.

• Maximum weighted induced subgraphs (Q279221) (← links)
• Sparse solutions to random standard quadratic optimization problems (Q378104) (← links)
• A gradient-based approach for discrete optimum design (Q381494) (← links)
• On graph-Lagrangians of hypergraphs containing dense subgraphs (Q467466) (← links)
• On the largest graph-Lagrangian of 3-graphs with fixed number of edges (Q467468) (← links)
• On Lagrangians of \(r\)-uniform hypergraphs (Q498456) (← links)
• An axiomatic duality framework for the theta body and related convex corners (Q517307) (← links)
• Improving an upper bound on the stability number of a graph (Q556012) (← links)
• An exact bit-parallel algorithm for the maximum clique problem (Q709206) (← links)
• Indirect unstructured hex-dominant mesh generation using tetrahedra recombination (Q722824) (← links)
• A continuous characterization of the maximum-edge biclique problem (Q742133) (← links)
• Fixed interval scheduling: models, applications, computational complexity and algorithms (Q859906) (← links)
• New and old bounds for standard quadratic optimization: dominance, equivalence and incomparability (Q930342) (← links)
• A clique algorithm for standard quadratic programming (Q955308) (← links)
• Annealed replication: A new heuristic for the maximum clique problem (Q1613385) (← links)
• Maximum cliques of hypergraphs and polynomial optimization (Q1617049) (← links)
• A linear complementarity based characterization of the weighted independence number and the independent domination number in graphs (Q1752600) (← links)
• A continuous characterization of the maximum vertex-weighted clique in hypergraphs (Q1752628) (← links)
• A nonconvex quadratic optimization approach to the maximum edge weight clique problem (Q1756769) (← links)
• Exact bounds on the order of the maximum clique of a graph. (Q1811073) (← links)
• The convergence rate analysis of the symmetric ADMM for the nonconvex separable optimization problems (Q1983743) (← links)
• Extensions of the standard quadratic optimization problem: strong duality, optimality, hidden convexity and S-lemma (Q1987329) (← links)
• Local linear convergence of the alternating direction method of multipliers for nonconvex separable optimization problems (Q2026713) (← links)
• Inexact proximal memoryless quasi-Newton methods based on the Broyden family for minimizing composite functions (Q2028458) (← links)
• On the maxima of Motzkin-Straus programs and cliques of graphs (Q2089888) (← links)
• A study on sequential minimal optimization methods for standard quadratic problems (Q2095525) (← links)
• Continuous cubic formulations for cluster detection problems in networks (Q2097637) (← links)
• On standard quadratic programs with exact and inexact doubly nonnegative relaxations (Q2133420) (← links)
• On sparsity of the solution to a random quadratic optimization problem (Q2227539) (← links)
• Global solutions of nonconvex standard quadratic programs via mixed integer linear programming reformulations (Q2231320) (← links)
• A Motzkin-Straus type result for 3-uniform hypergraphs (Q2376079) (← links)
• Solving the maximum clique problem with symmetric rank-one non-negative matrix approximation (Q2401518) (← links)
• On Motzkin-Straus type results for non-uniform hypergraphs (Q2410100) (← links)
• Strong duality and KKT conditions in nonconvex optimization with a single equality constraint and geometric constraint (Q2413092) (← links)
• A new trust region technique for the maximum weight clique problem (Q2433799) (← links)
• On a polynomial fractional formulation for independence number of a graph (Q2457911) (← links)
• Continuous quadratic programming formulations of optimization problems on graphs (Q2629636) (← links)
• Using SVM to combine global heuristics for the standard quadratic problem (Q2629704) (← links)
• Linear Convergence of Proximal Gradient Algorithm with Extrapolation for a Class of Nonconvex Nonsmooth Minimization Problems (Q2957980) (← links)
• The fundamental theorem of linear programming: extensions and applications (Q2996803) (← links)
• Connections between continuous and combinatorial optimization problems through an extension of the fundamental theorem of Linear Programming (Q3439163) (← links)
• A tutorial on branch and cut algorithms for the maximum stable set problem (Q4918254) (← links)
• (Q4968665) (← links)
• Trust Your Data or Not—StQP Remains StQP: Community Detection via Robust Standard Quadratic Optimization (Q4991677) (← links)
• A General Regularized Continuous Formulation for the Maximum Clique Problem (Q5108235) (← links)