Pages that link to "Item:Q1281481"

The following pages link to A simplicial branch-and-bound method for solving nonconvex all-quadratic programs (Q1281481):

Displaying 18 items.

• Exact quadratic convex reformulations of mixed-integer quadratically constrained problems (Q304240) (← 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)
• Nonconvex quadratically constrained quadratic programming: Best D.C. Decompositions and their SDP representations (Q645557) (← links)
• Solution existence and stability of quadratically constrained convex quadratic programs (Q691471) (← links)
• An accelerating algorithm for globally solving nonconvex quadratic programming (Q824677) (← links)
• A parametric linear relaxation algorithm for globally solving nonconvex quadratic programming (Q902804) (← links)
• Packing equal circles in a square: A deterministic global optimization approach (Q1613419) (← links)
• Extra resource allocation: a DEA approach in the view of efficiencies (Q1655921) (← links)
• A spatial branch-and-cut method for nonconvex QCQP with bounded complex variables (Q1675255) (← links)
• Quadratic convex reformulation for nonconvex binary quadratically constrained quadratic programming via surrogate constraint (Q1753128) (← links)
• A simplicial branch-and-bound algorithm for solving quadratically constrained quadratic programs (Q1780950) (← links)
• Global optimization approach to unequal global optimization approach to unequal sphere packing problems in 3D (Q1862200) (← links)
• The exact solution of multiparametric quadratically constrained quadratic programming problems (Q2022221) (← links)
• Rounding on the standard simplex: regular grids for global optimization (Q2250080) (← links)
• A branch and bound algorithm for general mixed-integer quadratic programs based on quadratic convex relaxation (Q2251137) (← links)
• An optimal trade-off model for portfolio selection with sensitivity of parameters (Q2628195) (← links)
• Optimal trade-off portfolio selection between total risk and maximum relative marginal risk^† (Q2829556) (← links)