Pages that link to "Item:Q3225239"
From MaRDI portal
The following pages link to KKT Solution and Conic Relaxation for Solving Quadratically Constrained Quadratic Programming Problems (Q3225239):
Displaying 21 items.
- Global solutions to a class of CEC benchmark constrained optimization problems (Q279808) (← links)
- On the solution of convex QPQC problems with elliptic and other separable constraints with strong curvature (Q297833) (← links)
- On conic QPCCs, conic QCQPs and completely positive programs (Q312665) (← links)
- Doubly nonnegative relaxation method for solving multiple objective quadratic programming problems (Q380592) (← links)
- The unconstrained binary quadratic programming problem: a survey (Q405668) (← links)
- An eigenvalue decomposition based branch-and-bound algorithm for nonconvex quadratic programming problems with convex quadratic constraints (Q513160) (← links)
- Successive Lagrangian relaxation algorithm for nonconvex quadratic optimization (Q721146) (← links)
- On solving quadratically constrained quadratic programming problem with one non-convex constraint (Q1790405) (← links)
- Conic approximation to nonconvex quadratic programming with convex quadratic constraints (Q2018510) (← links)
- Detecting copositivity of a symmetric matrix by an adaptive ellipsoid-based approximation scheme (Q2355798) (← links)
- Architecting a fully fuzzy information model for multi-level quadratically constrained quadratic programming problem (Q2425013) (← links)
- Second order optimality conditions and reformulations for nonconvex quadratically constrained quadratic programming problems (Q2438409) (← links)
- Quadratic optimization over a polyhedral cone (Q2515280) (← links)
- Maximum probability O-D matrix estimation in large-sized networks (Q3389550) (← links)
- Completely positive and copositive program modelling for quadratic optimization problems (Q5151542) (← links)
- Adaptive computable approximation to cones of nonnegative quadratic functions (Q5169468) (← links)
- Copositive Relaxation Beats Lagrangian Dual Bounds in Quadratically and Linearly Constrained Quadratic Optimization Problems (Q5501200) (← links)
- An approximation algorithm for optimal piecewise linear interpolations of bounded variable products (Q6086136) (← links)
- Outcome-space branch-and-bound outer approximation algorithm for a class of non-convex quadratic programming problems (Q6102175) (← links)
- Convex hull results on quadratic programs with non-intersecting constraints (Q6126659) (← links)
- Semidefinite representable reformulations for two variants of the trust-region subproblem (Q6556206) (← links)