Pages that link to "Item:Q2644374"
From MaRDI portal
The following pages link to Partial Lagrangian relaxation for general quadratic programming (Q2644374):
Displayed 6 items.
- On the bridge between combinatorial optimization and nonlinear optimization: a family of semidefinite bounds for 0--1 quadratic problems leading to quasi-Newton methods (Q359624) (← links)
- Regularized Lagrangian duality for linearly constrained quadratic optimization and trust-region problems (Q620513) (← links)
- Extending the QCR method to general mixed-integer programs (Q662304) (← links)
- Solving \(k\)-cluster problems to optimality with semidefinite programming (Q1925793) (← links)
- A compact variant of the QCR method for quadratically constrained quadratic \(0-1\) programs (Q2448194) (← links)
- Numerical Study of Semidefinite Bounds for the k-cluster Problem (Q2883586) (← links)