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
Finding the nearest point in A polytope
Wolfe, P. (1976) · Mathematical Programming · doi:10.1007/bf01580381 · Cited by 321
On the Mathematical Foundations of Nondifferentiable Optimization in Engineering Design
Polak, E. (1987) · SIAM Review · doi:10.1137/1029002 · Cited by 289
The Relaxed Online Maximum Margin Algorithm
Li, Y., & Long, P. M. (2002) · Machine Learning · doi:10.1023/a:1012435301888 · Cited by 225
Computing the distance between general convex objects in three-dimensional space
Gilbert, E. G., & Foo, C.-P. (1990) · IEEE Transactions on Robotics and Automation · doi:10.1109/70.88117 · Cited by 201
Self-citationBiaffine matrix inequality properties and computational methods
Goh, K. C., Turan, L., Safonov, M. G., Papavassilopoulos, G. P., & Ly, J. H. (2005) · Proceedings of the ... American Control Conference/Proceedings of the American Control Conference · doi:10.1109/acc.1994.751863 · Cited by 163
A ν-twin support vector machine (ν-TSVM) classifier and its geometric algorithms
Peng, X. (2010) · Information Sciences · doi:10.1016/j.ins.2010.06.039 · Cited by 139
Conditional gradient algorithms with open loop step size rules
Dunn, J. C., & Harshbarger, S. D. (1978) · Journal of Mathematical Analysis and Applications · doi:10.1016/0022-247x(78)90137-3 · Cited by 122
The minimization of certain nondifferentiable sums of eigenvalues of symmetric matrices
Cullum, J. K., Donath, W. E., & Wolfe, P. (1975) · Mathematical programming studies · doi:10.1007/bfb0120698 · Cited by 122
A geometric approach to support vector regression
Bi, J., & Bennett, K. P. (2003) · Neurocomputing · doi:10.1016/s0925-2312(03)00380-1 · Cited by 107
Semidefinite programming relaxations for quantum correlations
Tavakoli, A., Pozas-Kerstjens, A., Brown, P. J., & Araújo, M. (2024) · Reviews of Modern Physics · doi:10.1103/revmodphys.96.045006 · Cited by 106
Embedded Intelligence on FPGA: Survey, Applications and Challenges
Seng, K. P., Lee, P. J., & Ang, L. M. (2021) · Electronics · doi:10.3390/electronics10080895 · Cited by 105
“The Gilbert algorithm is used to solve the nearest point problem where all the computations are computed under the processing element (PE) [11].”
MethodRates of Convergence for Conditional Gradient Algorithms Near Singular and Nonsingular Extremals
Dunn, J. C. (1979) · SIAM Journal on Control and Optimization · doi:10.1137/0317015 · Cited by 94
The status of optimal control theory and applications for deterministic systems
Athans, M. (1966) · IEEE Transactions on Automatic Control · doi:10.1109/tac.1966.1098353 · Cited by 94
Hirsch, F., Quintino, M. T., Vértesi, T., Navascués, M., & Brunner, N. (2017) · Quantum · doi:10.22331/q-2017-04-25-3 · Cited by 94
An iterative algorithm learning the maximal margin classifier
Franc, V., & Hlaváč, V. (2003) · Pattern Recognition · doi:10.1016/s0031-3203(03)00060-8 · Cited by 93
Novel Cascade FPGA Accelerator for Support Vector Machines Classification
Papadonikolakis, M., & Bouganis, C.-S. (2012) · IEEE Transactions on Neural Networks and Learning Systems · doi:10.1109/tnnls.2012.2196446 · Cited by 90
A twin-hypersphere support vector machine classifier and the fast learning algorithm
Peng, X., & Xu, D. (2012) · Information Sciences · doi:10.1016/j.ins.2012.09.009 · Cited by 85
Real/Complex Km-Synthesis without Curve Fitting
Safonov, M. G., & Chiang, R. Y. (1993) · Control and dynamic systems · doi:10.1016/b978-0-12-012756-6.50013-x · Cited by 81
The Huller: A Simple and Efficient Online SVM
Bordes, A., & Bottou, L. (2005) · Lecture notes in computer science · doi:10.1007/11564096_48 · Cited by 77
Smoothing algorithms for computing the projection onto a Minkowski sum of convex sets
Qin, X., & An, N. T. (2019) · Computational Optimization and Applications · doi:10.1007/s10589-019-00124-7 · Cited by 76
A second-order bundle method to minimize the maximum eigenvalue function
Oustry, F. (2000) · Mathematical Programming · doi:10.1007/pl00011388 · Cited by 70
Sparse Convex Optimization Methods for Machine Learning
Jaggi, M. (2011) · Infoscience (Ecole Polytechnique Fédérale de Lausanne) · doi:10.3929/ethz-a-007050453 · Cited by 70
Weighted Minimum Trace Factor Analysis
Shapiro, A. (1982) · Psychometrika · doi:10.1007/bf02294158 · Cited by 59
A Distributed Support Vector Machine Learning Over Wireless Sensor Networks
Kim, W., Stanković, M. S., Johansson, K. H., & Kim, H. J. (2015) · IEEE Transactions on Cybernetics · doi:10.1109/tcyb.2014.2377123 · Cited by 59
Coresets for polytope distance
Gärtner, B., & Jaggi, M. (2009) · Annual Symposium on Computational Geometry (SoCG) · doi:10.1145/1542362.1542370 · Cited by 55
A Geometric Nearest Point Algorithm for the Efficient Solution of the SVM Classification Task
Mavroforakis, M., Sdralis, M., & Theodoridis, S. (2007) · IEEE Transactions on Neural Networks · doi:10.1109/tnn.2007.900237 · Cited by 53
One-class classification based on the convex hull for bearing fault detection
Zeng, M., Yang, Y., Luo, S., & Cheng, J. (2016) · Mechanical Systems and Signal Processing · doi:10.1016/j.ymssp.2016.04.001 · Cited by 53
A fast procedure for computing the distance between complex objects in three space
Gilbert, É., Johnson, D., & Keerthi, S. (2005) · Proceedings - IEEE International Conference on Robotics and Automation/Proceedings · doi:10.1109/robot.1987.1087825 · Cited by 53
A Survey on Training Algorithms for Support Vector Machine Classifiers
Wang, G. (2008) · Networked Computing and Advanced Information Management · doi:10.1109/ncm.2008.103 · Cited by 47
A subgradient algorithm for certain minimax and minisum problems
Chatelon, J., Hearn, D. W., & Lowe, T. J. (1978) · Mathematical Programming · doi:10.1007/bf01609012 · Cited by 46
L 1 -norm loss based twin support vector machine for data recognition
Peng, X., Xu, D., Kong, L., & Chen, D. (2016) · Information Sciences · doi:10.1016/j.ins.2016.01.023 · Cited by 43
Performance comparison of GPU and FPGA architectures for the SVM training problem
Papadonikolakis, M., Bouganis, C.-S., & Constantinides, G. A. (2009) · International Conference on Field-Programmable Technology (FPT) · doi:10.1109/fpt.2009.5377653 · Cited by 43
Iterative construction of fixed points for multivalued operators of the monotone type
Dunn, J. C. (1978) · Journal of Functional Analysis · doi:10.1016/0022-1236(78)90018-6 · Cited by 41
GJK++: Leveraging Acceleration Methods for Faster Collision Detection
Montaut, L., Lidec, Q. L., Petrík, V., Šivic, J., & Carpentier, J. (2024) · IEEE Transactions on Robotics · doi:10.1109/tro.2024.3386370 · Cited by 40
Convex Optimization over Classes of Multiparticle Entanglement
Shang, J., & Gühne, O. (2018) · Physical Review Letters · doi:10.1103/physrevlett.120.050506 · Cited by 40
A scalable FPGA architecture for non-linear SVM training
Papadonikolakis, M., & Bouganis, C.-S. (2008) · International Conference on Field-Programmable Technology (FPT) · doi:10.1109/fpt.2008.4762412 · Cited by 40
Steepest Descent with Relaxed Controls
Warga, J. (1977) · SIAM Journal on Control and Optimization · doi:10.1137/0315043 · Cited by 40
Convex separation from convex optimization for large-scale problemsPreprint
BRIERLEY, S. D., Navascués, M., & Vértesi, T. (2016) · arXiv (Cornell University) · doi:10.48550/arxiv.1609.05011 · Cited by 40
Reachable sets for linear dynamical systems
Pecsvaradi, T., & Narendra, K. S. (1971) · Information and Control · doi:10.1016/s0019-9958(71)90173-2 · Cited by 38
An Efficient Computational Procedure for a Generalized Quadratic Programming Problem
Barr, R. O. (1969) · SIAM Journal on Control · doi:10.1137/0307030 · Cited by 38
Convex and concave hulls for classification with support vector machine
López‐Chau, A., Li, X., & Yu, W. (2013) · Neurocomputing · doi:10.1016/j.neucom.2013.05.040 · Cited by 37
Convex Optimization without Projection StepsPreprint
Jaggi, M. (2011) · arXiv (Cornell University) · doi:10.48550/arxiv.1108.1170 · Cited by 37
Simple Proof of Convergence of the SMO Algorithm for Different SVM Variants
Lopez, J., & Dorronsoro, J. R. (2012) · IEEE Transactions on Neural Networks and Learning Systems · doi:10.1109/tnnls.2012.2195198 · Cited by 36
A novel Frank–Wolfe algorithm. Analysis and applications to large-scale SVM training
Ñanculef, R., Frandi, E., Sartori, C., & Allende, H. (2014) · Information Sciences · doi:10.1016/j.ins.2014.03.059 · Cited by 36
Kowalewski, A. (1988) · International Journal of Control · doi:10.1080/00207178808906327 · Cited by 35
Improved local models and new Bell inequalities via Frank-Wolfe algorithms
Designolle, S., Iommazzo, G., Besançon, M., Knebel, S., Gelß, P., & Pokutta, S. (2023) · Physical Review Research · doi:10.1103/physrevresearch.5.043059 · Cited by 33
Theodoridis, S., & Koutroumbas, K. (2009) · Elsevier eBooks · doi:10.1016/b978-1-59749-272-0.50005-0 · Cited by 33
A general soft method for learning SVM classifiers with -norm penalty
Tao, Q., Wu, G., & Wang, J. (2007) · Pattern Recognition · doi:10.1016/j.patcog.2007.08.004 · Cited by 33
Qutrit witness from the Grothendieck constant of order four
Diviánszky, P., Bene, E., & Vértesi, T. (2017) · Physical Review A · doi:10.1103/physreva.96.012113 · Cited by 32
Collision Detection Accelerated: An Optimization Perspective
Montaut, L., Lidec, Q. L., Petr�k, V., Šivic, J., & Carpentier, J. (2022) · Robotics: Science and Systems · doi:10.15607/rss.2022.xviii.039 · Cited by 31
Reduced Convex Hulls: A Geometric Approach to Support Vector Machines [Lecture Notes]
Theodoridis, S., & Mavroforakis, M. (2007) · IEEE Signal Processing Magazine · doi:10.1109/msp.2007.361610 · Cited by 30
A characterization theorem and an algorithm for a convex hull problem
Kalantari, B. (2014) · Annals of Operations Research · doi:10.1007/s10479-014-1707-2 · Cited by 29
Hilbert-Schmidt distance and entanglement witnessing
Pandya, P., Sakarya, O., & Wieśniak, M. (2020) · Physical Review A · doi:10.1103/physreva.102.012409 · Cited by 29
Twin support vector hypersphere (TSVH) classifier for pattern recognition
Peng, X., & Xu, D. (2013) · Neural Computing and Applications · doi:10.1007/s00521-012-1306-6 · Cited by 29
A novel SVM Geometric Algorithm based on Reduced Convex Hulls
Mavroforakis, M., Sdralis, M., & Theodoridis, S. (2006) · Proceedings - International Conference on Pattern Recognition/Proceedings/International Conference on Pattern Recognition · doi:10.1109/icpr.2006.143 · Cited by 29
On the convexity of integrals of multivalued mappings: Applications in control theory
Veliov, V. M. (1987) · Journal of Optimization Theory and Applications · doi:10.1007/bf00940201 · Cited by 28
Approximating parameterized convex optimization problems
Giesen, J., Jaggi, M., & Laue, S. (2012) · ACM Transactions on Algorithms · doi:10.1145/2390176.2390186 · Cited by 28
Accelerated Frank–Wolfe Algorithms
Meyer, G. G. L. (1974) · SIAM Journal on Control · doi:10.1137/0312050 · Cited by 28
A Multiplier Method for Computing Real Multivariable Stability Margin
Safanov, M. G., & Lee, P. H. (1993) · IFAC Proceedings Volumes · doi:10.1016/s1474-6670(17)48895-1 · Cited by 28
The Frank-Wolfe Algorithm: A Short Introduction
Pokutta, S. (2023) · Jahresbericht der Deutschen Mathematiker-Vereinigung · doi:10.1365/s13291-023-00275-x · Cited by 27
Clipping algorithms for solving the nearest point problem over reduced convex hulls
López, J., Barbero, Á., & Dorronsoro, J. R. (2010) · Pattern Recognition · doi:10.1016/j.patcog.2010.08.030 · Cited by 27
On the Equivalence of the SMO and MDM Algorithms for SVM Training
López, J., Barbero, Á., & Dorronsoro, J. R. (2008) · Lecture notes in computer science · doi:10.1007/978-3-540-87479-9_37 · Cited by 27
Song, X., Wang, H., & Wang, L. (2014) · International Conference on Information Technology: New Generations · doi:10.1109/itng.2014.45 · Cited by 26
A generalized S–K algorithm for learning ν-SVM classifiers
Tao, Q., Wu, G., & Wang, J. (2004) · Pattern Recognition Letters · doi:10.1016/j.patrec.2004.03.011 · Cited by 25
Some efficient algorithms for a class of abstract optimization problems arising in optimal control
Barr, R. O., & Gilbert, E. (1969) · IEEE Transactions on Automatic Control · doi:10.1109/tac.1969.1099299 · Cited by 25
Self-citationPolak, E. (1989) · Springer eBooks · doi:10.1007/978-1-4757-6019-4_20 · Cited by 24
Minimizing pseudoconvex functions on convex compact sets
Higgins, J. E., & Polak, E. (1990) · Journal of Optimization Theory and Applications · doi:10.1007/bf00941156 · Cited by 22
Numerical Experience with Parallel Algorithms for Solving the BMI Problem
Liu, S.-M., & Papavassilopoulos, G. P. (1996) · IFAC Proceedings Volumes · doi:10.1016/s1474-6670(17)57935-5 · Cited by 22
Wishart and random density matrices: Analytical results for the mean-square Hilbert-Schmidt distance
Kumar, S. (2020) · Physical Review A · doi:10.1103/physreva.102.012405 · Cited by 21
Distance between Bound Entangled States from Unextendible Product Bases and Separable States
Wieśniak, M., Pandya, P., Sakarya, O., & Woloncewicz, B. (2020) · Quantum Reports · doi:10.3390/quantum2010004 · Cited by 21
A new penalty function algorithm for convex quadratic programming
Ben‐Daya, M., & Al-Sultan, K. S. (1997) · European Journal of Operational Research · doi:10.1016/s0377-2217(96)00138-5 · Cited by 21
Anagnost, J. J., Desoer, C., & Minnichelli, R. J. (1989) · Springer eBooks · doi:10.1007/978-1-4615-9552-6_7 · Cited by 21
FPGA based nonlinear Support Vector Machine training using an ensemble learning
Rabieah, M. B., & Bouganis, C.-S. (2015) · International Conference on Field Programmable Logic and Applications (FPL) · doi:10.1109/fpl.2015.7293972 · Cited by 19
Variational approach to the quantum separability problem
Consiglio, M., Apollaro, T. J. G., & Wieśniak, M. (2022) · Physical Review A · doi:10.1103/physreva.106.062413 · Cited by 19
On Maximizing the Minimum Eigenvalue of a Linear Combination of Symmetric Matrices
Allwright, J. C. (1989) · SIAM Journal on Matrix Analysis and Applications · doi:10.1137/0610026 · Cited by 19
A Subgradient Algorithm for Certain Minimax and Minisum Problems—The Constrained Case
Chatelon, J., Hearn, D. W., & Lowe, T. J. (1982) · SIAM Journal on Control and Optimization · doi:10.1137/0320034 · Cited by 19
Anagnost, J. J., Desoer, C., & Minnichelli, R. J. (2003) · IEEE Conference on Decision and Control (CDC) · doi:10.1109/cdc.1988.194364 · Cited by 19
Training Support Vector Machines Using Gilbert’s Algorithm
Martin, S. (2006) · Proceedings · doi:10.1109/icdm.2005.145 · Cited by 18
A Deterministic Nonsmooth Frank Wolfe Algorithm with Coreset Guarantees
Ravi, S. N., Collins, M. D., & Singh, V. (2019) · INFORMS Journal on Optimization · doi:10.1287/ijoo.2019.0014 · Cited by 18
On the von Neumann and Frank--Wolfe Algorithms with Away Steps
Peña, J., Rodríguez, D., & Soheili, N. (2016) · SIAM Journal on Optimization · doi:10.1137/15m1009937 · Cited by 18
Iterative Procedures for Constrained and Unilateral Optimization Problems
Warga, J. (1982) · SIAM Journal on Control and Optimization · doi:10.1137/0320028 · Cited by 18
On the Approximation of Integrals of Multivalued Functions
Jacobs, M. Q. (1969) · SIAM Journal on Control · doi:10.1137/0307012 · Cited by 17
Robust vertex enumeration for convex hulls in high dimensions
Awasthi, P., Kalantari, B., & Zhang, Y. (2020) · Annals of Operations Research · doi:10.1007/s10479-020-03557-0 · Cited by 17
Towards a deeper geometric, analytic and algorithmic understanding of margins
Ramdas, A., & Peña, J. (2015) · Optimization methods & software · doi:10.1080/10556788.2015.1099652 · Cited by 17
Geometric Algorithms to Large Margin Classifier Based on Affine Hulls
Peng, X., & Wang, Y. (2011) · IEEE Transactions on Neural Networks and Learning Systems · doi:10.1109/tnnls.2011.2179120 · Cited by 16
An algorithmic separating hyperplane theorem and its applications
Kalantari, B. (2018) · Discrete Applied Mathematics · doi:10.1016/j.dam.2018.05.009 · Cited by 15
Large data sets classification using convex–concave hull and support vector machine
López‐Chau, A., Li, X., & Yu, W. (2012) · Soft Computing · doi:10.1007/s00500-012-0954-x · Cited by 15
Kumar, P., & Yıldırım, E. A. (2010) · INFORMS journal on computing · doi:10.1287/ijoc.1100.0412 · Cited by 15
A DUAL ALGORITHM FOR FINDING THE MINIMUM-NORM POINT IN A POLYTOPE
Fujishige, S., & Zhan, P. (1990) · Journal of the Operations Research Society of Japan · doi:10.15807/jorsj.33.188 · Cited by 15
An Introduction to Optimization: Foundations and Fundamental Algorithms
Evgrafov, A., & Patriksson, M. (2005) · Cited by 14
A decomposition algorithm for solving a class of optimal control problems
Meyer, G. F., & Polak, E. (1970) · Journal of Mathematical Analysis and Applications · doi:10.1016/0022-247x(70)90321-5 · Cited by 14
An Iterative Procedure for Solving the Time-Optimal Regulator Problem
Fujisawa, T., & Yasuda, Y. (1967) · SIAM Journal on Control · doi:10.1137/0305029 · Cited by 14
An extension of Gilbert's algorithm for computing optimal controls
Barnes, E. R. (1971) · Journal of Optimization Theory and Applications · doi:10.1007/bf00931979 · Cited by 13
Graph-theoretic approach to Bell experiments with low detection efficiency
Xu, Z., Steinberg, J., Singh, J., López-Tarrida, A. J., Portillo, J. R., & Cabello, A. (2023) · Quantum · doi:10.22331/q-2023-02-16-922 · Cited by 12
Symmetric multipartite Bell inequalities via Frank-Wolfe algorithms
Designolle, S., Vértesi, T., & Pokutta, S. (2024) · Physical Review A · doi:10.1103/physreva.109.022205 · Cited by 12
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.
