Pages that link to "Item:Q1361074"
From MaRDI portal
The following pages link to Semidefinite programming relaxation for nonconvex quadratic programs (Q1361074):
Displaying 50 items.
- Generating cutting planes for the semidefinite relaxation of quadratic programs (Q337405) (← links)
- New semidefinite programming relaxations for box constrained quadratic program (Q365811) (← links)
- Semidefinite relaxations for non-convex quadratic mixed-integer programming (Q378112) (← links)
- A note on set-semidefinite relaxations of nonconvex quadratic programs (Q386483) (← links)
- On zero duality gap in nonconvex quadratic programming problems (Q421278) (← links)
- Convex relaxations for nonconvex quadratically constrained quadratic programming: matrix cone decomposition and polyhedral approximation (Q644906) (← links)
- Nonconvex quadratically constrained quadratic programming: Best D.C. Decompositions and their SDP representations (Q645557) (← links)
- Semidefinite programming for discrete optimization and matrix completion problems (Q697582) (← links)
- Convex relaxations for mixed integer predictive control (Q710707) (← links)
- Semidefinite relaxations for quadratically constrained quadratic programming: A review and comparisons (Q717135) (← links)
- Successive Lagrangian relaxation algorithm for nonconvex quadratic optimization (Q721146) (← links)
- Faster, but weaker, relaxations for quadratically constrained quadratic programs (Q742292) (← links)
- Semidefinite programming versus the reformulation-linearization technique for nonconvex quadratically constrained quadratic programming (Q1029700) (← links)
- Exact solutions of some nonconvex quadratic optimization problems via SDP and SOCP relaxa\-tions (Q1415482) (← links)
- Quadratic maximization and semidefinite relaxation (Q1575069) (← links)
- On the Slater condition for the SDP relaxations of nonconvex sets (Q1604046) (← links)
- Extra resource allocation: a DEA approach in the view of efficiencies (Q1655921) (← links)
- A note on representations of linear inequalities in non-convex mixed-integer quadratic programs (Q1728372) (← links)
- Enhancing semidefinite relaxation for quadratically constrained quadratic programming via penalty methods (Q1730782) (← links)
- A semidefinite programming method for integer convex quadratic minimization (Q1749779) (← links)
- From linear to semidefinite programming: an algorithm to obtain semidefinite relaxations for bivalent quadratic problems (Q1777422) (← links)
- Simplified semidefinite and completely positive relaxations (Q1785437) (← links)
- On the finite convergence of successive SDP relaxation methods (Q1848385) (← links)
- A recipe for semidefinite relaxation for \((0,1)\)-quadratic programming (Q1905964) (← links)
- Exact SDP relaxations for classes of nonlinear semidefinite programming problems (Q1939707) (← links)
- Enclosing ellipsoids and elliptic cylinders of semialgebraic sets and their application to error bounds in polynomial optimization (Q1949261) (← links)
- Penalized semidefinite programming for quadratically-constrained quadratic optimization (Q2022173) (← links)
- Exact dual bounds for some nonconvex minimax quadratic optimization problems (Q2043977) (← links)
- On the tightness of SDP relaxations of QCQPs (Q2133408) (← links)
- Doubly nonnegative relaxations are equivalent to completely positive reformulations of quadratic optimization problems with block-clique graph structures (Q2182857) (← links)
- Exact semidefinite formulations for a class of (random and non-random) nonconvex quadratic programs (Q2188238) (← links)
- A low-dimensional SDP relaxation based spatial branch and bound method for nonconvex quadratic programs (Q2244199) (← links)
- On the problem of packing spheres in a cube (Q2263331) (← links)
- Second order cone constrained convex relaxations for nonconvex quadratically constrained quadratic programming (Q2274889) (← links)
- Application of the method of semidefinite relaxation for determining the orientation of a solid body in space (Q2290408) (← links)
- Solution of Boolean quadratic programming problems by two augmented Lagrangian algorithms based on a continuous relaxation (Q2307500) (← links)
- A novel approach for solving semidefinite programs (Q2336591) (← links)
- A new semidefinite relaxation for \(L_{1}\)-constrained quadratic (Q2353474) (← links)
- Generalized S-lemma and strong duality in nonconvex quadratic programming (Q2392110) (← links)
- Correlative sparsity structures and semidefinite relaxations for concave cost transportation problems with change of variables (Q2392116) (← links)
- SDP-based branch-and-bound for non-convex quadratic integer optimization (Q2416574) (← links)
- Unbounded convex sets for non-convex mixed-integer quadratic programming (Q2436643) (← links)
- Using quadratic convex reformulation to tighten the convex relaxation of a quadratic program with complementarity constraints (Q2448160) (← links)
- A compact variant of the QCR method for quadratically constrained quadratic \(0-1\) programs (Q2448194) (← links)
- Complexity and nonlinear semidefinite programming reformulation of \(\ell_1\)-constrained nonconvex quadratic optimization (Q2448210) (← links)
- Semi-definite programming relaxation of quadratic assignment problems based on nonredundant matrix splitting (Q2515070) (← links)
- Causal state-feedback parameterizations in robust model predictive control (Q2628475) (← links)
- Nonconvex quadratic programming, semidefinite relaxations and randomization algorithms in information and decision systems (Q2722588) (← links)
- (Q2751323) (← links)
- New positive semidefinite relaxations for nonconvex quadratic programs (Q2768052) (← links)
