Global and local quadratic minimization
From MaRDI portal
Publication:1359045
DOI10.1023/A:1008278114178zbMath0872.90066MaRDI QIDQ1359045
Publication date: 24 June 1997
Published in: Journal of Global Optimization (Search for Journal in Brave)
Numerical mathematical programming methods (65K05) Nonconvex programming, global optimization (90C26) Quadratic programming (90C20)
Related Items (7)
A computational comparison of some branch and bound methods for indefinite quadratic programs ⋮ Extensions of the standard quadratic optimization problem: strong duality, optimality, hidden convexity and S-lemma ⋮ A new branch-and-bound algorithm for standard quadratic programming problems ⋮ HYPER SENSITIVITY ANALYSIS OF PORTFOLIO OPTIMIZATION PROBLEMS ⋮ Large margin shortest path routing ⋮ Adaptive global algorithm for solving box-constrained non-convex quadratic minimization problems ⋮ Decomposition methods for solving nonconvex quadratic programs via branch and bound
This page was built for publication: Global and local quadratic minimization
