Pages that link to "Item:Q717135"

The following pages link to Semidefinite relaxations for quadratically constrained quadratic programming: A review and comparisons (Q717135):

Displaying 50 items.

• Global solutions to a class of CEC benchmark constrained optimization problems (Q279808) (← links)
• Exact quadratic convex reformulations of mixed-integer quadratically constrained problems (Q304240) (← links)
• On conic QPCCs, conic QCQPs and completely positive programs (Q312665) (← links)
• Exactness conditions for an SDP relaxation of the extended trust region problem (Q315474) (← links)
• Global optimization advances in mixed-integer nonlinear programming, MINLP, and constrained derivative-free optimization, CDFO (Q322958) (← links)
• Generating cutting planes for the semidefinite relaxation of quadratic programs (Q337405) (← links)
• GLOMIQO: global mixed-integer quadratic optimizer (Q367170) (← links)
• Representing quadratically constrained quadratic programs as generalized copositive programs (Q439919) (← links)
• Satisfactory fault tolerant control with soft-constraint for discrete time-varying systems: numerical recursive approach (Q509390) (← links)
• An eigenvalue decomposition based branch-and-bound algorithm for nonconvex quadratic programming problems with convex quadratic constraints (Q513160) (← links)
• Relaxations and discretizations for the pooling problem (Q513173) (← links)
• How to convexify the intersection of a second order cone and a nonconvex quadratic (Q517311) (← links)
• Extensions on ellipsoid bounds for quadratic integer programming (Q721161) (← links)
• Faster, but weaker, relaxations for quadratically constrained quadratic programs (Q742292) (← links)
• Semidefinite programming versus the reformulation-linearization technique for nonconvex quadratically constrained quadratic programming (Q1029700) (← links)
• Semidefinite programming relaxation for nonconvex quadratic programs (Q1361074) (← links)
• A fair division approach to humanitarian logistics inspired by conditional value-at-risk (Q1640048) (← links)
• Enhancing semidefinite relaxation for quadratically constrained quadratic programming via penalty methods (Q1730782) (← links)
• From linear to semidefinite programming: an algorithm to obtain semidefinite relaxations for bivalent quadratic problems (Q1777422) (← links)
• A recipe for semidefinite relaxation for \((0,1)\)-quadratic programming (Q1905964) (← links)
• Global optimization of mixed-integer quadratically-constrained quadratic programs (MIQCQP) through piecewise-linear and edge-concave relaxations (Q1925777) (← links)
• A new algorithm for concave quadratic programming (Q2010088) (← links)
• Penalized semidefinite programming for quadratically-constrained quadratic optimization (Q2022173) (← links)
• The exact solution of multiparametric quadratically constrained quadratic programming problems (Q2022221) (← links)
• SDP-quality bounds via convex quadratic relaxations for global optimization of mixed-integer quadratic programs (Q2097634) (← links)
• Inside-ellipsoid outside-sphere (IEOS) model for general bilinear feasibility problems: feasibility analysis and solution algorithm (Q2103717) (← links)
• A new SOCP relaxation of nonconvex quadratic programming problems with a few negative eigenvalues (Q2112679) (← links)
• Exact SDP relaxations of quadratically constrained quadratic programs with forest structures (Q2114577) (← links)
• An outcome-space-based branch-and-bound algorithm for a class of sum-of-fractions problems (Q2116605) (← links)
• On the tightness of SDP relaxations of QCQPs (Q2133408) (← links)
• The \(p\)-Lagrangian relaxation for separable nonconvex MIQCQP problems (Q2162511) (← links)
• Sign patterns of inverse doubly-nonnegative matrices (Q2228119) (← links)
• A branch-and-bound algorithm for solving max-\(k\)-cut problem (Q2231324) (← links)
• Optimal portfolio deleveraging under market impact and margin restrictions (Q2240011) (← links)
• Second order cone constrained convex relaxations for nonconvex quadratically constrained quadratic programming (Q2274889) (← links)
• A gentle, geometric introduction to copositive optimization (Q2349118) (← links)
• Facets of a mixed-integer bilinear covering set with bounds on variables (Q2423814) (← links)
• On the gap between the quadratic integer programming problem and its semidefinite relaxation (Q2492705) (← links)
• A sensitive-eigenvector based global algorithm for quadratically constrained quadratic programming (Q2633541) (← links)
• A reformulation-linearization technique for optimization over simplices (Q2689826) (← links)
• New bounds for nonconvex quadratically constrained quadratic programming (Q2689857) (← links)
• Improved convex and concave relaxations of composite bilinear forms (Q2697000) (← links)
• Linear programing relaxations for a strategic pricing problem in electricity markets (Q2968496) (← links)
• A guide to conic optimisation and its applications (Q4634309) (← links)
• Global solution of non-convex quadratically constrained quadratic programs (Q4646675) (← links)
• On Doubly Positive Semidefinite Programming Relaxations (Q4688180) (← links)
• A simultaneous diagonalization-based quadratic convex reformulation for nonconvex quadratically constrained quadratic program (Q5038154) (← links)
• Exploiting aggregate sparsity in second-order cone relaxations for quadratic constrained quadratic programming problems (Q5038440) (← links)
• On Convex Hulls of Epigraphs of QCQPs (Q5041762) (← links)
• (Q5054600) (← links)