The DOI matches its Crossref record; 26 of the 26 references it cites were found in a registry or an index.
Biconvex sets and optimization with biconvex functions: a survey and extensions
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
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
A method for registration of 3-D shapes
Besl, P. J., & McKay, N. D. (1992) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/34.121791 · Cited by 18,103
Image registration methods: a survey
Zitová, B., & Flusser, J. (2003) · Image and Vision Computing · doi:10.1016/s0262-8856(03)00137-9 · Cited by 6,423 · cited 2×
“For further details we refer to Zitová and Flusser (2003) where a survey on image registration can be found, and to Besl and McKay (1992) for information on the ICP algorithm.”
MethodNonlinear programming: theory and algorithms
(1993) · Computers & Operations Research · doi:10.1016/0305-0548(93)90042-h · Cited by 5,779
Linear and nonlinear programming.
(1986) · Mathematics and Computers in Simulation · doi:10.1016/0378-4754(86)90092-3 · Cited by 4,805
Partitioning procedures for solving mixed-variables programming problems
Benders, J. F. (1962) · Numerische Mathematik · doi:10.1007/bf01386316 · Cited by 3,855
Generalized Benders decomposition
Geoffrion, A. M. (1972) · Journal of Optimization Theory and Applications · doi:10.1007/bf00934810 · Cited by 2,478
Global Optimization: Deterministic Approaches
Horst, R., & Hoang, T. (1992) · Cited by 1,635
Nonlinear Programming — Theory and Algorithms
Ovuworie, G. C. (1979) · Journal of the Operational Research Society · doi:10.1057/jors.1979.231 · Cited by 1,182
Nonlinear and Mixed-Integer Optimization: Fundamentals and Applications
Floudas, C. A. (1995) · Oxford University Press eBooks · doi:10.1093/oso/9780195100563.001.0001 · Cited by 975
Nonlinear and Mixed-Integer Optimization: Fundamentals and Applications
Floudas, C. A. (1995) · Cited by 957
Solution of Equations and Systems of Equations
I., E., & Ostrowski, A. M. (1967) · Mathematics of Computation · doi:10.2307/2005025 · Cited by 937
Partitioning procedures for solving mixed-variables programming problems
Benders, J. F. (2005) · Computational Management Science · doi:10.1007/s10287-004-0020-y · Cited by 837
Linear and Nonlinear Programming
Luenberger, D. G., & Ye, Y. (2015) · International series in management science/operations research/International series in operations research & management science · doi:10.1007/978-3-319-18842-3 · Cited by 704
Jointly Constrained Biconvex Programming
Al-Khayyal, F. A., & Falk, J. E. (1983) · Mathematics of Operations Research · doi:10.1287/moor.8.2.273 · Cited by 553
Deterministic Global Optimization
Floudas, C. A. (2000) · Nonconvex Optimization and Its Applications · doi:10.1007/978-1-4757-4949-6 · Cited by 493
An Algorithm for Separable Nonconvex Programming Problems
Falk, J. E., & Soland, R. M. (1969) · Management Science · doi:10.1287/mnsc.15.9.550 · Cited by 409
Horst, R., & Tuy, H. (1990) · Springer eBooks · doi:10.1007/978-3-662-02598-7 · Cited by 390
A global optimization algorithm (GOP) for certain classes of nonconvex NLPs—I. Theory
Floudas, C. A., & Visweswaran, V. (1990) · Computers & Chemical Engineering · doi:10.1016/0098-1354(90)80020-c · Cited by 286
Block-relaxation Algorithms in Statistics
de Leeuw, J. (1994) · Studies in Classification, Data Analysis, and Knowledge Organization · doi:10.1007/978-3-642-46808-7_28 · Cited by 216
Linear and Nonlinear Programming: Second Edition
Luenberger, D. G. (2003) · Cited by 178
Biaffine 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
Sufficient conditions for the convergence of monotonic mathematicalprogramming algorithms
Meyer, R. R. (1976) · Journal of Computer and System Sciences · doi:10.1016/s0022-0000(76)80021-9 · Cited by 113 · cited 2×
“The following convergence properties of ACS are motivated by the results of Zangwill (1969), Meyer (1976) and de Leeuw (1994).”
ResultGlobal optimization for the Biaffine Matrix Inequality problem
Goh, K.-C., Safonov, M. G., & Papavassilopoulos, G. P. (1995) · Journal of Global Optimization · doi:10.1007/bf01099648 · Cited by 111
Visweswaran, V., & Floudas, C. A. (1993) · Journal of Global Optimization · doi:10.1007/bf01096414 · Cited by 92
Information Systems and Data Analysis
Bock, H., Lenski, W., & Richter, M. M. (1994) · Studies in classification, data analysis, and knowledge organization · doi:10.1007/978-3-642-46808-7 · Cited by 91
Convergence Conditions for Nonlinear Programming Algorithms
Zangwill, W. I. (1969) · Management Science · doi:10.1287/mnsc.16.1.1 · Cited by 88
Cited by
MentorNet: Learning Data-Driven Curriculum for Very Deep Neural Networks on Corrupted Labels
Jiang, L., Zhou, Z., Leung, T., Li, L.-J., & Fei-Fei, L. (2017) · arXiv (Cornell University) · doi:10.48550/arxiv.1712.05055 · Cited by 503
Self-Paced Curriculum Learning
Jiang, L., Meng, D., Zhao, Q., Shan, S., & Hauptmann, A. (2015) · Proceedings of the AAAI Conference on Artificial Intelligence · doi:10.1609/aaai.v29i1.9608 · Cited by 480
Danelljan, M., Hager, G., Khan, F. S., & Felsberg, M. (2016) · 2016 IEEE Conference on Computer Vision and Pattern Recognition (CVPR) · doi:10.1109/cvpr.2016.159 · Cited by 430
Penalized Classification using Fisher’s Linear Discriminant
Witten, D. M., & Tibshirani, R. (2011) · Journal of the Royal Statistical Society Series B: Statistical Methodology · doi:10.1111/j.1467-9868.2011.00783.x · Cited by 384
Hypergraph Learning: Methods and Practices
Gao, Y., Zhang, Z., Lin, H., Zhao, X., Du, S., & Zou, C. (2021) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2020.3039374 · Cited by 356
Metadata
- Authors
- Gorski, J., Pfeuffer, F., & Klamroth, K.
- Venue
- Mathematical Methods of Operations Research
- Published
- 2007-06-22
- Volume
- 66
- Issue
- 3
- Pages
- 373-407
- ISSN
- 1432-2994 (ISSN-L)
- 1432-5217
- OpenAlex
- W1964590153
- Cited by
- 690
- References
- 26
- FWCI
- 5.00
- 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.