Some Notes on Alternating Optimization
The DOI matches its Crossref record; 17 of the 17 references it cites were found in a registry or an index.
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
Genetic algorithms in search, optimization, and machine learning
(1989) · Choice Reviews Online · doi:10.5860/choice.27-0936 · Cited by 49,010
Goldberg, D. E., & Shakespeare, W. (2002) · Cited by 16,088
Least squares quantization in PCM
Lloyd, S. (1982) · IEEE Transactions on Information Theory · doi:10.1109/tit.1982.1056489 · Cited by 15,836
Numerical Methods for Unconstrained Optimization and Nonlinear Equations
Dennis, J. E., & Schnabel, R. B. (1996) · Society for Industrial and Applied Mathematics eBooks · doi:10.1137/1.9781611971200 · Cited by 7,615
Iterative Solution of Nonlinear Equations in Several Variables
Ortega, J. M., & Rheinboldt, W. C. (2000) · Society for Industrial and Applied Mathematics eBooks · doi:10.1137/1.9780898719468 · Cited by 6,860
Optimization by Vector Space Methods
(1970) · Students Quarterly Journal · doi:10.1049/sqj.1970.0088 · Cited by 6,004
Linear and nonlinear programming.
(1986) · Mathematics and Computers in Simulation · doi:10.1016/0378-4754(86)90092-3 · Cited by 4,805
Iterative Solution of Nonlinear Equations in Several Variables
I., E., Ortega, J. M., & Rheinboldt, W. C. (1971) · Mathematics of Computation · doi:10.2307/2004942 · Cited by 4,408
Linear and Nonlinear Programming
Luenberger, D. G., & Ye, Y. (2008) · International Series in Operations Research & Management Science · doi:10.1007/978-0-387-74503-9 · Cited by 2,804
A possibilistic approach to clustering
Krishnapuram, R., & Keller, J. M. (1993) · IEEE Transactions on Fuzzy Systems · doi:10.1109/91.227387 · Cited by 2,496
Gill, P. E., Murray, W., & Wright, M. H. (2019) · doi:10.1137/1.9781611975604 · Cited by 1,737 · cited 2×
“[13] itemize the following factors: number of variables, constraints on the variables, smoothness of the problem functions and their derivatives, highest level of derivatives that can be efficiently coded, sparseness of the Hessian and Jacobian matrices, number of general linear constraints compared to the number of v…”
BackgroundMethodNonlinear Programming: A Unified Approach.
Beale, E. M. L., & Zangwill, W. (1970) · Journal of the Royal Statistical Society. Series A (General) · doi:10.2307/2343701 · Cited by 1,057
Nonlinear Programming: A Unified Approach
Peterson, D. W., & Zangwill, W. I. (1972) · Econometrica · doi:10.2307/1909424 · Cited by 1,005
PATTERN CLUSTERING BY MULTIVARIATE MIXTURE ANALYSIS
Wolfe, J. H. (1970) · Multivariate Behavioral Research · doi:10.1207/s15327906mbr0503_6 · Cited by 609
Fuzzy c-means clustering of incomplete data
Hathaway, R. J., & Bezdek, J. C. (2001) · IEEE Transactions on Systems, Man and Cybernetics, Part B (Cybernetics) · doi:10.1109/3477.956035 · Cited by 490
Self-citationBezdek, J. C., Coray, C., Gunderson, R., & Watson, J. (1981) · SIAM Journal on Applied Mathematics · doi:10.1137/0140030 · Cited by 199
Self-citationLinear and Nonlinear Programming: Second Edition
Luenberger, D. G. (2003) · Cited by 178
Cited by
Channel Estimation for Extremely Large-Scale MIMO: Far-Field or Near-Field?
Cui, M., & Dai, L. (2022) · IEEE Transactions on Communications · doi:10.1109/tcomm.2022.3146400 · Cited by 871
Double Sparsity: Learning Sparse Dictionaries for Sparse Signal Approximation
Rubinstein, R., Zibulevsky, M., & Elad, M. (2010) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2009.2036477 · Cited by 616
Xia, T., Tao, D., Mei, T., & Zhang, Y. (2010) · IEEE Transactions on Systems, Man, and Cybernetics, Part B (Cybernetics) · doi:10.1109/tsmcb.2009.2039566 · Cited by 508
Convergence of alternating optimization
Bezdek, J. C., & Hathaway, R. J. (2003) · Neural, Parallel & Scientific Computations archive · doi:10.5555/964885.964886 · Cited by 389
Self-citationWang, X., Fei, Z., Zheng, Z., & Guo, J. (2021) · IEEE Transactions on Vehicular Technology · doi:10.1109/tvt.2021.3075497 · Cited by 267
Metadata
- Authors
- Bezdek, J. C., & Hathaway, R. J.
- Venue
- Lecture Notes in Computer Science
- Publisher
- Springer Berlin Heidelberg
- Published
- 2002
- Pages
- 288-300
- ISSN
- 0302-9743 (ISSN-L)
- OpenAlex
- W1528703258
- Cited by
- 355
- References
- 17
- FWCI
- 1.90
- Type
- conference paper
- 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.