The DOI matches its Crossref record; 1 of the 1 references it cites were found in a registry or an index.
Projected gradient methods for linearly constrained problems
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
Cites
Gill, P. E., Murray, W., & Wright, M. H. (2019) · doi:10.1137/1.9781611975604 · Cited by 1,737 · cited 1×
“Standard algorithms for the general quadratic programming problem (see, for example, Gill, Murray and Wright (1981), and Fletcher (1981)) The following algorithm is quite similar to standard quadratic programming algorithms, but uses the gradient projection method to predict the new working set.”
Method
Cited by
Iterative Methods for Optimization
Kelley, C. T. (1999) · Society for Industrial and Applied Mathematics eBooks · doi:10.1137/1.9781611970920 · Cited by 2,052
Projected Gradient Methods for Nonnegative Matrix Factorization
Lin, C.-J. (2007) · Neural Computation · doi:10.1162/neco.2007.19.10.2756 · Cited by 1,737
Gradient Surgery for Multi-Task Learning
Yu, T., Kumar, S., Gupta, A., Levine, S., Hausman, K., & Finn, C. (2020) · arXiv · doi:10.48550/arxiv.2001.06782 · Cited by 755
Learning The Discriminative Power-Invariance Trade-Off
Varma, M., & Ray, D. (2007) · 2007 IEEE 11th International Conference on Computer Vision · doi:10.1109/iccv.2007.4408875 · Cited by 520
Pattern Search Algorithms for Bound Constrained Minimization
Lewis, R. M., & Torczon, V. (1999) · SIAM Journal on Optimization · doi:10.1137/s1052623496300507 · Cited by 494
Choi, J., Mo, J., & Heath, R. W. (2016) · IEEE Transactions on Communications · doi:10.1109/tcomm.2016.2545666 · Cited by 471
Pattern Search Methods for Linearly Constrained Minimization
Lewis, R. M., & Torczon, V. (2000) · SIAM Journal on Optimization · doi:10.1137/s1052623497331373 · Cited by 395
On the Solution of Large Quadratic Programming Problems with Bound Constraints
Moré, J. J., & Toraldo, G. (1991) · SIAM Journal on Optimization · doi:10.1137/0801008 · Cited by 335
Self-citationA limited-memory algorithm for bound-constrained optimization
Byrd, R. H., Peihuang, L., & Nocedal, J. (1996) · doi:10.2172/204262 · Cited by 313
Metadata
- Authors
- Calamai, P. H., & Moré, J. J.
- Venue
- Mathematical Programming
- Published
- 1987-09
- Volume
- 39
- Issue
- 1
- Pages
- 93-116
- ISSN
- 0025-5610 (ISSN-L)
- 1436-4646
- OpenAlex
- W2098132613
- Cited by
- 588
- References
- 1
- FWCI
- 6.12
- Type
- journal article
- Language
- en
- Open access
- closed
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
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.