Parallel search algorithms in global optimization (Q1114315): Difference between revisions

Certain approaches for parallel search algorithms for global optimization problems are analyzed. This approach for the general quadratic problem \(global\min_{x\in \Omega}c^ Tx+1/2x^ TQx\) with constraints \(\{\) \(x|\) Ax\(\leq b\), \(x\geq 0\}\) is based on the use of multiple-cost-row linear programming. For the linear complementary problem which has the following equivalent formulation as a global optimization problem \(global\min_{x\in S}\phi (x)=1/2x^ T\bar Mx+q^ Tx\) where \(\bar M=M+M^ T\) and \(S=\{x|\) \(Mx+q\geq 0\), \(x\geq 0\}\) parallel search techniques are applied. Computational results with these algorithms are reported in further papers of the author.