Q-superlinear convergence of primal-dual interior point quasi-Newton methods for constrained optimization

Journal of the Operations Research Society of Japan

Volumn 40, Issue 3, 1997, Pages 415-436

  Yabe, Hiroshi ^a   Yamashita, Hiroshi ^b  

^a TOKYO UNIVERSITY OF SCIENCE   (Japan)

^b Mathematical Systems Inc   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0010908414     PISSN: 04534514     EISSN: None     Source Type: Journal    
DOI: 10.15807/jorsj.40.415     Document Type: Article

References (26)

1. Boggs, P.T., Tolle, J.W. and Wang, P.: On the local convergence of quasi-Newton methods for constrained optimization, SIAM J. on Control and Optimization, Vol.20 (1982), pp.161-171.
2. Broyden, G.G., Dennis, Jr., J.E. and Moré, J.J.: On the local and superlinear convergence of quasi-Newton methods, Journal of Institute of Mathematics and its Applications, Vol.12 (1973), pp.223-245.
3. Coleman, T.F.: On characterizations of superlinear convergence for constrained optimization, in Computational Solution of Nonlinear Systems of Equations, E.L. Allgower and K.Georg, eds., Lectures in Applied Mathematics, 26, American Mathematical Society, Rhode Island, 1990, pp.113-133.
4. Dembo, R.S. and Steihaug, T.: Truncated-Newton algorithms for large-scale unconstrained optimization, Mathematical Programming, Vol.26 (1983), pp.190-212.
5. Dembo, R.S., Eisenstat, S.O. and Steihaug, T.: Inexact Newton methods, SIAM J. on Numerical Analysis, Vol.19 (1982), pp.400-408.
6. Dennis, Jr., J.E. and More, J.J.: A characterization of superlinear convergence and its application to quasi-Newton methods, Mathematics of Computation, Vol.28 (1974), pp.549-560.
7. Eisenstat, S.C. and Steihaug, T.: Local analysis of inexact quasi-Newton methods, TR82-7, Dept. of Mathematical Sciences, Rice University, Texas, USA, 1982.
8. El-Bakry, A.S., Tapia, R.A., Tsuchiya, T. and Zhang, Y.: On the formulation and theory of the Newton interior-point method for nonlinear programming, Journal of Optimization Theory and Applications, Vol.89 (1996), pp.507-541.
9. Engels, J.R. and Martínez, H. J.: Local and superlinear convergence for partially known quasi-Newton methods, SIAM J. on Optimization, Vol.1 (1991), pp.42-56.
10. Fiacco, A.V. and McCormick, G.P.: Nonlinear Programming: Sequential Unconstrained Minimization Techniques, SIAM, Philadelphia, 1990.
11. Fletcher, R.: Practical Methods of Optimization, Second Edition, John Wiley and Sons, New York, 1987.
12. Fontecilla, R.: Inexact secant methods for nonlinear constrained optimization, SIAM J. on Numerical Analysis, Vol.27 (1990), pp.154-165.
13. Goodman, J.: Newton's method for constrained optimization, Mathematical Programming, Vol.33 (1985), pp.162-171.
14. Hock, W. and Schittkowski, K.: Test Examples for Nonlinear Programming Codes, Lecture Notes in Economics and Mathematical Systems 187, Springer-Verlag, Berlin, 1981.
15. Kojima, M., Mizuno, S. and Yoshise, A.: A primal-dual interior-point algorithm for linear programming, in Progress in Mathematical Programming, Interior-Point and Related Methods, N.Megiddo ed., Springer-Verlag, New York, 1989, pp.29-47.
16. Lasdon, L.S., Plummer, J. and Yu, G.: Primal-dual and primal interior point algorithms for general nonlinear programs, Manuscript, MSIS Department, The University of Texas at Austin, Texas, USA, February 1993.
17. Lustig, I.J., Marsten, R.E. and Shanno, D.F.: Computational experience with a primaldual interior point method for linear programming, Linear Algebra and its Applications, Vol.152 (1991), pp.191-222.
18. Martinez, H.J., Parada, Z. and Tapia, H.A.: On the characterization of Q-superlinear convergence of quasi-Newton interior-point methods for nonlinear programming, Bol. Soc. Mat. Mexicana, Vol.1 (1995), pp.137-148.
19. McCormick, G.P. and Falk, J.E.: The superlinear convergence of a nonlinear primaldual algorithm, Report GWU/OR/Serial T-550/91, Dept. of Operations Research, The George Washington University, Washington DC, USA, July 1991.
20. McShane, K.A., Monma, C.L. and Shanno, D.F.: An implementation of a primal-dual interior point method for linear programming, ORSA Journal on Computing, Vol.1 (1989), pp.70-83.
21. Nocedal, J. and Overton, M.L.: Projected Hessian updating algorithms for nonlinearly constrained optimization, SIAM J. on Numerical Analysis, Vol.22 (1985), pp.821-850.
22. Steihaug, T.: Damped inexact quasi-Newton methods, TR81-3, Dept. of Mathematical Sciences, Rice University, Texas, USA, 1981 (revised May 1984).
23. Vial, J.-P.: Computational experience with a primal-dual interior-point method for smooth convex programming, Optimization Methods and Software, Vol.3 (1994), pp.285-310.
24. Yabe, H. and Yamashita, H.: On the rate of convergence of primal-dual interior point methods based on quasi-Newton methods, in The State of the Art of Scientific Computing and its Prospect, Research Report (RIMS Kokyuroku) No.880, Research Institute for Mathematical Sciences, Kyoto University, Kyoto, Japan, in Japanese, July 1994, pp.211-219.
25. Yamashita, H.: A globally convergent primal-dual interior point method for constrained optimization, Technical Report, Mathematical Systems, Inc., Tokyo, Japan, April 1992 (revised March 1994).
26. Yamashita, H. and Yabe, H.: Superlinear and quadratic convergence of some primaldual interior point methods for constrained optimization, Mathematical Programming, Vol.75 (1996), pp.377-397.