Primal-dual interior methods for nonconvex nonlinear programming

SIAM Journal on Optimization

Volumn 8, Issue 4, 1998, Pages 1132-1152

  Forsgren, Anders ^a   Gill, Philip E ^b  

^a ROYAL INSTITUTE OF TECHNOLOGY   (Sweden)

^b UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

Barrier methods; Constrained minimization; Interior methods; Modified Newton methods; Nonlinear programming; Penalty methods; Primal dual methods

Indexed keywords

EID: 0032358968     PISSN: 10526234     EISSN: None     Source Type: Journal    
DOI: 10.1137/S1052623496305560     Document Type: Article

References (45)

1. M. ARIOLI, T. F. CHAN, I. S. DUFF, N. I. M. GOULD, AND J. K. REID, Computing a Search Direction for Large-Scale Linearly Constrained Nonlinear Optimization Calculations, Tech. Rep. RAL-93-066, Rutherford Appleton Laboratory, Chilton, England, 1993.
2. A. BENCHAKROUN, J. DUSSAULT, AND A. MANSOURI, A two parameter mixed interior-exterior penalty algorithm, ZOR - Math. Methods Oper. Res., 41 (1995), pp. 25-55.
3. J. R. BUNCH, Partial pivoting strategies for symmetric matrices, SIAM J. Numer. Anal., 11 (1974), pp. 521-528.
4. J. R. BUNCH AND L. KAUFMAN, Some stable methods for calculating inertia and solving symmetric linear systems, Math. Comp., 31 (1977), pp. 163-179.
5. J. R. BUNCH, L. KAUFMAN, AND B. N. PARLETT, Decomposition of asymmetric matrix, Numer. Math., 27 (1976), pp. 95-109.
6. J. R. BUNCH AND B. N. PARLETT, Direct methods for solving symmetric indefinite systems of linear equations, SIAM J. Numer. Anal., 8 (1971), pp. 639-655.
7. R. H. BYRD, J. C. GILBERT, AND J. NOCEDAL, A Trust Region Method Based on Interior Point Techniques for Nonlinear Programming, Tech. Rep. OTC-96/2, Optimization Technology Center, Northwestern University, Evanston, IL, 1996.
8. A. R. CONN, N. I. M. GOULD, AND P. 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.
9. R. W. COTTLE, Manifestations of the Schur complement, Linear Algebra Appl., 8 (1974), pp. 189-211.
10. J. E. DENNIS, JR. AND R. B. SCHNABEL, Numerical Methods for Unconstrained Optimization and Nonlinear Equations, Prentice - Hall, Englewood Cliffs, NJ, 1983.
11. J.-P. DUSSAULT, Numerical stability and efficiency of penalty algorithms, SIAM J. Numer. Anal., 32 (1995), pp. 296-317.
12. A. S. EL-BAKRY, R. A. TAPIA, Y. ZHANG, AND T. TSUCHIYA, On the Formulation and Theory of the Newton Interior Point Method for Nonlinear Programming, Tech. Report 92-40, Department of Computational and Applied Mathematics, Rice University, Houston, TX, 1992. Revised April 1995.
13. A. V. FIACCO AND G. P. MCCORMICK, Nonlinear Programming: Sequential Unconstrained Minimization Techniques, John Wiley and Sons, New York, London, Sydney, Toronto, 1968.
14. R. FLETCHER, Factorizing symmetric indefinite matrices, Linear Algebra Appl., 14 (1976), pp. 257-272.
15. A. FORSGREN, P. E. GILL, AND W. MURRAY, Computing modified Newton directions using a partial Cholesky factorization, SIAM J. Sci. Comput., 16 (1995), pp. 139-150.
16. A. FORSGREN, P. E. GILL, AND J. R. SHINNERL, Stability of symmetric ill-conditioned systems arising in interior methods for constrained optimization, SIAM J. Matrix Anal. Appl., 17 (1996), pp. 187-211.
17. A. FORSGREN AND W. MURRAY, Newton methods for large-scale linear equality-constrained minimization, SIAM J. Matrix Anal. Appl., 14 (1993), pp. 560-587.
18. P. E. GILL, W. MURRAY, D. B. PONCELEÓN, AND M. A. SAUNDERS, Primal-dual methods for linear programming, Math. Programming, 70 (1995), pp. 251-277.
19. P. E. GILL, W. MURRAY, AND M. H. WRIGHT, Practical Optimization, Academic Press, London, New York, 1981.
20. D. GOLDFARB, Curvilinear path steplength algorithms for minimization which use directions of negative curvature, Math. Programming, 18 (1980), pp. 31-40.
21. C. C. GONZAGA, Path-following methods for linear programming, SIAM Rev., 34 (1992), pp. 167-224.
22. N. I. M. GOULD, On the accurate determination of search directions for simple differentiable penalty functions, IMA J. Numer. Anal., 6 (1986), pp. 357-372.
23. N. I. M. GOULD, On the convergence of a sequential penalty function method for constrained minimization, SIAM J. Numer. Anal., 26 (1989), pp. 107-128.
24. N. I. M. GOULD, Constructing Appropriate Models for Large-Scale, Linearly Constrained, Nonconvex, Nonlinear Optimization Algorithms, Tech. Rep. RAL-TR-95-037, Rutherford Appleton Laboratory, Chilton, England, 1995.
25. N. I. M. GOULD, Constructing appropriate models for large-scale, linearly-constrained, non-convex, nonlinear optimization algorithms, SIAM J. Optim., submitted.
26. N. J. HIGHAM, Accuracy and Stability of Numerical Algorithms, SIAM, Philadelphia, PA, 1996.
27. S. KANIEL AND A. DAX, A modified Newton's method for unconstrained minimization, SIAM J. Numer. Anal., 16 (1979), pp. 324-331.
28. M. KOJIMA, S. MIZUNO, AND A. YOSHISE, 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.
29. I. J. LUSTIG, R. E. MARSTEN, AND D. F. SHANNO, Computational experience with a primal-dual interior point method for linear programming, Linear Algebra Appl., 152 (1991), pp. 191-222.
30. G. P. MCCORMICK, A modification of Armijo's step-size rule for negative curvature, Math. Programming, 13 (1977), pp. 111-115.
31. N. MEGIDDO, Pathways to the optimal set in linear programming, in Progress in Mathematical Programming: Interior Point and Related Methods, N. Megiddo, ed., Springer-Verlag, New York, 1989, pp. 131-158.
32. S. MEHROTRA, On the implementation of a primal-dual interior point method, SIAM J. Optim., 2 (1992), pp. 575-601.
33. R. D. C. MONTEIRO AND I. ADLER, Interior path-following primal-dual algorithms. Part II. Convex quadratic programming, Math. Programming, 44 (1989), pp. 43-66.
34. J. J. MORÉ AND D. C. SORENSEN, On the use of directions of negative curvature in a modified Newton method, Math. Programming, 16 (1979), pp. 1-20.
35. H. MUKAI AND E. POLAK, A second-order method for unconstrained optimization, J. Optim. Theory Appl., 26 (1978), pp. 501-513.
36. W. MURRAY, Analytical expressions for the eigenvalues and eigenvectors of the Hessian matrices of barrier and penalty functions, J. Optim. Theory Appl., 7 (1971), pp. 189-196.
37. W. MURRAY AND M. H. WRIGHT, Line search procedures for the logarithmic barrier function, SIAM J. Optim., 4 (1994), pp. 229-246.
38. D. B. PONCELEÓN, Barrier Methods for Large-Scale Quadratic Programming, Ph.D. thesis, Report SOL 91-2, Department of Operations Research, Stanford University, Stanford, CA, 1991.
39. M. J. D. POWELL, A method for nonlinear constraints in minimization problems, in Optimization, R. Fletcher, ed., Academic Press, New York, 1969, pp. 283-298.
40. K. SVANBERG, Method of moving asymptotes - a new method for structural optimization, Internat. J. Numer. Methods Engrg., 24 (1987), pp. 359-373.
41. M. H. WRIGHT, Some properties of the Hessian of the logarithmic barrier function, Math. Programming, 67 (1994), pp. 265-295.
42. M. H. WRIGHT, Why a pure primal Newton barrier step may be infeasible, SIAM J. Optim., 5 (1995), pp. 1-12.
43. S. J. WRIGHT, Stability of linear equations solvers in interior-point methods, SIAM J. Matrix Anal. Appl., 16 (1995), pp. 1287-1307.
44. S. WRIGHT, Stability of augmented system factorizations in interior-point methods, SIAM J. Matrix Anal. Appl., 18 (1997), pp. 191-222.
45. Y. YE, Line Searches in Potential Reduction Algorithm for Linear Programming. manuscript, 1989.