Trust region affine scaling algorithms for linearly constrained convex and concave programs

Mathematical Programming, Series B

Volumn 80, Issue 3, 1998, Pages 283-313

  Monteiro, Renato D C ^a   Wang, Yanhui ^a  

^a Georgia Institute of Technology   (United States)

Author keywords

Affine scaling algorithm; Interior point method; Linearly constrained problem; Trust region method

Indexed keywords

EID: 0012035936     PISSN: 00255610     EISSN: None     Source Type: Journal    
DOI: 10.1007/BF01581170     Document Type: Article

References (49)

1. I. Adler, N.K. Karmarkar, M.G.C. Resende and G. Veiga, An implementation of Karmarkar's algorithm for linear programming, Mathematical Programming 44 (1989) 297-335. Errata in: Mathematical Programming 50 (1991) 415.
2. I. Adler and R.D.C. Monteiro, Limiting behavior of the affine scaling continuous trajectories for linear programming problems, Mathematical Programming 50 (1991) 29-51.
3. E.R. Barnes, A variation on Karmarkar's algorithm for solving linear programming problems, Mathematical Programming 36 (1986) 174-182.
4. D.A. Bayer and J.C. Lagarias, The nonlinear geometry of linear programming, Part I: Affine and projective scaling trajectories, Transactions of the American Mathematical Society 314 (1989) 499-526.
5. J. Bonnans and M. Bouhtou, The trust region affine interior point algorithm for convex and nonconvex quadratic programming, RAIRO - Recherche Opérationnelle 29 (1995) 195-217.
6. I.I. Dikin, Iterative solution of problems of linear and quadratic programming, Doklady Akademii Nauk SSSR 174 (1967) 747-748. Translated in: Soviet Mathematics Doklady 8 (1967) 674-675.
7. I.I. Dikin, Iterative solution of problems of linear and quadratic programming, Doklady Akademii Nauk SSSR 174 (1967) 747-748. Translated in: Soviet Mathematics Doklady 8 (1967) 674-675.
8. I.I. Dikin, On the convergence of an iterative process, Upravlyaemye Sistemi 12 (1974) 54-60. (In Russian.)
9. I.I. Dikin, The convergence of dual variables, Technical Report, Siberian Energy Institute, Irkutsk, Russia, December 1991.
10. I.I. Dikin and V.I. Zorkaltsev, Iterative solutions of mathematical programming problems (Nauka, Novosibirsk, 1980).
11. R. Fletcher, Practical Methods of Optimization (John Wiley, New York, 2nd ed., 1987).
12. D.M. Gay, Computing optimal locally constrained steps, SIAM Journal on Scientific and Statistical Computing 2 (1981) 186-197.
13. C.C. Gonzaga, Convergence of the large step primal affine-scaling algorithm for primal nondegenerate linear programs, Technical Report ES-230/90, Dept. of Systems Engineering and Computer Science, COPPE Federal University of Rio de Janeiro, 21941 Rio de Janeiro, RJ, Brazil, September 1990.
14. C.C. Gonzaga, An interior trust region method for linearly constrained optimization, COAL Newsletter 19 (1991) 55-66.
15. C.C. Gonzaga and L.A. Carlos, A primal affine-scaling algorithm for linearly constrained convex programs, Technical Report ES-238/90, Dept. of Systems Engineering and Computer Science, COPPE Federal University of Rio de Janeiro, 21941 Rio de Janeiro, RJ, Brazil, December 1990.
16. C.-G, Han, P. Pardalos and Y. Ye, On the solution of indefinite quadratic problems using an interior-point algorithm, Informatica 3 (1992) 474-496.
17. A.P. Kamath, N.K. Karmarkar, K.G. Ramakrishnan and M.G.C. Resende, A continuous approach to inductive inference. Mathematical Programming 57 (1992) 215-238.
18. N.K. Karmarkar, A new polynomial-time algorithm for linear programming, Combinatorica 4 (1984) 373-395.
19. N.K. Karmarkar, M.G.C. Resende and K.G. Ramakrishnan, An interior point algorithm to solve computationally difficult set covering problems, Mathematical Programming 52 (1991) 597-618.
20. K. Levenberg, A method for the solution of certain nonlinear problems in least squares, Quart. Appl. Math. 2 (1944) 164-168.
21. D.W. Marquardt, An algorithm for least squares estimation of nonlinear parameters, SIAM Journal on Applied Mathematics 11 (1963) 431-441.
22. W.F. Mascarenhas, The affine scaling algorithm fails for λ = 0.999, technical report, SIAM Journal on Optimization 1 (1997) 34-46.
23. N. Megiddo and M. Shub, Boundary behavior of interior point algorithms in linear programming, Mathematics of Operations Research 14 (1989) 97-114.
24. C.L. Monma and A.J. Morton, Computational experience with the dual affine variant of Karmarkar's method for linear programming, Operations Research Letters 6 (1987) 261-267.
25. R.D.C. Monteiro, Convergence and boundary behavior of the projective scaling trajectories for linear programming, Mathematics of Operations Research 16 (1991) 842-858.
26. R.D.C. Monteiro and T. Tsuchiya, Global convergence of the affine scaling algorithm for convex quadratic programming, Technical Report, School of Industrial Systems Engineering, Georgia Institute of Technology, Atlanta, GA 30332, USA, March 1995. To appear in SIAM Journal on Optimization.
27. R.D.C. Monteiro, T. Tsuchiya and Y. Wang, A simplified global convergence proof of the affine scaling algorithm, Annals of Operations Research 41 (1993) 443-482.
28. R.D.C. Monteiro and S. Wright, Superlinear primal-dual affine scaling algorithms for LCP, Mathematical Programming 69 (1995) 311-333.
29. J.J. Moré, The Levenberg-Marquardt algorithm: Implementation and theory, in: Proceedings of the Dundee Conference of Numerical Analysis, G.A. Watson, ed. (Springer-Verlag, 1978).
30. J.J. Moré, Notes on optimization software, in: Nonlinear Optimization 1981, M.J.D. Powell, ed. (Academic Press, 1982).
31. J.J. Moré, Recent developments in algorithms and software for trust region methods, in: Mathematical Programming Bonn 1982 - The State of the Art, M.G.A. Bachem and B. Korte, eds. (Springer-Verlag, 1983) 259-287.
32. J.J. Moré and D.C. Sorensen, Computing a trust region step, SIAM Journal of Scientific and Statistical Computing 4 (1983) 553-572.
33. P.M. Pardalos and M.G.C. Resende, Interior point methods for global optimization, in: Interior point methods in mathematical programming, T. Terlaky, ed. (Kluwer Academic Publishers, 1996) 467-500.
34. G.A. Schultz, R.S, Schnabel and R.H. Byrd, A family of trust-region-based algorithms for unconstrained minimization with strong global convergence properties, SIAM Journal on Numerical Analysis 22 (1985) 47-67.
35. D.C. Sorensen, Trust region methods for unconstrained optimization, in: Nonlinear Optimization 1981, M.J.D. Powell, ed. (Academic Press, 1982).
36. J. Sun, A convergence proof for an affine-scaling algorithm for convex quadratic programming without nondegeneracy assumptions, Mathematical Programming 60 (1993) 69-79.
37. J. Sun, A convergence proof for a convex version of Dikin's algorithm, Annals of Operations Research 62 (1996) 357-374.
38. P. Tseng and Z.Q. Luo, On the convergence of the affine-scaling algorithm, Mathematical Programming 56 (1992) 301-319.
39. T. Tsuchiya, Global convergence of the affine-scaling methods for degenerate linear programming problems, Mathematical Programming 52 (1991) 377-404.
40. T. Tsuchiya, Global convergence property of the affine scaling method for primal degenerate linear programming problems, Mathematics of Operations Research 17 (1992) 527-557.
41. T. Tsuchiya, Global convergence of the affine scaling algorithm for primal degenerate strictly convex quadratic programming problems, Annals of Operations Research 47 (1993) 509-539.
42. T. Tsuchiya and R.D.C. Monteiro, Superlinear convergence of the affine scaling algorithm, Mathematical Programming 75 (1996) 77-110.
43. T. Tsuchiya and M. Muramatsu, Global convergence of a long-step affine scaling algorithm for degenerate linear programming problems, SIAM Journal on Optimization 5 (1995) 525-551.
44. R.J. Vanderbei and J.C. Lagarias, I. I. Dikin's convergence result for the affine-scaling algorithm, in: Mathematical Developments Arising from Linear Programming: Proceedings of a Joint Summer Research Conference held at Bowdoin College, Brunswick, Maine, USA, June/July 1988, J.C. Lagarias and M.J. Todd, eds., Vol. 114 of Contemporary Mathematics (American Mathematical Society, Providence, RI, 1990) 109-119.
45. R.J. Vanderbei, M.S. Meketon and B.A. Freedman, A modification of Karmarkar's linear programing algorithm, Algorithmica 1 (1986) 395-407.
46. C. Witzgall, P.T. Boggs and P.D. Domich, On the convergence behavior of trajectories for linear programming, in: Mathematical Developments Arising from Linear Programming: Proceedings of a Joint Summer Research Conference held at Bowdoin College, Brunswick, Maine, USA, June/July 1988, J.C. Lagarias and M.J. Todd, eds., vol. 114 of Contemporary Mathematics (American Mathematical Society, Providence, RI, 1990) 161-187.
47. Y. Ye, An extension of Karmarkar's projective algorithm and the trust region method for quadratic programming, in: Progress in Mathematical Programming: Interior Point and Related Methods, N. Megiddo, ed. (Springer, Berlin, 1989) 49-63.
48. Y. Ye, On an affine scaling algorithm for nonconvex quadratic programming, Mathematical Programming 56 (1992) 285-300.
49. Y. Ye and E. Tse, An extension of Karmarkar's projective algorithm for convex quadratic programming, Mathematical Programming 44 (1989) 157-180.