Global solution of quadratic problems using interval methods and convex relaxations
From MaRDI portal
Cites work
- A reliable affine relaxation method for global optimization
- A rigorous lower bound for the optimal value of convex optimization problems
- Adaptive constructive interval disjunction: algorithms and experiments
- An efficient and safe framework for solving optimization problems
- Benchmarking optimization software with performance profiles.
- Computability of global solutions to factorable nonconvex programs: Part I — Convex underestimating problems
- Constructive Interval Disjunction
- Exact quadratic convex reformulations of mixed-integer quadratically constrained problems
- Global solution of non-convex quadratically constrained quadratic programs
- GLOMIQO: global mixed-integer quadratic optimizer
- Multiterm polyhedral relaxations for nonconvex, quadratically constrained quadratic programs
- Node selection strategies in interval branch and bound algorithms
- Semidefinite Programming
- Semidefinite programming versus the reformulation-linearization technique for nonconvex quadratically constrained quadratic programming
- Upper bounding in inner regions for global optimization under inequality constraints
- Using a conic bundle method to accelerate both phases of a quadratic convex reformulation
This page was built for publication: Global solution of quadratic problems using interval methods and convex relaxations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7020167)
