Pages that link to "Item:Q2897305"

The following pages link to Linear Programming Relaxations of Quadratically Constrained Quadratic Programs (Q2897305):

Displaying 29 items.

• Global optimization advances in mixed-integer nonlinear programming, MINLP, and constrained derivative-free optimization, CDFO (Q322958) (← links)
• Semidefinite relaxations for non-convex quadratic mixed-integer programming (Q378112) (← links)
• On linear programs with linear complementarity constraints (Q452341) (← links)
• DC decomposition based branch-and-bound algorithms for box-constrained quadratic programs (Q723488) (← links)
• A distributed continuous-time method for non-convex QCQPs (Q1729053) (← links)
• Computation of weighted sums of rewards for concurrent MDPs (Q1731592) (← links)
• Matrix minor reformulation and SOCP-based spatial branch-and-cut method for the AC optimal power flow problem (Q1741115) (← links)
• Approximation algorithms from inexact solutions to semidefinite programming relaxations of combinatorial optimization problems (Q1751224) (← links)
• An integer linear programming approach for a class of bilinear integer programs (Q1785220) (← links)
• On convex relaxations for quadratically constrained quadratic programming (Q1925792) (← links)
• On convex relaxations of quadrilinear terms (Q1959235) (← links)
• Exact dual bounds for some nonconvex minimax quadratic optimization problems (Q2043977) (← links)
• Sparse PSD approximation of the PSD cone (Q2118107) (← links)
• Outer-product-free sets for polynomial optimization and oracle-based cuts (Q2196293) (← links)
• Second order cone constrained convex relaxations for nonconvex quadratically constrained quadratic programming (Q2274889) (← links)
• Template polyhedra and bilinear optimization (Q2322312) (← links)
• On the separation of split inequalities for non-convex quadratic integer programming (Q2339844) (← links)
• Bound reduction using pairs of linear inequalities (Q2392123) (← links)
• On minimal valid inequalities for mixed integer conic programs (Q2806815) (← links)
• Dynamically generated cutting planes for mixed-integer quadratically constrained quadratic programs and their incorporation into GloMIQO 2 (Q2943816) (← links)
• Obtaining Tighter Relaxations of Mathematical Programs with Complementarity Constraints (Q3454970) (← links)
• (Q3983798) (← links)
• (Q4218859) (← links)
• Hyperbolic Relaxation of $k$-Locally Positive Semidefinite Matrices (Q5072587) (← links)
• Cutting Plane Generation through Sparse Principal Component Analysis (Q5081781) (← links)
• Scalable Optimization Methods for Incorporating Spatiotemporal Fractionation into Intensity-Modulated Radiotherapy Planning (Q5086022) (← links)
• An Iterative Rank Penalty Method for Nonconvex Quadratically Constrained Quadratic Programs (Q5244155) (← links)
• Partial Lasserre relaxation for sparse Max-Cut (Q6050383) (← links)
• Subset Selection and the Cone of Factor-Width-<i>k</i> Matrices (Q6195312) (← links)