Optimization of Quadratic Forms: NP Hard Problems: Neural Networks

Abstract

In this research paper, the problem of optimization of a quadratic form over the convex hull generated by the corners of hypercube is attempted and solved. It is reasoned that under some conditions, the optimum occurs at the corners of hypercube. Some results related to the computation of global optimum stable state (an NP hard problem) are discussed. A heuristic algorithm is proposed. It is hoped that the results shed light on resolving the P ≠ NP problem.