A trust region interior point algorithm for linearly constrained optimization

SIAM Journal on Optimization

Volumn 7, Issue 3, 1997, Pages 717-731

  Bonnans, J Frédéric ^a   Pola, Cecilia ^b  

^a INRIA ROCQUENCOURT   (France)

^b UNIVERSITY OF CANTABRIA   (Spain)

Author keywords

Interior points; Linesearch; Quadratic model; Trust region

Indexed keywords

EID: 0031285895     PISSN: 10526234     EISSN: None     Source Type: Journal    
DOI: 10.1137/S1052623493250639     Document Type: Article

References (27)

1. L. ARMIJO, Minimization of functions having Lipschitz continuous first partial derivatives, Pacific J. Math., 16 (1966), pp. 1-3.
2. J. F. BONNANS AND M. BOUHTOU, The trust region affine interior point algorithm for nonconvex quadratic programming, RAIRO Rech. Opér., 29 (1995), pp. 195-217.
3. J. F. BONNANS AND G. LAUNAY, An implicit trust region algorithm for constrained optimization, SIAM J. Optim., 5 (1995), pp. 792-812.
4. J. F. BONNANS AND A. SULEM, Pseudopower expansion of generalized equations and constrained optimization problems, Math. Programming, 70 (1995), pp. 123-148.
5. M. BOUHTOU, Méthodes de points intérieurs pour l'optimisation des systèmes de grande taille, Ph.D. dissertation, Université de Paris-IX Dauphine, Paris, France, 1993.
6. J. P. BULTEAU AND J. P. VIAL, A restricted trust region algorithm for unconstrained optimization, J. Optim. Theory Appl., 47 (1985), pp. 413-435.
7. T. F. COLEMAN AND Y. LI, An Interior, Trust Region Approach for Nonlinear Minimization Subject to Bounds, Technical report TR93-1342, Computer Science Department, Cornell University, Ithaca, NY, 1993.
8. D. DEN HERTOG, C. ROOS, AND T. TERLAKY, On the classical logarithmic barrier function method for a class of smooth convex programming problems, J. Optim. Theory Appl., 73 (1992), pp. 1-25.
9. J. E. DENNIS, M. HEINKENSCHLOSS, AND L. N. VICENTE, Trust-Region Interior Point Algorithms for a Class of Nonlinear Programming Problems, Department of Computational and Applied Mathematics, Rice University, Houston, TX, 1994.
10. I. I. DIKIN, Iterative solutions of problems of linear and quadratic programming, Soviet Math. Dokl., 8 (1967), pp. 674-675.
11. I. I. DIKIN AND V. I. ZORKALCEV, Iterative Solutions of Mathematical Programming Problems (Algorithms of Interior Point Methods), Nauka Publishers, Novosibirsk, 1980 (in Russian).
12. R. FLETCHER, Practical Methods of Optimization, 2nd ed., John Wiley & Sons, Chichester, New York, 1987.
13. C. C. GONZAGA AND L. A. CARLOS, A primal affine-scaling algorithm for linearly constrained convex programs, Technical report ES-238/90, Universidade Federal do Rio de Janeiro, Brazil, 1990.
14. C. C. GONZAGA, An interior trust region method for linearly constrained optimization, COAL Bull., 19 (1991), pp. 55-65.
15. F. JARRE, On the method of analytic centers for solving smooth convex programs, in Lecture Notes in Mathematics 1405, S. Dolecki, ed., Springer-Verlag, Berlin, New York, 1989, pp. 69-85.
16. K. JITTORNTRUM, Solution point differentiability without strict complementarity in nonlinear programming, Math. Programming Study, 21 (1984), pp. 127-138.
17. N. KARMARKAR, A new polynomial time algorithm for linear programming, Combinatorica, 4 (1984), pp. 373-395.
18. G. MCCORMICK, The projective SUMT method for convex programming problems, Math. Oper. Res., 14 (1989), pp. 203-223.
19. S. MEHROTRA AND J. SUN, An interior point algorithm for solving smooth convex programs based on Newton's method, in Mathematical Developments Arising from Linear Programming, Contemporary Mathematics 114, J. C. Lagarias and M. J. Todd, eds., AMS, Providence, RI, 1990, pp. 265-284.
20. R. D. C. MONTEIRO AND I. ADLER, An extension of Karmarkar-type algorithms to a class of convex separable programming problems with global rate of convergence, Math. Oper. Res., 15 (1990), pp. 408-422.
21. J. J. MORÉ, Recent developments in algorithms and software for trust region method, in Mathematical Programming, the State of the Art, A. Bachem, M. Grötschel, and B. Korte, eds., Springer-Verlag, Berlin, New York, 1983, pp. 258-287.
22. M. J. D. POWELL, Algorithms for nonlinear constraints that use Lagrangian functions, Math. Programming, 15 (1978), pp. 224-248.
23. S. M. ROBINSON, Strongly regular generalized equations, Math. Oper. Res., 5 (1980), pp. 43-62.
24. D. C. SORENSEN, Newton's method with a model trust region modification, SIAM J. Numer. Anal., 19 (1982), pp. 409-426.
25. J. SUN, A convergence proof for an affine-scaling algorithm for convex quadratic programming without nondegeneracy assumptions, Math. Programming, 60 (1993), pp. 69-79.
26. T. TSUCHIYA, Global Convergence of the Affine Scaling Algorithm for Primal Degenerate Strictly Convex Quadratic Programming Problems, Math. Oper. Res., 47 (1993), pp. 509-539.
27. Y. YE AND E. TSE, An extension of Karmarkar's projective algorithm for convex quadratic programming, Math. Programming, 44 (1989), pp. 157-179.