Pages that link to "Item:Q5925726"
From MaRDI portal
The following pages link to Duality bound method for the general quadratic programming problem with quadratic constraints (Q5925726):
Displaying 11 items.
- Convergence and application of a decomposition method using duality bounds for nonconvex global optimization (Q700712) (← links)
- Decomposition branch-and-bound based algorithm for linear programs with additional multiplicative constraints (Q813372) (← links)
- A parametric linear relaxation algorithm for globally solving nonconvex quadratic programming (Q902804) (← links)
- On duality bound methods for nonconvex global optimization (Q995944) (← links)
- A novel optimization method for nonconvex quadratically constrained quadratic programs (Q1724769) (← links)
- Lagrangian decomposition of block-separable mixed-integer all-quadratic programs (Q1771303) (← links)
- Strong duality for general quadratic programs with quadratic equality constraints (Q2082247) (← links)
- Benefits of embedding structural constraints in coherent diagnostic processes (Q2386117) (← links)
- Branch-delete-bound algorithm for globally solving quadratically constrained quadratic programs (Q2409582) (← links)
- On a decomposition method for nonconvex global optimization (Q2463828) (← links)
- On solving nonconvex optimization problems by reducing the duality gap (Q2494287) (← links)
