Pages that link to "Item:Q645557"
From MaRDI portal
The following pages link to Nonconvex quadratically constrained quadratic programming: Best D.C. Decompositions and their SDP representations (Q645557):
Displaying 21 items.
- A model for clustering data from heterogeneous dissimilarities (Q323236) (← links)
- Global optimization algorithm for mixed integer quadratically constrained quadratic program (Q515761) (← links)
- Convex relaxations for nonconvex quadratically constrained quadratic programming: matrix cone decomposition and polyhedral approximation (Q644906) (← links)
- Successive Lagrangian relaxation algorithm for nonconvex quadratic optimization (Q721146) (← links)
- DC decomposition based branch-and-bound algorithms for box-constrained quadratic programs (Q723488) (← links)
- Faster, but weaker, relaxations for quadratically constrained quadratic programs (Q742292) (← links)
- A new branch-and-cut algorithm for non-convex quadratic programming via alternative direction method and semidefinite relaxation (Q820743) (← links)
- On global optimization with indefinite quadratics (Q1707078) (← links)
- Enhancing semidefinite relaxation for quadratically constrained quadratic programming via penalty methods (Q1730782) (← links)
- Quadratic convex reformulation for nonconvex binary quadratically constrained quadratic programming via surrogate constraint (Q1753128) (← links)
- On solving quadratically constrained quadratic programming problem with one non-convex constraint (Q1790405) (← links)
- On convex relaxations for quadratically constrained quadratic programming (Q1925792) (← links)
- Conic approximation to nonconvex quadratic programming with convex quadratic constraints (Q2018510) (← links)
- Outer space branch and bound algorithm for solving linear multiplicative programming problems (Q2022174) (← links)
- An efficient global algorithm for worst-case linear optimization under uncertainties based on nonlinear semidefinite relaxation (Q2044572) (← links)
- A low-dimensional SDP relaxation based spatial branch and bound method for nonconvex quadratic programs (Q2244199) (← links)
- On indefinite quadratic optimization over the intersection of balls and linear constraints (Q2671444) (← links)
- Computational Methods for Solving Nonconvex Block-Separable Constrained Quadratic Problems (Q2810546) (← links)
- Dynamically generated cutting planes for mixed-integer quadratically constrained quadratic programs and their incorporation into GloMIQO 2 (Q2943816) (← links)
- Disjoint Bilinear Optimization: A Two-Stage Robust Optimization Perspective (Q5057987) (← links)
- Sustainable two stage supply chain management: a quadratic optimization approach with a quadratic constraint (Q6170034) (← links)
