An interior point algorithm for large-scale nonlinear programming

SIAM Journal on Optimization

Volumn 9, Issue 4, 1999, Pages 877-900

  Byrd, Richard H ^a   Hribar, Mary E ^b   Nocedal, Jorge ^c  

^a UCB 450   (United States)

^b RICE UNIVERSITY   (United States)

^c NORTHWESTERN UNIVERSITY   (United States)

Author keywords

Barrier method; Constrained optimization; Interior point method; Large scale optimization; Nonlinear programming; Primal method; Primal dual method; Sequential quadratic programming; Trust region method

Indexed keywords

EID: 0033471382     PISSN: 10526234     EISSN: None     Source Type: Journal    
DOI: 10.1137/S1052623497325107     Document Type: Article

References (42)

1. K. M. ANSTREICHER AND J.-P. VIAL, On the convergence of an infeasible primal-dual interior-point method for convex programming, Optim. Methods Softw., 3 (1994), pp. 273-283.
2. M. ARGAEZ, Exact and Inexact Newton Linesearch Interior-Point Algorithms for Nonlinear Programming Problems, Technical Report TR97-13, Department of Computational and Applied Mathematics, Rice University, Houston, TX, 1997.
3. P. T. BOGGS AND J. W. TOLLE, Sequential quadratic programming, Acta Numer., 4 (1996), pp. 1-51.
4. I. BONGARTZ, N. I. M. GOULD, A. R. CONN, AND PH. L. TOINT, CUTE: Constrained and unconstrained testing environment, ACM Trans. Math. Software, 21 (1995), pp. 123-160.
5. J. F. BONNANS AND C. POLA, A trust region interior point algorithm for linearly constrained optimization, SIAM J. Optim., 7 (1997), pp. 717-731.
6. R. H. BYRD, Robust trust region methods for constrained optimization, talk presented at the Third SIAM Conference on Optimization, Houston, TX, 1987.
7. R. H. BYRD, J. C. GILBERT, AND J. NOCEDAL, A Trust Region Method Based on Interior Point Techniques for Nonlinear Programming, Technical Report OTC 96/02, Optimization Technology Center, Northwestern University, Evanston, IL, 1996.
8. R. H. BYRD, G. LIU, AND J. NOCEDAL, On the local behavior of an interior-point algorithm for nonlinear programming, in Numerical Analysis 1997, D.F. Griffiths and D.J. Higham, eds., Addison-Wesley Longman, Reading, MA, 1997.
9. R. H. BYRD, R. B. SCHNABEL, AND G. A. SHULTZ, A trust region algorithm for nonlinearly constrained optimization, SIAM J. Numer. Anal., 24 (1987), pp. 1152-1170.
10. M. R. CELIS, J. E. DENNIS, AND R. A. TAPIA, A trust region strategy for nonlinear equality constrained optimization, in Numerical Optimization 1984, Proceedings SIAM Conference on Numerical Optimization, Boulder, CO, June 12-14, 1984, P. T. Boggs, R. H. Byrd, and R. B. Schnabel, eds., SIAM, Philadelphia, PA, 1985, pp. 71-82.
11. R. CHAMBERLAIN, C. LEMARECHAL, H. C. PEDERSEN, AND M. J. D. POWELL, The watch-dog technique for forcing convergence in algorithms for constrained optimization, Math. Programming, 16 (1982), pp. 1-17.
12. T. F. COLEMAN AND Y. LI, On the convergence of reflective Newton methods for large-scale nonlinear minimization subject to bounds, Math. Programming, 67 (1994), pp. 189-224.
13. T. F. COLEMAN AND Y. LI, An interior trust region approach for nonlinear minimization subject to bounds, SIAM J. Optim., 6 (1996), pp. 418-445.
14. A. R. CONN, N. I. M. GOULD, AND PH. L. TOINT, LANCELOT: A FORTRAN Package for Large-Scale Nonlinear Optimization (Release A), Springer Ser. Comput. Math. 17, Springer, New York, 1992.
15. A. R. CONN, N. I. M. GOULD, AND PH. L. TOINT, A Primal-Dual Algorithm for Minimizing Non-Convex Function Subject to Bound and Linear Equality Constraints, Technical Report RC 20639, IBM T.J. Watson Research Center, Yorktown Heights, NY, 1997.
16. A. R. CONN, N. I. M. GOULD, AND PH. L. TOINT, A note on using alternative second-order models for the subproblems arising in barrier function methods for minimization, Numer. Math., 68 (1994), pp. 17-33.
17. J. E. DENNIS. M. HEINKENSCHLOSS, AND L. N. VICENTE, Trust-region interior-point SQP algorithms for a class of nonlinear programming problems, SIAM J. Control Optim., 36 (1998), pp. 1750-1794.
18. A. S. EL-BAKRY, R. A. TAPIA, T. TSUCHIYA, AND Y. ZHANG, On the formulation and theory of the Newton interior-point method for nonlinear programming, J. Optim. Theory Appl., 89 (1996), pp. 507-545.
19. R. FLETCHER, Practical Methods of Optimization, 2nd ed., John Wiley, New York, 1990.
20. A. FORSGREN AND P. E. GILL, Primal-dual interior methods for nonconvex nonlinear programming, SIAM J. Optim., 8 (1998), pp. 1132-1152.
21. D. M. GAY, M. L. OVERTON, AND M. H. WRIGHT, A primal-dual interior method for nonconvex nonlinear programming, in Advances in Nonlinear Programming, Y. Yuan, ed., Kluwer Academic Publishers, Dordrecht, Netherlands, 1998, pp. 31-56.
22. P. GILL, W. MURRAY, AND M. H. WRIGHT, Practical Optimization, Academic Press, New York, 1981.
23. P. E. GILL, W. MURRAY, AND M. A. SAUNDERS, SNOPT: An SQP Algorithm for Large-Scale Constrained Optimization, Technical Report NA 97-2, Department of Mathematics, University of California, San Diego, 1997; SIAM J. Optim., submitted.
24. N. I. M. GOULD, M. E. HRIBAR, AND J. NOCEDAL, On the Solution of Equality Constrained Quadratic Programming Problems Arising in Optimization, Technical Report OTC 98/06, Optimization Technology Center, Northwestern University, Evanston, IL, 1998; SIAM J. Sci. Comput., submitted.
25. HARWELL SUBROUTINE LIBRARY, A Catalogue of Subroutines (Release 12), AEA Technology, Harwell, Oxfordshire, England, 1995.
26. W. HOCK AND K. SCHITTKOWSKI, Test Examples for Nonlinear Programming Codes, Lecture Notes in Econom. and Math. Systems 187, Springer, New York, 1981.
27. M. E. HRIBAR, Large-Scale Constrained Optimization, Ph.D. thesis, EECS Department, Northwestern University, Evanston, IL, 1996.
28. F. JARRE AND S. J. WRIGHT, On the Role of the Objective Function in Barrier Methods, Technical Report MCS-P485-1294, MCS Division, Argonne National Laboratory, Argonne, IL, 1994.
29. M. LALEE, J. NOCEDAL, AND T. PLANTENGA, On the implementation of an algorithm for large-scale equality constrained optimization, SIAM J. Optim., 8 (1998), pp. 682-706.
30. N. MARATOS, Exact Penalty Function Algorithms for Finite Dimensional and Control Optimization Problems, Ph.D. thesis, University of London, 1978.
31. R. D. C. MONTEIRO AND Y. WANG, Trust region affine scaling algorithms for linearly constrained convex and concave programs, Math. Programming, 80 (1998), pp. 283-313.
32. E. OMOJOKUN, Trust Region Algorithms for Optimization with Nonlinear Equality and Inequality Constraints, Ph.D. thesis, University of Colorado, Boulder, CO, 1989.
33. Z. PARADA, A Modified Augmented Lagrangian Merit Function and q-Superlinear Characterization Results for Primal-Dual Quasi-Newton Interior-Point Methods for Nonlinear Programming, Technical Report TR97-12, Department of Computational and Applied Mathematics, Rice University, Houston, TX, 1997.
34. T. PLANTENGA, A trust region method for nonlinear programming based on primal interior-point techniques, SIAM J. Sci. Comput., 20 (1998), pp. 282-305.
35. M. J. D. POWELL, A hybrid method for nonlinear equations, in Numerical Methods for Nonlinear Algebraic Equations, P. Rabinowitz, ed., Gordon &: Breach, London, 1970, pp. 87-114.
36. T. STEIHAUG, The conjugate gradient method and trust regions in large scale optimization, SIAM J. Numer. Anal., 20 (1983), pp. 626-637.
37. R. J. VANDERBEI, Linear Programming, Kluwer, Dordrecht, the Netherlands, 1996.
38. A. VARDI, A trust region algorithm for equality constrained minimization: Convergence properties and implementation, Math. Programming, 22 (1985), pp. 575-591.
39. M. H. WRIGHT, Why a pure primal Newton barrier step may be infeasible, SIAM J. Optim., 5 (1995), pp. 1-12.
40. S. J. WRIGHT, Primal-Dual Interior-Point Methods, SIAM, Philadelphia, PA, 1997.
41. H. YAMASHITA, A Globally Convergent Primal-Dual Interior-Point Method for Constrained Optimization, Technical Report, Mathematical Systems Institute, Inc., Tokyo, Japan, 1994.
42. H. YAMASHITA AND H. YABE, Superlinear and quadratic convergence of some primal-dual interior point methods for constrained optimization, Math. Programming, 75 (1996), pp. 377-397.