Pages that link to "Item:Q4697332"
From MaRDI portal
The following pages link to Global minimization of indefinite quadratic functions subject to box constraints (Q4697332):
Displaying 25 items.
- An LPCC approach to nonconvex quadratic programs (Q431005) (← links)
- Bounds tightening based on optimality conditions for nonconvex box-constrained optimization (Q506441) (← links)
- Globally solving box-constrained nonconvex quadratic programs with semidefinite-based finite branch-and-bound (Q839489) (← links)
- Solutions and optimality criteria for nonconvex quadratic-exponential minimization problem (Q929341) (← links)
- Box-constrained quadratic programs with fixed charge variables (Q933786) (← links)
- A computational comparison of some branch and bound methods for indefinite quadratic programs (Q940829) (← links)
- Solutions to quadratic minimization problems with box and integer constraints (Q989896) (← links)
- New optimality conditions for quadratic optimization problems with binary constraints (Q1024733) (← links)
- Solutions and optimality criteria for nonconvex constrained global optimization problems with connections between canonical and Lagrangian duality (Q1037375) (← links)
- Global minimization of indefinite quadratic problems (Q1092620) (← links)
- An efficient algorithm for globally minimizing a quadratic function under convex quadratic constraints (Q1575066) (← links)
- Globally solving nonconvex quadratic programming problems with box constraints via integer programming methods (Q1621692) (← links)
- On global integer extrema of real-valued box-constrained multivariate quadratic functions (Q1680502) (← links)
- Domain reduction techniques for global NLP and MINLP optimization (Q1699520) (← links)
- A polyhedral study of nonconvex quadratic programs with box constraints (Q1774169) (← links)
- A branch-and-cut algorithm for nonconvex quadratic programs with box constraints (Q1774170) (← links)
- Decomposition branch and bound method for globally solving linearly constrained indefinite quadratic minimization problems (Q1924614) (← links)
- Adaptive global algorithm for solving box-constrained non-convex quadratic minimization problems (Q2073059) (← links)
- Compact mixed-integer programming formulations in quadratic optimization (Q2089884) (← links)
- A binarisation heuristic for non-convex quadratic programming with box constraints (Q2294229) (← links)
- A finite branch-and-bound algorithm for nonconvex quadratic programming via semidefinite relaxations (Q2476994) (← links)
- Quadratic optimization over a polyhedral cone (Q2515280) (← links)
- A computational study on QP problems with general linear constraints (Q2673522) (← links)
- Globally Solving Nonconvex Quadratic Programs via Linear Integer Programming Techniques (Q5139846) (← links)
- A new algorithm for the general quadratic programming problems with box constraints (Q5962186) (← links)
