Semidefinite programming and combinatorial optimization
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 995811 (Why is no real title available?)
- scientific article; zbMATH DE number 439380 (Why is no real title available?)
- scientific article; zbMATH DE number 3121286 (Why is no real title available?)
- scientific article; zbMATH DE number 3745227 (Why is no real title available?)
- scientific article; zbMATH DE number 3554030 (Why is no real title available?)
- scientific article; zbMATH DE number 1243473 (Why is no real title available?)
- scientific article; zbMATH DE number 1256761 (Why is no real title available?)
- scientific article; zbMATH DE number 510844 (Why is no real title available?)
- scientific article; zbMATH DE number 729680 (Why is no real title available?)
- scientific article; zbMATH DE number 740754 (Why is no real title available?)
- scientific article; zbMATH DE number 1054729 (Why is no real title available?)
- scientific article; zbMATH DE number 1182569 (Why is no real title available?)
- scientific article; zbMATH DE number 1944141 (Why is no real title available?)
- scientific article; zbMATH DE number 1559516 (Why is no real title available?)
- scientific article; zbMATH DE number 780784 (Why is no real title available?)
- A Spectral Bundle Method for Semidefinite Programming
- A bound on the k-gonality of facets of the hypermetric cone and related complexity problems
- A computational study of graph partitioning
- A projection technique for partitioning the nodes of a graph
- A recipe for semidefinite relaxation for \((0,1)\)-quadratic programming
- A semidefinite framework for trust region subproblems with applications to large scale minimization
- A spectral technique for coloring random 3-colorable graphs (preliminary version)
- An Interior-Point Method for Semidefinite Programming
- An \(\tilde{O}(n^{3/14})\)-coloring algorithm for 3-colorable graphs
- Approximating the independence number via the -function
- Combining semidefinite and polyhedral relaxations for integer programs
- Connection between semidefinite relaxations of the max-cut and stable set problems
- Convex Relaxations of (0, 1)-Quadratic Programming
- Duality and asymptotic solvability over cones
- Exploiting sparsity in primal-dual interior-point methods for semidefinite programming
- Improved approximation algorithms for MAX k-cut and MAX BISECTION
- Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
- Indefinite Trust Region Subproblems and Nonsymmetric Eigenvalue Perturbations
- Interior Point Methods in Semidefinite Programming with Applications to Combinatorial Optimization
- Interior-Point Methods for the Monotone Semidefinite Linear Complementarity Problem in Symmetric Matrices
- Laplacian eigenvalues and the maximum cut problem
- Large-Scale Optimization of Eigenvalues
- Least squares with a quadratic constraint
- Linear Matrix Inequalities in System and Control Theory
- Lower Bounds for the Partitioning of Graphs
- Node and edge relaxations of the max-cut problem
- Nonpolyhedral Relaxations of Graph-Bisection Problems
- On Extending Some Primal--Dual Interior-Point Algorithms From Linear Programming to Semidefinite Programming
- On the Nesterov--Todd Direction in Semidefinite Programming
- On the Shannon capacity of a graph
- On the Sum of the Largest Eigenvalues of a Symmetric Matrix
- Primal--Dual Path-Following Algorithms for Semidefinite Programming
- Primal-Dual Interior-Point Methods for Self-Scaled Cones
- Primal-Dual Interior-Point Methods for Semidefinite Programming: Convergence Rates, Stability and Numerical Results
- Semidefinite Programming
- Semidefinite programming in combinatorial optimization
- Solving the max-cut problem using eigenvalues
- Some applications of optimization in matrix theory
- Some convexity theorems for matrices
- The Gauss-Newton direction in semidefinite programming
- The hypermetric cone is polyhedral
Cited in
(38)- Semidefinite programming in combinatorial and polynomial optimization
- On Integrality in Semidefinite Programming for Discrete Optimization
- scientific article; zbMATH DE number 1560335 (Why is no real title available?)
- Approximation bounds for quadratic maximization and max-cut problems with semidefinite programming relaxation
- Semi-definite relaxation algorithm of multiple knapsack problem
- Mixed linear and semidefinite programming for combinatorial and quadratic optimization
- Semidefinite spectral clustering
- Approximation algorithm for MAX DICUT with given sizes of parts
- scientific article; zbMATH DE number 1944141 (Why is no real title available?)
- A gentle introduction to semi-definite programming
- Semidefinite programming for discrete optimization and matrix completion problems
- SDP-based bounds for graph partition via extended ADMM
- Semidefinite programs and association schemes
- scientific article; zbMATH DE number 2246591 (Why is no real title available?)
- Strengthened semidefinite relaxations via a second lifting for the Max-Cut problem
- Semidefinite relaxations for integer programming
- On Approximating Complex Quadratic Optimization Problems via Semidefinite Programming Relaxations
- Polyhedral and semidefinite programming methods in combinatorial optimization
- A rounding procedure for semidefinite optimization
- A combinatorial, primal-dual approach to semidefinite programs
- Approximating semidefinite packing programs
- Exploring chordal sparsity in semidefinite programming with sparse plus low-rank data matrices
- A novel formulation of the max-cut problem and related algorithm
- Complementarity and nondegeneracy in semidefinite programming
- Feasible and accurate algorithms for covering semidefinite programs
- Semidefinite programming and constraint programming
- Discretization method for semi-definite programming
- Solving Max-cut to optimality by intersecting semidefinite and polyhedral relaxations
- scientific article; zbMATH DE number 5493304 (Why is no real title available?)
- Solving Large-Scale Sparse Semidefinite Programs for Combinatorial Optimization
- scientific article; zbMATH DE number 1786141 (Why is no real title available?)
- A new way of using semidefinite programming with applications to linear equations mod p
- scientific article; zbMATH DE number 1489798 (Why is no real title available?)
- Semidefinite programming and integer programming
- Integer sequences and semidefinite programming
- Solving graph equipartition SDPs on an algebraic variety
- Approximation algorithms and semidefinite programming.
- scientific article; zbMATH DE number 2127785 (Why is no real title available?)
This page was built for publication: Semidefinite programming and combinatorial optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5906394)
