On The Reduction of Duality Gap in Box Constrained Nonconvex Quadratic Program
From MaRDI portal
Recommendations
- On nonconvex quadratic programming with box constraints
- On solving nonconvex optimization problems by reducing the duality gap
- On box constrained concave quadratic optimization
- A polyhedral study of nonconvex quadratic programs with box constraints
- A polyhedral approach for nonconvex quadratic programming problems with box constraints
- scientific article; zbMATH DE number 1372689
- On zero duality gap in nonconvex quadratic programming problems
- Solution to nonconvex quadratic programming with both inequality and box constraints
- Canonical duality for box constrained nonconvex and nonsmooth optimization problems
- Solutions and optimality criteria to box constrained nonconvex minimization problems
Cited in
(9)- Enhancing semidefinite relaxation for quadratically constrained quadratic programming via penalty methods
- A survey of hidden convex optimization
- Tightening a copositive relaxation for standard quadratic optimization problems
- Duality gap estimation of linear equality constrained binary quadratic programming
- New semidefinite programming relaxations for box constrained quadratic program
- On zero duality gap in nonconvex quadratic programming problems
- Improved estimation of duality gap in binary quadratic programming using a weighted distance measure
- On duality gap in binary quadratic programming
- On reduction of duality gap in quadratic knapsack problems
This page was built for publication: On The Reduction of Duality Gap in Box Constrained Nonconvex Quadratic Program
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3105771)
