Pages that link to "Item:Q5338788"
From MaRDI portal
The following pages link to Maxima for Graphs and a New Proof of a Theorem of Turán (Q5338788):
Displaying 50 items.
- Hybrid Riemannian conjugate gradient methods with global convergence properties (Q2023690) (← links)
- A proximal DC approach for quadratic assignment problem (Q2028476) (← links)
- On Hamiltonian Berge cycles in [3]-uniform hypergraphs (Q2032885) (← links)
- Lagrangians of hypergraphs. II: When colex is best (Q2040206) (← links)
- The Lagrangian density of \(\{123, 234, 456\}\) and the Turán number of its extension (Q2042605) (← links)
- Computing mixed strategies equilibria in presence of switching costs by the solution of nonconvex QP problems (Q2044489) (← links)
- Lagrangian densities of short 3-uniform linear paths and Turán numbers of their extensions (Q2045366) (← links)
- Quantifying controllability in temporal networks with uncertainty (Q2046026) (← links)
- Convergence rates of RLT and Lasserre-type hierarchies for the generalized moment problem over the simplex and the sphere (Q2080815) (← links)
- An irrational Turán density via hypergraph Lagrangian densities (Q2088710) (← links)
- On the complexity of finding a local minimizer of a quadratic function over a polytope (Q2089789) (← links)
- On the maxima of Motzkin-Straus programs and cliques of graphs (Q2089888) (← links)
- On independent cliques and linear complementarity problems (Q2095085) (← 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)
- Large deviations for the largest eigenvalue of Gaussian networks with constant average degree (Q2099809) (← links)
- A unified approach to hypergraph stability (Q2101163) (← links)
- Global convergence of Hager-Zhang type Riemannian conjugate gradient method (Q2101972) (← links)
- Complete positivity and distance-avoiding sets (Q2118086) (← links)
- Convex graph invariant relaxations for graph edit distance (Q2118089) (← links)
- On standard quadratic programs with exact and inexact doubly nonnegative relaxations (Q2133420) (← links)
- A note on a conjecture of bene Watts-Norin-Yepremyan for Lagrangian (Q2141214) (← links)
- Convergence analysis of a Lasserre hierarchy of upper bounds for polynomial minimization on the sphere (Q2144547) (← links)
- Improved convergence analysis of Lasserre's measure-based upper bounds for polynomial minimization on compact sets (Q2144552) (← links)
- The \(\ell^p\)-Gaussian-Grothendieck problem with vector spins (Q2149938) (← links)
- Certifying the global optimality of quartic minimization over the sphere (Q2158108) (← links)
- On the exactness of sum-of-squares approximations for the cone of \(5 \times 5\) copositive matrices (Q2158273) (← links)
- Maximisers of the hypergraph Lagrangian outside the principal range (Q2168582) (← links)
- A homogeneous polynomial associated with general hypergraphs and its applications (Q2174504) (← links)
- Immobile indices and CQ-free optimality criteria for linear copositive programming problems (Q2174923) (← links)
- A survey of hidden convex optimization (Q2176821) (← links)
- Extremal problems for the \(p\)-spectral radius of Berge hypergraphs (Q2180089) (← links)
- Bipartite Hansel results for hypergraphs (Q2198970) (← links)
- Testing copositivity via mixed-integer linear programming (Q2226458) (← links)
- Bounds on the spectral radius of general hypergraphs in terms of clique number (Q2228103) (← links)
- The extremal \(p\)-spectral radius of Berge hypergraphs (Q2228127) (← links)
- Two methods for the maximization of homogeneous polynomials over the simplex (Q2231046) (← links)
- Global solutions of nonconvex standard quadratic programs via mixed integer linear programming reformulations (Q2231320) (← links)
- Connection between continuous optimization and Turán densities of non-uniform hypergraphs (Q2240668) (← links)
- Pattern formation in auxin flux (Q2250024) (← links)
- On copositive matrices with -1, 9, 1 entries (Q2264831) (← links)
- Simple complexity from imitation games (Q2268119) (← links)
- A logarithmic descent direction algorithm for the quadratic knapsack problem (Q2287590) (← links)
- Lagrangian densities of enlargements of matchings in hypergraphs (Q2294918) (← links)
- Turán's theorem implies Stanley's bound (Q2296007) (← links)
- Hypergraph Lagrangians. I: The Frankl-Füredi conjecture is false (Q2308316) (← links)
- Global optimization with orthogonality constraints via stochastic diffusion on manifold (Q2316261) (← links)
- Optimality and stability of symmetric evolutionary games with applications in genetic selection (Q2339916) (← links)
- Improving upper bounds for the clique number by non-valid inequalities (Q2340341) (← links)
- The \(p\)-spectral radius of \(k\)-partite and \(k\)-chromatic uniform hypergraphs (Q2347469) (← links)
