Pages that link to "Item:Q1905961"
From MaRDI portal
The following pages link to A reformulation-convexification approach for solving nonconvex quadratic programming problems (Q1905961):
Displaying 14 items.
- A reformulation-linearization based algorithm for the smallest enclosing circle problem (Q2666744) (← links)
- A reformulation-linearization technique for optimization over simplices (Q2689826) (← links)
- New bounds for nonconvex quadratically constrained quadratic programming (Q2689857) (← links)
- Dynamically generated cutting planes for mixed-integer quadratically constrained quadratic programs and their incorporation into GloMIQO 2 (Q2943816) (← links)
- Linear programing relaxations for a strategic pricing problem in electricity markets (Q2968496) (← links)
- Quadratic 0–1 programming: Tightening linear or quadratic convex reformulation by use of relaxations (Q3539803) (← links)
- A branch-and-cut algorithm using polar cuts for solving nonconvex quadratic programming problems (Q4639134) (← links)
- Solving the canonical dual of box- and integer-constrained nonconvex quadratic programs via a deterministic direct search algorithm (Q4924117) (← links)
- A New Global Optimization Scheme for Quadratic Programs with Low-Rank Nonconvexity (Q5084603) (← links)
- Canonical Duality-Triality Theory: Unified Understanding for Modeling, Problems, and NP-Hardness in Global Optimization of Multi-Scale Systems (Q5114939) (← links)
- (Q5208413) (← links)
- Global optimization of general non-convex problems with intermediate bilinear substructures (Q5746708) (← links)
- Polynomial optimization: tightening RLT-based branch-and-bound schemes with conic constraints (Q6661703) (← links)
- Polyhedral properties of RLT relaxations of nonconvex quadratic programs and their implications on exact relaxations (Q6665387) (← links)
