Abstract
This paper proposes several globally convergent geometric optimization algorithms on Riemannian manifolds, which extend some existing geometric optimization techniques. Since any set of smooth constraints in the Euclidean space R n (corresponding to constrained optimization) and the R n space itself (corresponding to unconstrained optimization) are both special Riemannian manifolds, and since these algorithms are developed on general Riemannian manifolds, the techniques discussed in this paper provide a uniform framework for constrained and unconstrained optimization problems. Unlike some earlier works, the new algorithms have less restrictions in both convergence results and in practice. For example, global minimization in the one-dimensional search is not required. All the algorithms addressed in this paper are globally convergent. For some special Riemannian manifold other than R n, the new algorithms are very efficient. Convergence rates are obtained. Applications are discussed.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Fletcher, R., Practical Methods of Optimization, John Wiley and Sones, New York, NY, 1987.
Nocedal, I., and Wright, S. J., Numerical Optimization, Springer Series in Operations Research, Springer, New York, NY, 1999.
Luenberger, D. G., The Gradient-Projection Methods along Geodesics, Management Science, Vol. 18, pp. 620–631, 1972.
Luenberger, D. G., Linear and Nonlinear Programming, Addison-Wesley, Reading, Massachusetts, 1984.
Notsaris, C. A., Constrained Optimization along Geodesics, Journal of Mathematical Analysis and Applications, Vol. 79, pp. 295–306, 1981.
Gabay, D., Minimizing a Differentiable Function over a Differentiable Manifold, Journal of Optimization Theory and Applications, Vol. 37, pp. 117–219,1982.
Rapcsak, T., and Thang, T. T., On Coordinate Representations of Smooth Optimization Problems, Journal of Optimization Theory and Applications, Vol. 86, pp. 459–489, 1995.
Rapcsak, T., Variable-Metric Methods along Geodesics, New Trends in Mathematical Programming, Edited by F. Giannessi, S. Komlosi, and T. Rapcsak, Kluwer Academic Publishers, Dordrecht, Holland, pp. 257–275, 1998.
Rapcsak, T., and Thang, T. T., A Class of Polynomial Variable-Metric Algorithms for Linear Optimization, Mathematical Programming Vol. 74, pp. 319–331, 1996.
Rapcsak, T., Smooth Nonlinear Optimization in bbRn, Kluwer Academic Publishers, Dordrecht, Holland, 1997.
Udriste, C., Convex Functions and Optimization Methods on Riemannian Manifolds, Kluwer Academic Publishers, Dordrecht, Holland, 1994.
Brockett, R. W., Differential Geometry and the Design of Gradient Algorithms, Proceedings of the Symposia in Pure Mathematics, Edited by R. Green and S. T. Yau, Providence, Rhode Island, Vol. 54, pp. 69–92, 1993.
Chu, M. T., Curves on Sn-1 that Lead to Eigenvalues or Their Means of Matrix, SIAM Journal on Algebra and Discrete Mathematics, Vol. 7, pp. 425–432, 1986.
Smith, S. T., Geometric Optimization Methods for Adaptive Filtering, PhD Thesis, Harvard University, Cambridge, Massachusetts, 1993.
Smith, S. T., Optimization Techniques on Riemannian Manifolds, Fields Institute Communications, Vol. 3, pp. 113–135, 1994.
Yang, Y., Robust System Design: Pole Assignment Approach, PhD Thesis, University of Maryland, College Park, Maryland, 1996.
Yang, Y., Sahinci, E., and Mahmood, W., A New Algorithm on PMD Pulse-Width Compression, OPTIK: International Journal of Light and Electron Optics, Vol. 114, pp. 365–369, 2003.
Hansen, P., Jaumard, B., and Lu, S., Global Optimization of Univariate Lipschitz Functions, I: Survey and Properties, Mathematical Programming, Vol. 55, pp. 251–271, 1992.
Hansen, P., Jaumard, B., and Lu, S., Global Optimization of Univariate Lipschitz Function, II: New Algorithms and Computational Comparison, Mathematical Programming, Vol. 55, pp. 273–292, 1992.
O'Neill, B., Semi-Riemannian Geometry with Applications to Relativity, Academic Press, New York, NY, 1983.
Helgason, S., Differential Geometry, Lie Groups, and Symmetric Spaces, Academic Press, New York, NY, 1978.
Boothby, W.M., An Introduction to Differentiable Manifold and Riemannian Geometry, Academic Press, Orlando, Florida, 1986.
Polak, E., Computational Methods in Optimization, Academic Press, New York, NY, 1971.
Helmke, U., and Moore, J. M., Optimization and Dynamical Systems, Springer Verlag, New York, NY, 1971.
Ratcliffe, J.G., Foundations of Hyperbolic Manifolds, Springer Verlag, London, United Kingdom, 1994.
Rao, C. R., and Mitra, S. K., Generalized Inverse of Matrices and Their Applications, John Wiley, New York, NY 1971.
Moore, B.D., Convergence of an Algorithm for the Riemannian SVD, Open Problems in Mathematical Systems Theory (Communications and Control Engineering), Edited by V. Blondel, E. D. Sontag, J. Willems, and M. Vadyasgar, Springer Verlag, Berlin, Germany, pp. 95–98, 1999.
Author information
Authors and Affiliations
Additional information
Communicated by T. Rapcsak
This paper is based on part of the Ph.D Thesis of the author under the supervision of Professor Tits, University of Maryland, College Park, Maryland. The author is in debt to him for invaluable suggestions on earlier versions of this paper. The author is grateful to the Associate Editor and anonymous reviewers, who pointed out a number of papers that have been included in the references; they made also detailed suggestions that lead to significant improvements of the paper. Finally, the author thanks Dr. S.T. Smith for making available his Ph.D Thesis.
Rights and permissions
About this article
Cite this article
Yang, Y. Globally Convergent Optimization Algorithms on Riemannian Manifolds: Uniform Framework for Unconstrained and Constrained Optimization. J Optim Theory Appl 132, 245–265 (2007). https://doi.org/10.1007/s10957-006-9081-0
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10957-006-9081-0