Block-relaxation Algorithms in Statistics
Studies in classification, data analysis, and knowledge organizationPublished 1 January 1994
Jan de Leeuw
Citations211
SJR quartileQ4
SJR score0.13
SNIP0.15
Generate an AI Snapshot to get a quick, structured summary of this paper.
Study Snapshot
ObjectiveStudy objective
MethodsResearch methodology
PopulationPopulation studied
Sample sizeSample sizes
OutcomesStudy outcomes here
ResultsStudy results comes here
LimitationsResearch study limitations comes here
A concise AI-generated summary of the paper will appear here once you click Generate AI Snapshot.
TL;DR
This paper discusses a single class of algorithms, and it is shown how some well-known classes of statistical algorithms fit in this common class.
Abstract
Many algorithms in recent computational statistics are variations on a common theme. In this paper we discuss four such classes of algorithms. Or, more precisely, we discuss a single class of algorithms, and we show how some well-known classes of statistical algorithms fit in this common class.
Keywords
MathematicsEngineering
Journal of the Royal Statistical Society Series B (Statistical Methodology)Maximum Likelihood from Incomplete Data Via the <i>EM</i> Algorithm
49,657 Citations1977A. P. Dempster, N. M. Laird +1 more
Digital Access to Scholarship at Harvard (DASH) (Harvard University)Maximum Likelihood from Incomplete Data via the EM Algorithm
4,523 Citations1977Dempster, Arthur P., Laird, Nan M. +1 more
BiometrikaMaximum likelihood estimation via the ECM algorithm: A general framework
1,814 Citations1993Xiao‐Li Meng, Donald B. Rubin
Journal of the American Statistical AssociationEstimating Optimal Transformations for Multiple Regression and Correlation
1,586 Citations1985Leo Breiman, Jerome H. Friedman
Quasilinearization and nonlinear boundary-value problems
1,013 Citations1965Richard Bellman, Robert E. Kalaba
Journal of the Royal Statistical Society Series B (Statistical Methodology)Analysis of Factorial Experiments by Estimating Monotone Transformations of the Data
510 Citations1965Joseph B. Kruskal
Journal of the American Statistical AssociationEstimating Optimal Transformations for Multiple Regression and Correlation
450 Citations1985Leo Breiman, Jerome H. Friedman
eScholarship (California Digital Library)Applications of Convex Analysis to Multidimensional Scaling
328 Citations2000Jan de Leeuw
An algorithm for metric and nonmetric multidimensional scaling that is very similar to the C-matrix algorithm of Guttman is discussed, extended to cover general Minkovski metrics.
Mathematical ProgrammingOn search directions for minimization algorithms
319 Citations1973M. J. D. Powell
The relevance of differentiable functions of three variables, having the property that if they are treated by the minimization algorithm that searches along the coordinate directions in sequence, then the search path tends to a closed loop, is discussed.
EconometricaA General Procedure for Obtaining Maximum Likelihood Estimates in Generalized Regression Models
293 Citations1974Walter Oberhofer, Jan Kmenta
Journal of the American Statistical AssociationTools for Statistical Inference: Observed Data and Data Augmentation Methods.
182 Citations1992Shulamith T. Gross, Martin A. Tanner
Observed data techniques - normal approximation observed data techniques the EM algorithm data augmentation the Gibbs sampler.
SIAM Journal on Numerical AnalysisMonotone Iterations for Nonlinear Equations with Application to Gauss-Seidel Methods
132 Citations1967James M. Ortega, Werner C. Rheinboldt
Journal of Optimization Theory and ApplicationsLocal convergence analysis of a grouped variable version of coordinate descent
121 Citations1987James C. Bezdek, Richard J. Hathaway +3 more
Local convergence analysis is done for this vector (grouped variable) version of coordinate descent, and it is shown that such an approach is locally convergent to a minimizer and that the rate of convergence in each vector variable is linear.
The Annals of StatisticsOn the Rate of Convergence of the ECM Algorithm
117 Citations1994Xiao‐Li Meng
Journal of Computer and System SciencesSufficient conditions for the convergence of monotonic mathematicalprogramming algorithms
115 Citations1976R. R. Meyer
A global convergence theory for a broad class of ''monotonic'' nonlinear programming algorithms is given and actual convergence of the entire sequence of iterates and point-of-attraction theorems are established under weak hypotheses.
Transactions of the American Mathematical SocietyIteration methods for nonlinear problems
101 Citations1962Samuel Schechter
Evaluation PracticeNonlinear Multivariate Analysis
96 Citations1990Jan de Leeuw
Reports (1-4 double-spaced typewritten pages) should describe tools, products, and services found useful by practicing evaluators and include the context of use and sufficient information for interested readers to contact the user directly for more detailed information.
Management ScienceConvergence Conditions for Nonlinear Programming Algorithms
89 Citations1969Willard I. Zangwill
BiometricsEstimation of Missing Values for the Analysis of Incomplete Data
70 Citations1958G. N. Wilkinson
BiometrikaGlobally convergent algorithms for maximizing a likelihood function
44 Citations1991Søren Jensen, Søren Johansen +1 more
SIAM Journal on Numerical AnalysisRelaxation Methods for Convex Problems
41 Citations1968Samuel Schechter
eScholarship (California Digital Library)MULTIVARIATE ANALYSIS WITH OPTIMAL SCALING
36 Citations2000Jan de Leeuw
Numerische MathematikM�thodes num�riques pour la d�composition et la minimisation de fonctions non diff�rentiables
34 Citations1971A. Auslender
Revue française d informatique et de recherche opérationnelle Série rougeOn the convergence of optimization algorithms
31 Citations1969E. Polak
L’accès aux archives de la revue « Revue française d’informatique and de recherche opérationnelle, série rouge » implique l’ Accord avec les conditions générales d“utilisation”.
Journal of Optimization Theory and ApplicationsMinimization by coordinate descent
24 Citations1982Theagenis J. Abatzoglou, Brian O’Donnell
This work examines the minimization of anN-dimensional real-valued function using the coordinate descent method and obtains the rate of convergence by specializing the class of functions.
Mathematical programming studiesComposition and union of general algorithms of optimization
23 Citations1979Jean-Charles Fiorot, Pierre Huard
The study of the convergence of algorithms of optimization obtained by composition or union, taken in sense of the relaxation, is done and the obtainment of generalized fixed points in the framework of the composition or the union of algorithms obtained in a free steering way is studied.
Industrial and applied mathematicsNumerical Solution for Nonlinear Problems
16 Citations2022Mohsen Rabbani
Numerische MathematikA systematic approach to the synthesis of algorithms
10 Citations1975Gérard G. L. Meyer
This paper presents a theory which allows the systematic synthesis of a class of iterative algorithms by using a specially structured model called thep-algorithm and a set of transformations so that the new algorithm obtained by repeated application of these transformations still solves the problem.
Revue française d informatique et de recherche opérationnelleLes méthodes de «descente» dans la théorie de l'optimisation
7 Citations1968Jean Céa