DocumentCode :
3081627
Title :
Optimization of Quadratic Forms: NP Hard Problems: Neural Networks
Author :
Murthy, Garimella Rama
Author_Institution :
Signal Process. & Commun. Res. Center, Int. Inst. of Inf. Technol., Hyderabad, India
fYear :
2013
fDate :
24-26 Aug. 2013
Firstpage :
217
Lastpage :
220
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.
Keywords :
computational complexity; convex programming; neural nets; NP hard problems; P ≠ NP problem; convex hull; global optimum stable state; heuristic algorithm; hypercube; neural networks; quadratic form optimization; Eigenvalues and eigenfunctions; Hopfield neural networks; Hypercubes; Optimization; Symmetric matrices; Vectors;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Computational and Business Intelligence (ISCBI), 2013 International Symposium on
Conference_Location :
New Delhi
Print_ISBN :
978-0-7695-5066-4
Type :
conf
DOI :
10.1109/ISCBI.2013.51
Filename :
6724356
Link To Document :
بازگشت