Pages that link to "Item:Q4509736"
From MaRDI portal
The following pages link to Cones of Matrices and Successive Convex Relaxations of Nonconvex Sets (Q4509736):
Displaying 23 items.
- Generating cutting planes for the semidefinite relaxation of quadratic programs (Q337405) (← links)
- A note on set-semidefinite relaxations of nonconvex quadratic programs (Q386483) (← links)
- Convex relaxations for nonconvex quadratically constrained quadratic programming: matrix cone decomposition and polyhedral approximation (Q644906) (← links)
- Semidefinite programming for discrete optimization and matrix completion problems (Q697582) (← links)
- Faster, but weaker, relaxations for quadratically constrained quadratic programs (Q742292) (← links)
- Conic mixed-integer rounding cuts (Q847842) (← links)
- Sequential semidefinite program for maximum robustness design of structures under load uncertainty (Q868549) (← links)
- On the Slater condition for the SDP relaxations of nonconvex sets (Q1604046) (← links)
- Enhancing semidefinite relaxation for quadratically constrained quadratic programming via penalty methods (Q1730782) (← links)
- New global algorithms for quadratic programming with a few negative eigenvalues based on alternative direction method and convex relaxation (Q1741128) (← links)
- On the finite convergence of successive SDP relaxation methods (Q1848385) (← links)
- Unification of lower-bound analyses of the lift-and-project rank of combinatorial optimization polyhedra (Q2462348) (← links)
- A finite branch-and-bound algorithm for nonconvex quadratic programming via semidefinite relaxations (Q2476994) (← links)
- Global optimization of rational functions: a semidefinite programming approach (Q2490324) (← links)
- New bounds for nonconvex quadratically constrained quadratic programming (Q2689857) (← links)
- Polynomials nonnegative on a grid and discrete optimization (Q2759070) (← links)
- Second order cone programming relaxation of nonconvex quadratic optimization problems (Q2770189) (← links)
- On Robust Solutions to Uncertain Linear Complementarity Problems and their Variants (Q2828336) (← links)
- Obtaining Tighter Relaxations of Mathematical Programs with Complementarity Constraints (Q3454970) (← links)
- Semidefinite relaxation for linear programs with equilibrium constraints (Q4921222) (← links)
- A Notion of Total Dual Integrality for Convex, Semidefinite, and Extended Formulations (Q5216778) (← links)
- Convex quadratic relaxations of nonconvex quadratically constrained quadratic programs (Q5746688) (← links)
- Intersection cuts for nonlinear integer programming: convexification techniques for structured sets (Q5962729) (← links)
