A polyhedral approach for nonconvex quadratic programming problems with box constraints
From MaRDI portal
Publication:1273053
DOI10.1023/A:1008293029350zbMath0912.90234OpenAlexW2165969805MaRDI QIDQ1273053
Yasutoshi Yajima, Tetsuya Fujie
Publication date: 2 December 1998
Published in: Journal of Global Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1023/a:1008293029350
linearizationbox constraintsheuristicvalid inequalitiescutting plane algorithmsnonconvex quadratic problems
Related Items
Globally solving nonconvex quadratic programming problems with box constraints via integer programming methods, The Boolean Quadric Polytope, Cutting Plane Generation through Sparse Principal Component Analysis, Separable relaxation for nonconvex quadratic integer programming: Integer diagonalization approach, On convex relaxations for quadratically constrained quadratic programming, On the impact of running intersection inequalities for globally solving polynomial optimization problems, Separating doubly nonnegative and completely positive matrices, Using general triangle inequalities within quadratic convex reformulation method, An exact solution method for unconstrained quadratic 0--1 programming: a geometric approach, Unbounded convex sets for non-convex mixed-integer quadratic programming, Valid inequalities for quadratic optimisation with domain constraints, On the problem of packing spheres in a cube, A polyhedral study of nonconvex quadratic programs with box constraints, Convex relaxation and Lagrangian decomposition for indefinite integer quadratic programming, A new algorithm for the general quadratic programming problems with box constraints, A binarisation heuristic for non-convex quadratic programming with box constraints, Adaptive global algorithm for solving box-constrained non-convex quadratic minimization problems, A new separation algorithm for the Boolean quadric and cut polytopes, Cutting planes for RLT relaxations of mixed 0-1 polynomial programs
