Instance-specific linear relaxations of semidefinite optimization problems
From MaRDI portal
Cites work
- A Decomposition Augmented Lagrangian Method for Low-Rank Semidefinite Programming
- A feasible method for optimization with orthogonality constraints
- A framework for solving mixed-integer semidefinite programs
- A Newton-CG augmented Lagrangian method for semidefinite programming
- A semidefinite programming approach to the quadratic knapsack problem
- A Spectral Bundle Method for Semidefinite Programming
- A unifying framework for several cutting plane methods for semidefinite programming
- An adaptive linear approximation algorithm for copositive programs
- An inexact projected gradient method with rounding and lifting by nonlinear programming for solving rank-one semidefinite relaxation of polynomial optimization
- Approximate Constraint Satisfaction Requires Large LP Relaxations
- Approximating rectangles by juntas and weakly exponential lower bounds for LP relaxations of CSPs
- Approximation Limits of Linear Programs (Beyond Hierarchies)
- Bipartite Subgraphs and the Smallest Eigenvalue
- Conic optimization via operator splitting and homogeneous self-dual embedding
- COSMO: a conic operator splitting method for convex conic problems
- Deciding polyhedrality of spectrahedra
- DSOS and SDSOS optimization: more tractable alternatives to sum of squares and semidefinite optimization
- Dual quadratic estimates in polynomial and Boolean programming
- Enhancing RLT relaxations via a new class of semidefinite cuts
- Exactness conditions for an SDP relaxation of the extended trust region problem
- Extended formulations in mixed-integer convex programming
- Global optimization of robust truss topology via mixed integer semidefinite programming
- Global optimization with polynomials and the problem of moments
- Handling symmetries in mixed-integer semidefinite programs
- Hidden conic quadratic representation of some nonconvex quadratic optimization problems
- scientific article; zbMATH DE number 43547 (Why is no real title available?)
- scientific article; zbMATH DE number 1182566 (Why is no real title available?)
- scientific article; zbMATH DE number 6159604 (Why is no real title available?)
- scientific article; zbMATH DE number 4193718 (Why is no real title available?)
- Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
- Integrality gaps for Sherali-Adams relaxations
- Interior Point Methods in Semidefinite Programming with Applications to Combinatorial Optimization
- Introduction to Random Graphs
- Laplacian eigenvalues and the maximum cut problem
- Learning the kernel matrix with semidefinite programming
- Lectures on modern convex optimization. Analysis, algorithms, and engineering applications
- Linear programming relaxations of \textsc{maxcut}
- Linear programming relaxations of quadratically constrained quadratic programs
- Nonpolyhedral Relaxations of Graph-Bisection Problems
- On polyhedral and second-order cone decompositions of semidefinite optimization problems
- On polyhedral approximations of the positive semidefinite cone
- On the cut polytope
- On the Shannon capacity of a graph
- On the spectra of general random graphs
- On the tightness of SDP relaxations of QCQPs
- Outer approximation with conic certificates for mixed-integer convex problems
- Polyhedral approximations of the semidefinite cone and their application
- Positive polynomials in control.
- Ramanujan graphs
- SDPNAL+: a majorized semismooth Newton-CG augmented Lagrangian method for semidefinite programming with nonnegative constraints
- Semidefinite Programming
- Semidefinite programming relaxations for semialgebraic problems
- Semidefinite relaxations for quadratically constrained quadratic programming: A review and comparisons
- Spectral techniques applied to sparse random graphs
- Sum of squares basis pursuit with linear and second order cone programming
- The Cutting-Plane Method for Solving Convex Programs
- The expected relative error of the polyhedral approximation of the max- cut problem
- The quadratic knapsack problem -- a survey
- The spectral gap of dense random regular graphs
- TSPLIB—A Traveling Salesman Problem Library
- What is \dots a spectrahedron?
This page was built for publication: Instance-specific linear relaxations of semidefinite optimization problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6960022)
