Pages that link to "Item:Q1365053"

The following pages link to Semidefinite programming in combinatorial optimization (Q1365053):

Displaying 50 items.

• Compression bounds for Lipschitz maps from the Heisenberg group to \(L_{1}\) (Q416849) (← links)
• Vertical versus horizontal Poincaré inequalities on the Heisenberg group (Q476505) (← links)
• On metric properties of maps between Hamming spaces and related graph homomorphisms (Q507807) (← links)
• An axiomatic duality framework for the theta body and related convex corners (Q517307) (← links)
• A fast space-decomposition scheme for nonconvex eigenvalue optimization (Q526388) (← links)
• Improving an upper bound on the stability number of a graph (Q556012) (← links)
• An unconstrained minimization method for solving low-rank SDP relaxations of the maxcut problem (Q623464) (← links)
• Moment inequalities for sums of random matrices and their applications in optimization (Q647387) (← links)
• Binary positive semidefinite matrices and associated integer polytopes (Q662294) (← links)
• Semidefinite programming for discrete optimization and matrix completion problems (Q697582) (← links)
• Semi-definite relaxation algorithm of multiple knapsack problem (Q698390) (← links)
• Successive Lagrangian relaxation algorithm for nonconvex quadratic optimization (Q721146) (← links)
• A strong conic quadratic reformulation for machine-job assignment with controllable processing times (Q833574) (← links)
• Conic mixed-integer rounding cuts (Q847842) (← links)
• Improving the performance of standard solvers for quadratic 0-1 programs by a tight convex reformulation: The QCR method (Q1025986) (← links)
• Cardinality constrained minimum cut problems: complexity and algorithms. (Q1427809) (← links)
• Semidefinite programming (Q1600854) (← links)
• Strengthened semidefinite relaxations via a second lifting for the Max-Cut problem (Q1602704) (← links)
• Vertical perimeter versus horizontal perimeter (Q1643390) (← links)
• Completely positive and completely positive semidefinite tensor relaxations for polynomial optimization (Q1704915) (← links)
• Visualizing network communities with a semi-definite programming method (Q1750020) (← links)
• On self-regular IPMs (with comments and rejoinder) (Q1769946) (← links)
• A globally convergent filter-type trust region method for semidefinite programming (Q1955230) (← links)
• A novel formulation of the max-cut problem and related algorithm (Q2287710) (← links)
• Optimality conditions for nonsmooth semidefinite programming via convexificators (Q2355132) (← links)
• On NP-hardness of the clique partition -- independence number gap recognition and related problems (Q2368935) (← links)
• A space decomposition scheme for maximum eigenvalue functions and its applications (Q2407989) (← links)
• Sums of Hermitian squares decomposition of non-commutative polynomials in non-symmetric variables using NCSOStools (Q2418156) (← links)
• A semidefinite programming-based heuristic for graph coloring (Q2467349) (← links)
• Fréchet embeddings of negative type metrics (Q2471721) (← links)
• Approximation bounds for quadratic maximization and max-cut problems with semidefinite programming relaxation (Q2475315) (← links)
• Semidefinite programming relaxations and algebraic optimization in control (Q2512289) (← links)
• Cuts for mixed 0-1 conic programming (Q2571004) (← links)
• The Gaussian entropy map in valued fields (Q2683416) (← links)
• On Minimal Valid Inequalities for Mixed Integer Conic Programs (Q2806815) (← links)
• Matrix Relaxations in Combinatorial Optimization (Q2897308) (← links)
• Binary Positive Semidefinite Matrices and Associated Integer Polytopes (Q3503844) (← links)
• (Q3585652) (← links)
• On the connections between semidefinite optimization and vector optimization (Q4469110) (← links)
• A study of search directions in primal-dual interior-point methods for semidefinite programming (Q4504774) (← links)
• SDPLIB 1.2, a library of semidefinite programming test problems (Q4504799) (← links)
• A guide to conic optimisation and its applications (Q4634309) (← links)
• Semidefinite relaxation for linear programs with equilibrium constraints (Q4921222) (← links)
• (Q5002624) (← links)
• (Q5053241) (← links)
• A recursive Lovász theta number for simplex-avoiding sets (Q5097318) (← links)
• Foundations of Set-Semidefinite Optimization (Q5188753) (← links)
• Identifying a Set of Key Members in Social Networks Using SDP-Based Stochastic Search and Integer Programming Algorithms (Q5348807) (← links)
• Euclidean distortion and the sparsest cut (Q5423920) (← links)
• The Unique Games Conjecture, Integrality Gap for Cut Problems and Embeddability of Negative-Type Metrics into ℓ ₁ (Q5501953) (← links)