No CrossRef data available.
Article contents
Solving rank one revised linear systems by the scaled ABS method
Published online by Cambridge University Press: 17 February 2009
Abstract
Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the 'Save PDF' action button.
In mathematical programming, an important tool is the use of active set strategies to update the current solution of a linear system after a rank one change in the constraint matrix. We show how to update the general solution of a linear system obtained by use of the scaled ABS method when the matrix coefficient is subjected to a rank one change.
Information
- Type
- Research Article
- Information
- Copyright
- Copyright © Australian Mathematical Society 2004
References
[1]Abaffy, J., Broyden, C. G. and Spedicato, E., “A class of direct methods for linear equations”, Numer. Math. 45 (1984) 361–376.CrossRefGoogle Scholar
[2]Abaffy, J. and Spedicato, E., ABS projection algorithms: mathematical techniques for linear and nonlinear equations (Ellis Harwood, Chichester, 1989).Google Scholar
[3]Amini, K. and Mahdavi-Amiri, N., “Solving rank one perturbed linear Diophantine systems by the ABS methods”, submitted.Google Scholar
[4]Bazaraa, M. S., Jarvis, J. and Sherali, H. D., Linear programming and network flows (John Wiley and Sons, New York, 1990).Google Scholar
[5]Fletcher, R., Practical methods of optimization (John Wiley and Sons, Chichester, 1991).Google Scholar
[6]Hestense, M. R. and Stiefel, E., “Methods of conjugate gradient for solving linear system”, J. Research Nat. Bur. Standards 49 (1952) 409–436.CrossRefGoogle Scholar
[7]Lanczos, C., “Solution of systems of linear equations by minimized iterations”, J. Research Nat. Bur. Standards 49 (1952) 33–53.CrossRefGoogle Scholar
[8]Spedicato, E., “Numerical methods for linear and nonlinear equations and nonlinear programming”, Report DMSIA 98/4, University of Bergamo.Google Scholar
You have
Access