Abstract
Letf(x,y) be a function of the vector variablesx ∈R n andy ∈R m. The grouped (variable) coordinate minimization (GCM) method for minimizingf consists of alternating exact minimizations in either of the two vector variables, while holding the other fixed at the most recent value. This scheme is known to be locally,q-linearly convergent, and is most useful in certain types of statistical and pattern recognition problems where the necessary coordinate minimizers are available explicitly. In some important cases, the exact minimizer in one of the vector variables is not explicitly available, so that an iterative technique such as Newton's method must be employed. The main result proved here shows that a single iteration of Newton's method solves the coordinate minimization problem sufficiently well to preserve the overall rate of convergence of the GCM sequence.
Similar content being viewed by others
References
Bezdek, J. C., Hathaway, R. J., Howard, R. E., Wilson, C. A., andWindham, M. P.,Local Convergence Analysis of a Grouped Variable Version of Coordinate Descent, Journal of Optimization Theory and Applications, Vol. 54, pp. 471–477, 1987.
Stewart, G. W.,Introduction to Matrix Computations, Academic Press, Orlando, Florida, 1973.
Dennis, J. E., Jr., andSchnabel, R. B.,Numerical Methods for Unconstrained Optimization and Nonlinear Equations, Prentice-Hall, Englewood Cliffs, New Jersey, 1983.
Bezdek, J. C.,Pattern Recognition with Fuzzy Objective Function Algorithms, Plenum Press, New York, New York, 1981.
Dave, R.,Fuzzy Shell Clustering and Applications to Circle Detection in Digital Images, International Journal of General Systems, Vol. 16, pp. 343–355, 1990.
Author information
Authors and Affiliations
Additional information
Communicated by R. A. Tapia
The authors are indebted to Professor R. A. Tapia for his help in improving this paper.
Rights and permissions
About this article
Cite this article
Hathaway, R.J., Bezdek, J.C. Grouped coordinate minimization using Newton's method for inexact minimization in one vector coordinate. J Optim Theory Appl 71, 503–516 (1991). https://doi.org/10.1007/BF00941400
Issue Date:
DOI: https://doi.org/10.1007/BF00941400