Pages that link to "Item:Q4646675"
From MaRDI portal
The following pages link to Global solution of non-convex quadratically constrained quadratic programs (Q4646675):
Displaying 18 items.
- GLOMIQO: global mixed-integer quadratic optimizer (Q367170) (← links)
- Global optimization algorithm for mixed integer quadratically constrained quadratic program (Q515761) (← links)
- A spatial branch-and-cut method for nonconvex QCQP with bounded complex variables (Q1675255) (← links)
- Global optimal solution to quadratic discrete programming problem with inequality constraints (Q1696983) (← links)
- Global optimization of mixed-integer quadratically-constrained quadratic programs (MIQCQP) through piecewise-linear and edge-concave relaxations (Q1925777) (← links)
- Computing mixed strategies equilibria in presence of switching costs by the solution of nonconvex QP problems (Q2044489) (← links)
- Solving unconstrained 0-1 polynomial programs through quadratic convex reformulation (Q2045008) (← links)
- Compact mixed-integer programming formulations in quadratic optimization (Q2089884) (← links)
- A branch and bound algorithm for general mixed-integer quadratic programs based on quadratic convex relaxation (Q2251137) (← links)
- (Q4349515) (← links)
- Spatial branch-and-bound algorithm for MIQCPs featuring multiparametric disaggregation (Q4594828) (← links)
- A simultaneous diagonalization-based quadratic convex reformulation for nonconvex quadratically constrained quadratic program (Q5038154) (← links)
- A New Global Optimization Scheme for Quadratic Programs with Low-Rank Nonconvexity (Q5084603) (← links)
- Globally Solving Nonconvex Quadratic Programs via Linear Integer Programming Techniques (Q5139846) (← links)
- Risk-allocation-based index tracking (Q6164597) (← links)
- Using general triangle inequalities within quadratic convex reformulation method (Q6175568) (← links)
- A tight compact quadratically constrained convex relaxation of the optimal power flow problem (Q6568415) (← links)
- Polynomial optimization: tightening RLT-based branch-and-bound schemes with conic constraints (Q6661703) (← links)
