Pages that link to "Item:Q5757352"

The following pages link to Strong Duality in Nonconvex Quadratic Optimization with Two Quadratic Constraints (Q5757352):

Displaying 50 items.

• S-lemma with equality and its applications (Q263215) (← links)
• Trust region subproblem with an additional linear inequality constraint (Q276335) (← links)
• SDP reformulation for robust optimization problems based on nonconvex QP duality (Q354630) (← links)
• On zero duality gap in nonconvex quadratic programming problems (Q421278) (← links)
• Semidefinite complementarity reformulation for robust Nash equilibrium problems with Euclidean uncertainty sets (Q452335) (← links)
• A new semidefinite programming relaxation scheme for a class of quadratic matrix problems (Q453058) (← links)
• The generalized trust region subproblem (Q457202) (← links)
• Trust-region problems with linear inequality constraints: exact SDP relaxation, global optimality and robust optimization (Q463723) (← links)
• Regularized Lagrangian duality for linearly constrained quadratic optimization and trust-region problems (Q620513) (← links)
• Convex relaxations for nonconvex quadratically constrained quadratic programming: matrix cone decomposition and polyhedral approximation (Q644906) (← links)
• Moment inequalities for sums of random matrices and their applications in optimization (Q647387) (← links)
• Extended trust-region problems with one or two balls: exact copositive and Lagrangian relaxations (Q721169) (← links)
• Quadratic optimization with two ball constraints (Q779620) (← links)
• Robust linear MIMO in the downlink: A worst-case optimization with ellipsoidal uncertainty regions (Q939618) (← links)
• On the convexity of a class of quadratic mappings and its application to the problem of finding the smallest ball enclosing a given intersection of balls (Q946350) (← links)
• A convex optimization approach for minimizing the ratio of indefinite quadratic functions over an ellipsoid (Q1016108) (← links)
• Convexity properties associated with nonconvex quadratic matrix functions and applications to quadratic programming (Q1035905) (← links)
• A fast eigenvalue approach for solving the trust region subproblem with an additional linear inequality (Q1655381) (← links)
• Quadratic programs with hollows (Q1659682) (← links)
• A computational study of global optimization solvers on two trust region subproblems (Q1668805) (← links)
• A spatial branch-and-cut method for nonconvex QCQP with bounded complex variables (Q1675255) (← links)
• A branch and bound algorithm for nonconvex quadratic optimization with ball and linear constraints (Q1679484) (← links)
• Quadratic convex reformulation for nonconvex binary quadratically constrained quadratic programming via surrogate constraint (Q1753128) (← links)
• Centered solutions for uncertain linear equations (Q1789636) (← links)
• Robust solutions of quadratic optimization over single quadratic constraint under interval uncertainty (Q1941033) (← links)
• Parametric approach for solving quadratic fractional optimization with a linear and a quadratic constraint (Q2013617) (← links)
• Chebyshev center of the intersection of balls: complexity, relaxation and approximation (Q2020607) (← links)
• Exact dual bounds for some nonconvex minimax quadratic optimization problems (Q2043977) (← links)
• Strong duality for general quadratic programs with quadratic equality constraints (Q2082247) (← links)
• On the tightness of SDP relaxations of QCQPs (Q2133408) (← links)
• On the local stability of semidefinite relaxations (Q2144546) (← links)
• A survey of hidden convex optimization (Q2176821) (← links)
• Second order cone constrained convex relaxations for nonconvex quadratically constrained quadratic programming (Q2274889) (← links)
• A hybrid algorithm for the two-trust-region subproblem (Q2322760) (← links)
• Narrowing the difficulty gap for the Celis-Dennis-Tapia problem (Q2349132) (← links)
• Generalized S-lemma and strong duality in nonconvex quadratic programming (Q2392110) (← links)
• Proximal gradient methods for multiobjective optimization and their applications (Q2419509) (← links)
• Geometric properties for level sets of quadratic functions (Q2633540) (← links)
• A Note on Polynomial Solvability of the CDT Problem (Q2789609) (← links)
• A Two-Variable Approach to the Two-Trust-Region Subproblem (Q2796795) (← links)
• Kronecker Product Constraints with an Application to the Two-Trust-Region Subproblem (Q2968177) (← links)
• Exact Second-Order Cone Programming Relaxations for Some Nonconvex Minimax Quadratic Optimization Problems (Q4609471) (← links)
• A Block Lanczos Method for the Extended Trust-Region Subproblem (Q4629333) (← links)
• Minimizing an indefinite quadratic function subject to a single indefinite quadratic constraint (Q4639117) (← links)
• A branch-and-cut algorithm using polar cuts for solving nonconvex quadratic programming problems (Q4639134) (← links)
• Some remarks on duality and optimality of a class of constrained convex quadratic minimization problems (Q4987691) (← links)
• (Q4993268) (← links)
• On Convex Hulls of Epigraphs of QCQPs (Q5041762) (← links)
• Simultaneous Diagonalization via Congruence of Hermitian Matrices: Some Equivalent Conditions and a Numerical Solution (Q5088656) (← links)
• (Q5214187) (← links)