Semidefinite programming relaxation for nonconvex quadratic programs
From MaRDI portal
(Redirected from Publication:1361074)
Recommendations
- scientific article; zbMATH DE number 1380758
- Semidefinite relaxation and nonconvex quadratic optimization
- Further Results on Approximating Nonconvex Quadratic Optimization by Semidefinite Programming Relaxation
- Semidefinite relaxations for non-convex quadratic mixed-integer programming
- New positive semidefinite relaxations for nonconvex quadratic programs
- Quadratic maximization and semidefinite relaxation
- Semidefinite relaxations for quadratically constrained quadratic programming: A review and comparisons
- A note on set-semidefinite relaxations of nonconvex quadratic programs
- A relaxation method for nonconvex quadratically constrained quadratic programs
Cited in
(89)- A compact variant of the QCR method for quadratically constrained quadratic 0-1 programs
- On semidefinite descriptions for convex hulls of quadratic programs
- A novel approach for solving semidefinite programs
- Convex hull results on quadratic programs with non-intersecting constraints
- New SDP relaxations for unconstrained 0-1 polynomial programming problems
- A note on representations of linear inequalities in non-convex mixed-integer quadratic programs
- scientific article; zbMATH DE number 1664574 (Why is no real title available?)
- A coordinate ascent method for solving semidefinite relaxations of non-convex quadratic integer programs
- Semidefinite Approaches for MIQCP: Convex Relaxations and Practical Methods
- On the Slater condition for the SDP relaxations of nonconvex sets
- On zero duality gap in nonconvex quadratic programming problems
- Strong Duality for the CDT Subproblem: A Necessary and Sufficient Condition
- Second order cone constrained convex relaxations for nonconvex quadratically constrained quadratic programming
- Second order cone programming relaxation of nonconvex quadratic optimization problems
- New positive semidefinite relaxations for nonconvex quadratic programs
- Exact solutions of some nonconvex quadratic optimization problems via SDP and SOCP relaxa\-tions
- Complexity and nonlinear semidefinite programming reformulation of \(\ell_1\)-constrained nonconvex quadratic optimization
- A Feasible Method for Solving an SDP Relaxation of the Quadratic Knapsack Problem
- A new approach to the stable set problem based on ellipsoids
- Unbounded convex sets for non-convex mixed-integer quadratic programming
- Enhancing semidefinite relaxation for quadratically constrained quadratic programming via penalty methods
- Semidefinite relaxations for non-convex quadratic mixed-integer programming
- Nonlinear rescaling Lagrangians for nonconvex semidefinite programming
- Semidefinite programming for discrete optimization and matrix completion problems
- Exact dual bounds for some nonconvex minimax quadratic optimization problems
- A guide to conic optimisation and its applications
- A semidefinite programming method for integer convex quadratic minimization
- A successive linear programming algorithm for SDP relaxation of binary quadratic programming
- Interpolant synthesis for quadratic polynomial inequalities and combination with EUF
- Semidefinite relaxations for quadratically constrained quadratic programming: A review and comparisons
- Successive Lagrangian relaxation algorithm for nonconvex quadratic optimization
- Faster, but weaker, relaxations for quadratically constrained quadratic programs
- New semidefinite relaxations for a class of complex quadratic programming problems
- Equivalent sufficient conditions for global optimality of quadratically constrained quadratic programs
- Enclosing ellipsoids and elliptic cylinders of semialgebraic sets and their application to error bounds in polynomial optimization
- Causal state-feedback parameterizations in robust model predictive control
- On the tightness of SDP relaxations of QCQPs
- A low-dimensional SDP relaxation based spatial branch and bound method for nonconvex quadratic programs
- Penalized semidefinite programming for quadratically-constrained quadratic optimization
- On linear conic relaxation of discrete quadratic programs
- Convex relaxations for mixed integer predictive control
- Semidefinite programming versus the reformulation-linearization technique for nonconvex quadratically constrained quadratic programming
- Ellipsoidal relaxations of the stable set problem: theory and algorithms
- scientific article; zbMATH DE number 1757962 (Why is no real title available?)
- Exact semidefinite formulations for a class of (random and non-random) nonconvex quadratic programs
- Further Results on Approximating Nonconvex Quadratic Optimization by Semidefinite Programming Relaxation
- Quadratic maximization and semidefinite relaxation
- Semi-definite programming relaxation of quadratic assignment problems based on nonredundant matrix splitting
- An optimality gap test for a semidefinite relaxation of a quadratic program with two quadratic constraints
- On doubly positive semidefinite programming relaxations
- On the problem of packing spheres in a cube
- Extra resource allocation: a DEA approach in the view of efficiencies
- Invariants of SDP exactness in quadratic programming
- A new semidefinite relaxation for \(L_{1}\)-constrained quadratic
- Simplified semidefinite and completely positive relaxations
- Semidefinite relaxation for the total least squares problem with Tikhonov-like regularization
- Generalized S-lemma and strong duality in nonconvex quadratic programming
- Generating cutting planes for the semidefinite relaxation of quadratic programs
- Nonconvex quadratically constrained quadratic programming: Best D.C. Decompositions and their SDP representations
- Intersection cuts for nonlinear integer programming: convexification techniques for structured sets
- Exact SDP relaxations for classes of nonlinear semidefinite programming problems
- Solution of Boolean quadratic programming problems by two augmented Lagrangian algorithms based on a continuous relaxation
- Semidefinite programming and constraint programming
- A vectorized positive semidefinite penalty method for unconstrained binary quadratic programming
- On the finite convergence of successive SDP relaxation methods
- Consistency analysis for massively inconsistent datasets in bound-to-bound data collaboration
- Combining semidefinite and polyhedral relaxations for integer programs
- Convex relaxations for nonconvex quadratically constrained quadratic programming: matrix cone decomposition and polyhedral approximation
- On Convex Hulls of Epigraphs of QCQPs
- Application of the method of semidefinite relaxation for determining the orientation of a solid body in space
- Semidefinite relaxation for linear programs with equilibrium constraints
- A note on set-semidefinite relaxations of nonconvex quadratic programs
- Sparse sub-Gaussian random projections for semidefinite programming relaxations
- Doubly nonnegative relaxations are equivalent to completely positive reformulations of quadratic optimization problems with block-clique graph structures
- A projected gradient algorithm for solving the maxcut SDP relaxation
- Copositive realxation for genera quadratic programming
- Copositive relaxation beats Lagrangian dual bounds in quadratically and linearly constrained quadratic optimization problems
- Probabilistic Analysis of Semidefinite Relaxation for Binary Quadratic Minimization
- New semidefinite programming relaxations for box constrained quadratic program
- Linear programming relaxations of quadratically constrained quadratic programs
- Using two-dimensional projections for stronger separation and propagation of bilinear terms
- SDP-based branch-and-bound for non-convex quadratic integer optimization
- From linear to semidefinite programming: an algorithm to obtain semidefinite relaxations for bivalent quadratic problems
- A nonconvex ADMM for a class of sparse inverse semidefinite quadratic programming problems
- A recipe for semidefinite relaxation for \((0,1)\)-quadratic programming
- Semidefinite relaxation and nonconvex quadratic optimization
- Correlative sparsity structures and semidefinite relaxations for concave cost transportation problems with change of variables
- Using quadratic convex reformulation to tighten the convex relaxation of a quadratic program with complementarity constraints
- Nonconvex quadratic programming, semidefinite relaxations and randomization algorithms in information and decision systems
This page was built for publication: Semidefinite programming relaxation for nonconvex quadratic programs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1361074)
