首页 | 本学科首页   官方微博 | 高级检索  
     


Multiplicative updates for nonnegative quadratic programming
Authors:Sha Fei  Lin Yuanqing  Saul Lawrence K  Lee Daniel D
Affiliation:Computer Science Division, University of California, Berkeley, Berkeley, CA 94720, USA. feisha@cs.berkeley.edu
Abstract:Many problems in neural computation and statistical learning involve optimizations with nonnegativity constraints. In this article, we study convex problems in quadratic programming where the optimization is confined to an axis-aligned region in the nonnegative orthant. For these problems, we derive multiplicative updates that improve the value of the objective function at each iteration and converge monotonically to the global minimum. The updates have a simple closed form and do not involve any heuristics or free parameters that must be tuned to ensure convergence. Despite their simplicity, they differ strikingly in form from other multiplicative updates used in machine learning. We provide complete proofs of convergence for these updates and describe their application to problems in signal processing and pattern recognition.
Keywords:
本文献已被 PubMed 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号