The DOI matches its Crossref record; 9 of the 9 references it cites were found in a registry or an index.
Least squares with a quadratic constraint
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
An Algorithm for Least-Squares Estimation of Nonlinear Parameters
Marquardt, D. W. (1963) · Journal of the Society for Industrial and Applied Mathematics · doi:10.1137/0111030 · Cited by 30,728
Solving Least Squares Problems
Lawson, C. L., & Hanson, R. J. (1995) · doi:10.1137/1.9781611971217 · Cited by 7,103
The Levenberg-Marquardt algorithm: Implementation and theory
Moré, J. J. (1978) · Lecture Notes in Mathematics · doi:10.1007/bfb0067700 · Cited by 5,773
Generalized Cross-Validation as a Method for Choosing a Good Ridge Parameter
Golub, G. H., Heath, M., & Wahba, G. (1979) · Technometrics · doi:10.1080/00401706.1979.10489751 · Cited by 3,934
Reinsch, C. H. (1967) · Numerische Mathematik · doi:10.1007/bf02162161 · Cited by 2,236
Solving Least Squares Problems
Bjork, A., Lawson, C. L., & Hanson, R. J. (1976) · Mathematics of Computation · doi:10.2307/2005340 · Cited by 1,146
Generalizing the Singular Value Decomposition
Loan, C. F. V. (1976) · SIAM Journal on Numerical Analysis · doi:10.1137/0713009 · Cited by 656
Algorithms for the regularization of ill-conditioned least squares problems
Eldén, L. (1977) · BIT Numerical Mathematics · doi:10.1007/bf01932285 · Cited by 308
On the Stationary Values of a Second-Degree Polynomial on the Unit Sphere
Forsythe, G. E., & Golub, G. H. (1965) · Journal of the Society for Industrial and Applied Mathematics · doi:10.1137/0113073 · Cited by 106
Cited by
Robust minimum variance beamforming
Lorenz, R. G., & Boyd, S. P. (2005) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2005.845436 · Cited by 774
Metadata
- Authors
- Gander, W.
- Venue
- Numerische Mathematik
- Published
- 1980-09
- Volume
- 36
- Issue
- 3
- Pages
- 291-307
- ISSN
- 0029-599X (ISSN-L)
- 0945-3245
- OpenAlex
- W1972636512
- Cited by
- 280
- References
- 9
- FWCI
- 0.68
- 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.
