Pages that link to "Item:Q1304392"

The following pages link to Approximating global quadratic optimization with convex quadratic constraints (Q1304392):

Displaying 15 items.

• Approximation algorithms for homogeneous polynomial optimization with quadratic constraints (Q607501) (← 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)
• Moment inequalities for sums of random matrices and their applications in optimization (Q647387) (← links)
• A global optimization algorithm using parametric linearization relaxation (Q876659) (← links)
• A parametric linear relaxation algorithm for globally solving nonconvex quadratic programming (Q902804) (← links)
• Enhancing semidefinite relaxation for quadratically constrained quadratic programming via penalty methods (Q1730782) (← links)
• Improved semidefinite approximation bounds for nonconvex nonhomogeneous quadratic optimization with ellipsoid constraints (Q1785385) (← links)
• Penalized semidefinite programming for quadratically-constrained quadratic optimization (Q2022173) (← links)
• On the complexity of quadratic programming with two quadratic constraints (Q2364486) (← links)
• A deterministic global optimization algorithm based on a linearizing method for nonconvex quadratically constrained programs (Q2389836) (← links)
• Approximation bounds for quadratic maximization and max-cut problems with semidefinite programming relaxation (Q2475315) (← links)
• A new accelerating method for global non-convex quadratic optimization with non-convex quadratic constraints (Q2479256) (← links)
• A New Global Optimization Scheme for Quadratic Programs with Low-Rank Nonconvexity (Q5084603) (← links)
• Inhomogeneous polynomial optimization over a convex set: An approximation approach (Q5496212) (← links)