The DOI matches its Crossref record; 10 of the 10 references it cites were found in a registry or an index.
An Iterative Procedure for Computing the Minimum of a Quadratic Form on a Convex Set
Overview
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
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?
In the citing paper
“Based on the evaluation, the cascade technique was able to outperform this while maintaining comparable accuracy.”
From Embedded Intelligence on FPGA: Survey, Applications and Challenges (2021) · cites this paper as [11]
Citations
Cites
An algorithm for quadratic programming
Frank, M., & Wolfe, P. (1956) · Naval Research Logistics Quarterly · doi:10.1002/nav.3800030109 · Cited by 3,030
Convex programming in Hilbert space
Goldstein, A. A. (1964) · Bulletin of the American Mathematical Society · doi:10.1090/s0002-9904-1964-11178-2 · Cited by 633
Eggleston, H. G. (1958) · Cambridge University Press eBooks · doi:10.1017/cbo9780511566172 · Cited by 431
The existence of optimal controls in the absence of convexity conditions
Neustadt, L. W. (1963) · Journal of Mathematical Analysis and Applications · doi:10.1016/0022-247x(63)90081-7 · Cited by 161
Synthesizing time optimal control systems
Neustadt, L. W. (1960) · Journal of Mathematical Analysis and Applications · doi:10.1016/0022-247x(60)90015-9 · Cited by 143
Minimum Effort Control Systems
Neustadt, L. W. (1962) · SIAM Journal on Control · doi:10.1137/0301002 · Cited by 78
An iterative solution to time-optimal control
Eaton, J. H. (1962) · Journal of Mathematical Analysis and Applications · doi:10.1016/s0022-247x(62)80015-8 · Cited by 74
A Successive Approximation Technique for Optimal Control Systems Subject to Input Saturation
Ho, Y. (1962) · Journal of Basic Engineering · doi:10.1115/1.3657263 · Cited by 35
Computational Aspects of the Time-Optimal Control Problem
Fadden, E. J., & Gilbert, E. G. (1964) · Elsevier eBooks · doi:10.1016/b978-1-4831-9812-5.50013-8 · Cited by 25
Self-citationIterative computation procedures for an optimum control problem
Fancher, P. S. (1965) · IEEE Transactions on Automatic Control · doi:10.1109/tac.1965.1098170 · Cited by 11
Research works printed but not linked: 2
- Barr Robert O., 1967, Automatic and remote control III (Proc. Third Congr. Internat. Federation Automat. Control (IFAC), London, 1966), Vol. 1, p. 47, Paper 24D, 9
- L. W. Neustadt, On synthesizing optimal controls, Proceedings of Second Congress of IFAC, Butterworth, London, 1964
Cited by
A fast procedure for computing the distance between complex objects in three-dimensional space
Gilbert, E. G., Johnson, D. W., & Keerthi, S. S. (1988) · IEEE Journal on Robotics and Automation · doi:10.1109/56.2083 · Cited by 1,513
Self-citationL-Shaped Linear Programs with Applications to Optimal Control and Stochastic Programming
Van Slyke, R. M., & Wets, R. (1969) · SIAM Journal on Applied Mathematics · doi:10.1137/0117061 · Cited by 1,281
Linear Matrix Inequalities In System And Control Theory
Yaz, E. E. (1998) · Proceedings of the IEEE · doi:10.1109/jproc.1998.735454 · Cited by 428
A fast iterative nearest point algorithm for support vector machine classifier design
Keerthi, S. S., Shevade, S. K., Bhattacharyya, C., & Murthy, K. R. K. (2000) · IEEE Transactions on Neural Networks · doi:10.1109/72.822516 · Cited by 383
Model validation: a connection between robust control and identification
Smith, R. S., & Doyle, J. C. (1992) · IEEE Transactions on Automatic Control · doi:10.1109/9.148346 · Cited by 356
Metadata
- Authors
- Gilbert, E. G.
- Corresponding author
- Gilbert, Elmer G.
- Venue
- SIAM Journal on Control
- Published
- 1966-02
- Volume
- 4
- Issue
- 1
- Pages
- 61-80
- ISSN
- 0036-1402 (ISSN-L)
- OpenAlex
- W2063958549
- Cited by
- 230
- References
- 10
- Citations by year
- 2026: 1 · 2025: 5 · 2024: 6 · 2023: 12 · 2022: 6 · 2021: 3 · 2020: 13 · 2019: 4 · 2018: 8 · 2017: 5 · 2016: 8 · 2015: 7 · 2014: 10 · 2013: 3 · 2012: 14
- FWCI
- 7.02
- Type
- journal article
- Language
- en
- Open access
- closed
- Locations
- SIAM Journal on Control (publishedVersion)
- Topics
- Physical Sciences › Mathematics › Numerical Analysis › Advanced Optimization Algorithms Research
- Physical Sciences › Engineering › Control and Systems Engineering › Advanced Control Systems Optimization
- Physical Sciences › Computer Science › Computational Theory and Mathematics › Matrix Theory and Algorithms
- Keywords
- quadratic forms, convex sets, minimization, iterative methods, convex optimization
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.
