scientific article; zbMATH DE number 221928
From MaRDI portal
Publication:4697332
Recommendations
- Global minimization of indefinite quadratic problems
- An algorithm for global minimization of linearly constrained quadratic functions
- scientific article; zbMATH DE number 1057696
- Publication:3491318
- An efficient algorithm for globally minimizing a quadratic function under convex quadratic constraints
Cited in
(25)- scientific article; zbMATH DE number 165579 (Why is no real title available?)
- Box-constrained quadratic programs with fixed charge variables
- Quadratic optimization over a polyhedral cone
- New optimality conditions for quadratic optimization problems with binary constraints
- Solutions and optimality criteria for nonconvex constrained global optimization problems with connections between canonical and Lagrangian duality
- Solutions to quadratic minimization problems with box and integer constraints
- Globally solving box-constrained nonconvex quadratic programs with semidefinite-based finite branch-and-bound
- Adaptive global algorithm for solving box-constrained non-convex quadratic minimization problems
- An LPCC approach to nonconvex quadratic programs
- A computational comparison of some branch and bound methods for indefinite quadratic programs
- A polyhedral study of nonconvex quadratic programs with box constraints
- Global minimization of indefinite quadratic problems
- A new algorithm for the general quadratic programming problems with box constraints
- Solutions and optimality criteria for nonconvex quadratic-exponential minimization problem
- Globally Solving Nonconvex Quadratic Programs via Linear Integer Programming Techniques
- A computational study on QP problems with general linear constraints
- On global integer extrema of real-valued box-constrained multivariate quadratic functions
- Decomposition branch and bound method for globally solving linearly constrained indefinite quadratic minimization problems
- Compact mixed-integer programming formulations in quadratic optimization
- A finite branch-and-bound algorithm for nonconvex quadratic programming via semidefinite relaxations
- A branch-and-cut algorithm for nonconvex quadratic programs with box constraints
- Bounds tightening based on optimality conditions for nonconvex box-constrained optimization
- Domain reduction techniques for global NLP and MINLP optimization
- Globally solving nonconvex quadratic programming problems with box constraints via integer programming methods
- A binarisation heuristic for non-convex quadratic programming with box constraints
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4697332)
