Pages that link to "Item:Q1774170"
From MaRDI portal
The following pages link to A branch-and-cut algorithm for nonconvex quadratic programs with box constraints (Q1774170):
Displayed 30 items.
- Semidefinite relaxations for non-convex quadratic mixed-integer programming (Q378112) (← links)
- An LPCC approach to nonconvex quadratic programs (Q431005) (← links)
- On linear programs with linear complementarity constraints (Q452341) (← links)
- RLT: A unified approach for discrete and continuous nonconvex optimization (Q537611) (← links)
- Relaxing the optimality conditions of box QP (Q538311) (← links)
- Quadratic factorization heuristics for copositive programming (Q542052) (← links)
- Convex relaxations of non-convex mixed integer quadratically constrained programs: projected formulations (Q652290) (← links)
- Globally solving box-constrained nonconvex quadratic programs with semidefinite-based finite branch-and-bound (Q839489) (← links)
- A note on sufficient global optimality conditions for fixed charge quadratic programs (Q845625) (← links)
- Convex programming with single separable constraint and bounded variables (Q885824) (← links)
- Box-constrained quadratic programs with fixed charge variables (Q933786) (← links)
- Optimizing a polyhedral-semidefinite relaxation of completely positive programs (Q977327) (← links)
- Semidefinite programming versus the reformulation-linearization technique for nonconvex quadratically constrained quadratic programming (Q1029700) (← links)
- Globally solving nonconvex quadratic programming problems via completely positive programming (Q1762459) (← links)
- A polyhedral study of nonconvex quadratic programs with box constraints (Q1774169) (← links)
- Global optimization of mixed-integer quadratically-constrained quadratic programs (MIQCQP) through piecewise-linear and edge-concave relaxations (Q1925777) (← links)
- On convex relaxations for quadratically constrained quadratic programming (Q1925792) (← links)
- Algorithms for linear programming with linear complementarity constraints (Q1935876) (← links)
- Separation and relaxation for cones of quadratic forms (Q1942279) (← links)
- ANTIGONE: algorithms for coNTinuous/Integer global optimization of nonlinear equations (Q2250093) (← links)
- Outlier detection and least trimmed squares approximation using semi-definite programming (Q2445775) (← links)
- A finite branch-and-bound algorithm for nonconvex quadratic programming via semidefinite relaxations (Q2476994) (← links)
- Computable representations for convex hulls of low-dimensional quadratic forms (Q2638365) (← links)
- Convex relaxations of non-convex mixed integer quadratically constrained programs: Extended formulations (Q2638381) (← links)
- Disjunctive Cuts for Nonconvex MINLP (Q2897296) (← links)
- Linear Programming Relaxations of Quadratically Constrained Quadratic Programs (Q2897305) (← links)
- Disjunctive Cuts for Non-convex Mixed Integer Quadratically Constrained Programs (Q3503837) (← links)
- Solving the canonical dual of box- and integer-constrained nonconvex quadratic programs via a deterministic direct search algorithm (Q4924117) (← links)
- Convex quadratic relaxations of nonconvex quadratically constrained quadratic programs (Q5746688) (← links)
- A new algorithm for the general quadratic programming problems with box constraints (Q5962186) (← links)