Iterative methods for computing generalized inverses related with optimization methods
Open Access
- 9 April 2005
- journal article
- research article
- Published by Cambridge University Press (CUP) in Journal of the Australian Mathematical Society
- Vol. 78 (2) , 257-272
Abstract
We develop several iterative methods for computing generalized inverses using both first and second order optimization methods in C*-algebras. Known steepest descent iterative methods are generalized in C*-algebras. We introduce second order methods based on the minimization of the norms ‖Ax − b‖2 and ‖x‖2 by means of the known second order unconstrained minimization methods. We give several examples which illustrate our theory.Keywords
This publication has 11 references indexed in Scilit:
- On the Generalized Drazin Inverse and Generalized ResolventCzechoslovak Mathematical Journal, 2001
- A generalized Drazin inverseGlasgow Mathematical Journal, 1996
- On generalized inverses in C*-algebrasStudia Mathematica, 1992
- A class of iterative methods of conjugate gradient typeNumerical Functional Analysis and Optimization, 1990
- Quasi-Newton Methods, Motivation and TheorySIAM Review, 1977
- A uniform approach to gradient methods for linear operator equationsJournal of Mathematical Analysis and Applications, 1975
- On the Convergence of the Conjugate Gradient Method for Singular Linear Operator EquationsSIAM Journal on Numerical Analysis, 1972
- Steepest Descent for Singular Linear Operator EquationsSIAM Journal on Numerical Analysis, 1970
- Two Algorithms Related to the Method of Steepest DescentSIAM Journal on Numerical Analysis, 1967
- On Iterative Computation of Generalized Inverses and Associated ProjectionsSIAM Journal on Numerical Analysis, 1966