Abstract
Techniques for estimating the condition number of a nonsingular matrix are developed. It is shown that Hager’s 1-norm condition number estimator is equivalent to the conditional gradient algorithm applied to the problem of maximizing the 1-norm of a matrix-vector product over the unit sphere in the 1-norm. By changing the constraint in this optimization problem from the unit sphere to the unit simplex, a new formulation is obtained which is the basis for both conditional gradient and projected gradient algorithms. In the test problems, the spectral projected gradient algorithm yields condition number estimates at least as good as those obtained by the previous approach. Moreover, in some cases, the spectral gradient projection algorithm, with a careful choice of the parameters, yields improved condition number estimates.
Similar content being viewed by others
References
Bazaraa MS, Sherali HD, Shetty C (1993) Nonlinear programming: theory and algorithms, 2nd edn. Wiley, New York
Bertsekas DP (2003) Nonlinear programming, 2nd edn. Athena Scientific, Belmont
Birgin EG, Martínez JM, Raydan M (2000) Nonmonotone spectral projected gradient methods on convex sets. SIAM J Optim 10:1196–1211
Birgin EG, Martínez JM, Raydan M (2001) Algorithm 813: Spg-software for convex constrained optimization. ACM Trans Math Softw 27:340–349
Boisvert R, Pozo R, Remington K, Miller B, Lipman R (1998) Mathematical and Computational Sciences Division of Information Technology Laboratory of National Institute of Standards and Technology. Available at http://math.nist.gov/MatrixMarket/formats.html
Cottle R, Pang J, Stone R (1992) The linear complementarity problem. Academic Press, New York
Demmel JW (1997) Applied numerical linear algebra. SIAM, Philadelphia
Gill P, Murray W, Wright M (1991) Numerical linear algebra and optimization. Addison-Wesley, New York
Golub GH, Loan CFV (1996) Matrix computations, 3rd edn. John Hopkins University Press, Baltimore
Hager WW (1984) Condition estimates. SIAM J Sci Stat Comput 5(2):311–316
Hager WW (1998) Applied numerical linear algebra. Prentice Hall, New Jersey
Higham NJ (1988) FORTRAN codes for estimating the one-norm of a real or complex matrix with applications to condition estimation. ACM Trans Math Softw 14(4):381–396
Higham NJ (1996) Accuracy and stability of numerical algorithms. SIAM, Philadelphia
Johnson C (1990) Numerical solution of partial differential equations by the finite element method. Cambridge University Press, London
Júdice JJ, Raydan M, Rosa SS, Santos SA (2008) On the solution of the symmetric eigenvalue complementarity problem by the spectral projected gradient algorithm. Numer Algorithms 44:391–407
Moler C, Little JN, Bangert S (2001) Matlab user’s guide—the language of technical computing. The MathWorks, Sherborn
Murty K (1976) Linear and combinatorial programming. Wiley, New York
Murty K (1988) Linear complementarity, linear and nonlinear programming. Heldermann, Berlin
Author information
Authors and Affiliations
Corresponding author
Additional information
Research of W.W. Hager is partly supported by National Science Foundation Grant 0620286.
Rights and permissions
About this article
Cite this article
Brás, C.P., Hager, W.W. & Júdice, J.J. An investigation of feasible descent algorithms for estimating the condition number of a matrix. TOP 20, 791–809 (2012). https://doi.org/10.1007/s11750-010-0161-9
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s11750-010-0161-9