Pages that link to "Item:Q1359045"
From MaRDI portal
The following pages link to Global and local quadratic minimization (Q1359045):
Displaying 7 items.
- Large margin shortest path routing (Q694164) (← links)
- Decomposition methods for solving nonconvex quadratic programs via branch and bound (Q811889) (← links)
- A computational comparison of some branch and bound methods for indefinite quadratic programs (Q940829) (← links)
- Extensions of the standard quadratic optimization problem: strong duality, optimality, hidden convexity and S-lemma (Q1987329) (← links)
- Adaptive global algorithm for solving box-constrained non-convex quadratic minimization problems (Q2073059) (← links)
- A new branch-and-bound algorithm for standard quadratic programming problems (Q4646674) (← links)
- HYPER SENSITIVITY ANALYSIS OF PORTFOLIO OPTIMIZATION PROBLEMS (Q4650599) (← links)
