Feb 29, 1988 · The global minimization of large-scale concave quadratic problems over a bounded polyhedral set using a parallel branch and bound approach is considered.
The global minimization of large-scale concave quadratic problems over a bounded polyhedral set using a parallel branch and bound approach is considered.
This equivalence allows the parallel algorithm presented for finding the global minimum of concave quadratic functions to be applied directly to solve the LCP.
Oct 22, 2024 · The global concave minimization problem is to find the constrained global minimum of a concave function. Since such a function may have many ...
We present an algorithm for the global minimization of a quadratic function ψ(x, y) = −½xTQx + hTx + dTy, over a polytope Ω = {(x, y) ∈ ℝn+k: Ax + By ≤ b, ...
This equivalence allows the parallel algorithm presented for finding the global minimum of concave quadratic functions to be applied directly to solve the LCP.
A parallel algorithm for constrained concave quadratic global minimization · Computer Science, Mathematics. Mathematical programming · 1988.
Large Scale Global Minimization of Linearly Constrained Concave Quadratic Func- tions and Related Problems. Ph.D. thesis, Computer Science Department ...
In this paper we have presented an algorithm for the global minimization of a concave quadratic ... Large Scale Global Minimization of Linearly Constrained ...
Missing: parallel | Show results with:parallel
A parallel algorithm for constrained concave quadratic global minimization · A. PhillipsJ. B. Rosen. Computer Science, Mathematics. Math. Program. 1988. TLDR.