The DOI matches its Crossref record.
Multiplicative Updates for Nonnegative Quadratic Programming
Open accessAbstract
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.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cited by
Convex and Semi-Nonnegative Matrix Factorizations
Ding, C. H. Q., Li, T., & Jordan, M. I. (2010) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2008.277 · Cited by 1,317
The PAU Survey: Photometric redshifts using transfer learning from simulations
Eriksen, M., Alarcon, A., Cabayol, L., Carretero, J., Casas, R., Castander, F. J., De Vicente, J., Fernandez, E., Garcia-Bellido, J., Gaztanaga, E., et al. (2020) · Monthly Notices of the Royal Astronomical Society · doi:10.1093/mnras/staa2265 · Cited by 39
Metadata
- Authors
- Sha, F., Lin, Y., Saul, L. K., & Lee, D. D.
- Venue
- Neural Computation
- Publisher
- MIT Press
- Published
- 2007-08
- Volume
- 19
- Issue
- 8
- Pages
- 2004-2031
- ISSN
- 0899-7667 (ISSN-L)
- 1530-888X
- OpenAlex
- W2000023271
- Cited by
- 173
- References
- 0
- FWCI
- 12.93
- Type
- journal article
- Language
- en
- Open access
- green
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Multiplicative Updates for Nonnegative Quadratic Programming. https://app.cochat.ai/papers/10.1162/neco.2007.19.8.2004
- The paper
- Sha, F., Lin, Y., Saul, L. K., & Lee, D. D. (2007). Multiplicative Updates for Nonnegative Quadratic Programming. Neural Computation. https://doi.org/10.1162/neco.2007.19.8.2004
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.
