The DOI matches its Crossref record; 5 of the 5 references it cites were found in a registry or an index.
Sufficient conditions for the convergence of monotonic mathematicalprogramming algorithms
Open accessOverview
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.
Claims other papers make about this one
Each is checked against this paper’s own text: does it say what the citing paper says it does?
The cited source says what the claim attributes to it.
In the citing paper
“However, if f is strictly monotone with respect to Φ , then we can strengthen Zangwill's global convergence theorem (Meyer, 1976).”
From Hopfield Networks is All You Need (2020) · cites this paper as Meyer, 1976
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
On the Convergence of Some Feasible Direction Algorithms for Nonlinear Programming
Topkis, D. M., & Veinott, A. F. (1967) · SIAM Journal on Control · doi:10.1137/0305018 · Cited by 148
Mangasrian, O. L. (1972) · Journal of Engineering for Industry · doi:10.1115/1.3428164 · Cited by 134
The Validity of a Family of Optimization Methods
Meyer, R. (1970) · SIAM Journal on Control · doi:10.1137/0308003 · Cited by 115
Self-citationOn the Convergence of Algorithms with Restart
Meyer, R. R. (1976) · SIAM Journal on Numerical Analysis · doi:10.1137/0713057 · Cited by 8
Self-citationApplication of Liapunov's Direct Method to Fixed Point Theorems
George, J. H., Sehgal, V. M., & Smithson, R. E. (1971) · Proceedings of the American Mathematical Society · doi:10.1090/s0002-9939-1971-0281185-9 · Cited by 4
Cited by
Biconvex sets and optimization with biconvex functions: a survey and extensions
Gorski, J., Pfeuffer, F., & Klamroth, K. (2007) · Mathematical Methods of Operations Research · doi:10.1007/s00186-007-0161-1 · Cited by 690
Designing structured tight frames via an alternating projection method
Tropp, J. A., Dhillon, I. S., Heath, R. W., & Strohmer, T. (2005) · IEEE Transactions on Information Theory · doi:10.1109/tit.2004.839492 · Cited by 494
A Gradient Algorithm Locally Equivalent to the Em Algorithm
Lange, K. (1995) · Journal of the Royal Statistical Society Series B: Statistical Methodology · doi:10.1111/j.2517-6161.1995.tb02037.x · Cited by 376
Trace Ratio vs. Ratio Trace for Dimensionality Reduction
Wang, H., Yan, S., Xu, D., Tang, X., & Huang, T. (2007) · 2007 IEEE Conference on Computer Vision and Pattern Recognition · doi:10.1109/cvpr.2007.382983 · Cited by 349
Portfolio optimization with linear and fixed transaction costs
Lobo, M. S., Fazel, M., & Boyd, S. (2007) · Annals of Operations Research · doi:10.1007/s10479-006-0145-1 · Cited by 350
Metadata
- Authors
- Meyer, R. R.
- Affiliations
- University of Wisconsin–Madison (US)
- Corresponding author
- Meyer, R.R.
- ORCID
- Meyer, R.R.
- Venue
- Journal of Computer and System Sciences
- Publisher
- Elsevier BV
- Published
- 1976-02
- Volume
- 12
- Issue
- 1
- Pages
- 108-121
- ISSN
- 0022-0000 (ISSN-L)
- OpenAlex
- W2043230024
- Cited by
- 113
- References
- 5
- Citations by year
- 2026: 1 · 2025: 1 · 2024: 3 · 2023: 3 · 2022: 4 · 2021: 2 · 2020: 4 · 2019: 2 · 2018: 7 · 2017: 9 · 2016: 9 · 2015: 7 · 2014: 2 · 2013: 6 · 2012: 5
- FWCI
- 3.35
- Type
- journal article
- Language
- en
- Open access
- bronze
- doi.org
- Licence
- www.elsevier.com/tdm/userlicense/1.0/ (tdm)
- www.elsevier.com/open-access/userlicense/1.0/ (vor, 13681 d)
- Locations
- Journal of Computer and System Sciences (publishedVersion)
- Minds at UW (University of Wisconsin) (submittedVersion)
- Topics
- Physical Sciences › Mathematics › Numerical Analysis › Advanced Optimization Algorithms Research
- Physical Sciences › Computer Science › Computational Theory and Mathematics › Optimization and Variational Analysis
- Physical Sciences › Computer Science › Computational Theory and Mathematics › Complexity and Algorithms in Graphs
- Keywords
- global convergence, nonlinear programming, fixed points, point-to-set mappings, sufficient conditions
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: Sufficient conditions for the convergence of monotonic mathematicalprogramming algorithms. https://app.cochat.ai/papers/10.1016/s0022-0000(76)80021-9
- The paper
- Meyer, R. R. (1976). Sufficient conditions for the convergence of monotonic mathematicalprogramming algorithms. Journal of Computer and System Sciences. https://doi.org/10.1016/s0022-0000(76)80021-9
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.
