HOME HELP FEEDBACK SUBSCRIPTIONS ARCHIVE SEARCH TABLE OF CONTENTS		QUICK SEARCH:   [advanced] Author: Keyword(s): Year:  Vol:  Page:

This Article Full Text Full Text (PDF) Alert me when this article is cited Alert me if a correction is posted Services Similar articles in this journal Alert me to new issues of the journal Download to citation manager Citing Articles Citing Articles via Google Scholar Google Scholar Articles by Sha, F. Articles by Lee, D. D. Search for Related Content PubMed Articles by Sha, F. Articles by Lee, D. D.

Multiplicative Updates for Nonnegative Quadratic Programming

feisha{at}cs.berkeley.edu Computer Science Division, University of California, Berkeley, Berkeley, CA 94720, U.S.A.

Yuanqing Lin

linyuanq{at}seas.upenn.edu Department of Electrical and Systems Engineering, University of Pennsylvania, Philadelphia, PA 19104, U.S.A.

Lawrence K. Saul

saul{at}cs.ucsd.edu Department of Computer Science and Engineering, University of California, San Diego, La Jolla, CA 92093, U.S.A.

Daniel D. Lee

ddlee{at}seas.upenn.edu Department of Electrical and Systems Engineering, University of Pennsylvania, Philadelphia, PA 19104, U.S.A.

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.