Quadratic Programming Approach in the Non-Negatif Matrix Factorization

Abstract

Non-negative Matrix Factorization is an iteration optimization algorithm. ie to decipher one matrix into several non-negative component matrices. Non-negative Matrix Factorization (FMN) serves to obtain a picture of non-negative data. There is a problem in the Non-negative Matrix Factorization that is optimization at the constraint boundary, where in the optimization solution on the constraint boundary it is necessary to do long iteration and of course very difficult and conquers a long time. Quadratic Programing is an approach to solving linear optimization problems where the constraint is linear function and its purpose function is the square of the decision variable or multiplication of the two decision variables. This method is considered to be an effective method to overcome the optimization in the Non-negative Matrix Factorization.