Loss and retention of accuracy in affine scaling methods

Optimization Methods and Software

Volumn 15, Issue 2, 2001, Pages 121-151

  Dax, Achiya ^a  

^a Hydrological Service of Israel   (Israel)

Author keywords

Accurate computation of small residuals; Affine scaling methods; Convergence properties; Linear 1 problems; Numerical experiments; Rounding errors

Indexed keywords

ALGORITHMS; ERROR ANALYSIS; ITERATIVE METHODS; PROBLEM SOLVING; VECTORS;

SCALING METHODS;

LINEAR PROGRAMMING;

EID: 0036457812     PISSN: 10556788     EISSN: None     Source Type: Journal    
DOI: None     Document Type: Article

References (53)

1. Adler, I. and Monteiro, R. D. C. (1991). Limiting behavior of the affine scaling continuous trajectories for linear programming problems, Math. Programming, 50, 29-51.
2. Adler, I., Resende, M. G. C., Veiga, G. and Karmarkar, N. (1989). An implementation of Karmarkar's algorithm for linear programming, Math. Programming, 44, 297-335.
3. Barnes, E. R. (1986). A variation on Karmarkar's algorithm for solving linear programming problems, Math. Programming, 36, 174-182.
4. Barnes, E. R. (1990). Some results concerning convergence of the affine scaling algorithm, Contemporary Math., 114, 131-139.
5. Bjorck, A. (1987). Stability analysis of the method of semi-normal equations for least squares problems, Linear Algebra and Its Applications, 88/89, 31-48.
6. Bjorck, A., Numerical Methods for Least Squares Problems, SIAM, 1996.
7. Bloomfield, P. and Steiger, W. L., Least Absolute Deviations, Birkhauser, Boston, 1983.
8. Cavalier, T. M. and Soyster, A. L., Some Computational Experience and a Modification of the Karmarkar Algorithm, ISME Working Paper 85-105. The Pennsylvania State University, 1985.
9. 1 problems, Math. Programming, 56, 189-222.
10. 1 solution of linear equations subject to linear constraints, SIAM J. on Scientific and Statistical Computing, 10, 328-340.
11. Dax, A., On theory and practice of affine scaling methods, Tech. Rep., Hydrological Service of Israel, 1999.
12. Dax, A. (2000). A modified Gram-Schmidt algorithm with iterative orthogonalization and column pivoting, Linear Algebra and Its Applications, 310, 25-42.
13. Dax, A., Accurate computation of small projections, Tech. Rep., Hydrological Service of Israel, 2001.
14. Dikin, I. I. (1967). Iterative Solution of Problems of Linear and Quadratic Programming, Soviet Mathematics Doklady, 8, 674-675.
15. Duff, I. S., Erisman, A. M. and Reid, J. K., Direct Methods for Sparse Matrices, Oxford University Press, 1986.
16. Efron, B. (1988). Computer intensive methods in statistical regression, SIAM Review, 30, 421-449.
17. Foster, L. V., Modifications of the normal equations method that are numerically stable, In: Numerical Linear Algebra, Digital Signal Processing and Parallel Algorithms, Golub, G. H. and Van Dooren, P. (Eds.), NATO ASI Series, Springer, Verlag, Berlin, 1991, pp. 501-512.
18. Golub, G. H. (1965). Numerical methods for solving least squares problems, Numerische Mathematik, 7, 206-216.
19. Golub, G. H. and Van Loan, C. F., Matrix Computations, Johns Hopkins University Press, 1983.
20. Higham, N. J. (1996). Accuracy and Stability of Numerical Algorithms, SIAM.
21. Karmarkar, N. (1984). A new polynomial-time algorithm for linear programming, Combinatorica, 4, 373-395.
22. Lawson, C. L. and Hanson, R. J., Solving Least Squares Problems, Prentice-Hall, 1974.
23. 1 Solution of Overdetermined Linear Equations by an Affine Scaling Linear Programming Algorithm, Technical Report, Presented at the SIAM National Meeting, Minneapolis, 11 July, 1988.
24. Mascarenhas, W. F. (1997). The affine scaling algorithm fails for γ=0.999, SIAM Journal on Optimization, 7, 34-46.
25. Meketon, M. S., Least Absolute Value Regression, Technical Report, AT & T Bell Laboratory, Murray Hill, NJ, 1987.
26. 1 Regression, Technical Report, Chevron Research and Technology Company, 1998.
27. Monma, C. L. and Morton, A. J. (1987). Computational Experiments with a Dual Affine Variant of Karmarkar's Method for Linear Programming, Operations Research Letters, 6, 261-267.
28. Monteiro, R. D. C. and Wright, S. (1995). Superlinear primal-dual affine scaling algorithms for LCP, Mathematical Programming, 69, 311-333.
29. Monteiro, R. D. C. and Wright, S. (1996). A superlinear infeasible-interior-point affine scaling algorithm for LCP, SIAM Journal on Optimization, 6, 1-18.
30. Monteiro, R. D. C. and Tsuchiya, T. (1998). Global convergence of the affine scaling algorithm for convex quadratic programming, SIAM Journal on Optimization, 8, 26-58.
31. Monteiro, R. D. C. and Wang, Y. (1998). Trust region affine scaling algorithms for linearly constrained convex and concave programs, Mathematical Programming, 80, 283-313.
32. Muramatsu, M. and Tsuchiya, T. (1996). A convergence analysis of the projective scaling algorithm based on the long-step homogeneous affine scaling algorithm, Mathematical Programming, 72, 291-305.
33. Osborne, M. R., Finite Algorithms in Optimization and Data Analysis, John Wiley, 1985.
34. ∞, minimization via a variant of Karmarkar's algorithm, IEEE Transactions on Acoustics Speech and Signal Processing, 37, 245-253.
35. Stewart, G. W., Introduction to Matrix Computations, Academic Press, 1973.
36. Stewart, G. W. (1998). Matrix Algorithms, Volume 1: Basic Decompositions, SIAM.
37. Stone, R. E. and Tovey, C. A. (1991). The simplex and projective scaling algorithms as iteratively reweighted least squares methods, SIAM Review, 33, 220-237.
38. Terlaky, T. and Tsuchiya, T., A Note on Mascarenhas' Counter Example about Global Convergence of the Affine Scaling Algorithm, Research Memorandum No. 596, The Institute of Statistical Mathematics, Tokyo, Japan, March, 1996.
39. Todd, M. J. (1991). The affine-scaling direction for linear programming is a limit of projective-scaling directions, Linear Algebra and Its Applications, 152, 93-105.
40. Todd, M. J. and Burrell, B. P. (1986). An extension of Karmarkar's algorithm for linear programming using dual variables, Algorithmica, 1, 409-424.
41. Tseng, P. and Luo, Z. (1992). On the convergence of the affine-scaling algorithm, Mathematical Programming, 56, 301-319.
42. Tsuchiya, T. (1991). Global convergence of the affine scaling methods for degenerate linear programming problems, Mathematical Programming Series B, 52, 377-404.
43. Tsuchiya, T. (1992). Global convergence property of the affine scaling methods for primal degenerate linear programming problems, Mathematics of Operations Research, 17, 527-557.
44. Tsuchiya, T., Affine Scaling Algorithm, In: Interior Point Methods of Mathematical Programming, Terkaly, T. (Ed.), Kluwer Academic Publishers, 1996, pp. 35-82.
45. Tsuchiya, T. and Monteiro, R. D. C. (1996). Superlinear convergence of the affine scaling algorithm, Mathematical Programming, 75, 77-110.
46. Tsuchiya, T. and Muramatsu, M. (1995). Global convergence of a long-step affine scaling algorithm for degenerate linear programming problems, SIAM Journal on Optimization, 5, 525-551.
47. Turner, K. (1991). Computing projections for the Karmarkar algorithm, Linear Algebra and Its Applications, 152, 141-154.
48. Vanderbei, R. J. (1989). Affine-scaling for linear programs with free variables, Mathematical Programming, 43, 31-44.
49. Vanderbei, R. J., Linear Programming: Foundations and Extensions, Kluwer Academic Publishers, 1997.
50. Vanderbei, R. J. and Lagarias, J. C. (1990). I.I. Dikin's convergence result for the affine-scaling algorithm, Contemporary Mathematics, 114, 109-119.
51. Vanderbei, R. J., Meketon, M. S. and Freedman, B. A. (1986). A modification of Karmarkar's linear programming algorithm, Algorithmica, 1, 395-407.
52. Watson, G. A. (1998). Choice of norms for data fitting and function approximation, Acta Numerica, 7, 337-377.
53. ∞-solutions of overdetermined linear systems, Journal of Optimization Theory and Applications, 77, 323-341.