Advances in Nonlinear Programming pp 31-56
A Primal-dual Interior Method for Nonconvex Nonlinear Programming
Primal-dual interior methods for nonconvex nonlinear programming have recently been the subject of significant attention from the optimization community. Several different primal-dual methods have been suggested, along with some theoretical and numerical results. Although the underlying motivation for all of these methods is relatively uniform, there axe nonetheless substantive variations in crucial details, including the formulation of the nonlinear equations, the form of the associated linear system, the choice of linear algebraic procedures for solving this system, strategies for adjusting the barrier parameter and the Lagrange multiplier estimates, the merit function, and the treatment of indefiniteness. Not surprisingly, each of these choices can affect the theoretical properties and practical performance of the method. This paper discusses the approaches to these issues that we took in implementing a specific primal-dual method.
Unable to display preview. Download preview PDF.
- M. Argaez and R. A. Tapia (1997). On the global convergence of a modified augmented Lagrangian linesearch interior point Newton method for nonlinear programming, Report 95-38 (modified February 1997 ), Department of Computational and Applied Mathematics, Rice University, Houston, Texas.Google Scholar
- R. H. Byrd, J. C. Gilbert, and J. Nocedal (1996). A trust region method based on interior point techniques for nonlinear programming, Technical Report OTC 96/02, Argonne National Laboratory, Argonne, Illinois.Google Scholar
- R. H. Byrd, M. E. Hribar, and J. Nocedal (1997). An interior point algorithm for large-scale nonlinear programming, Technical Report, Northwestern University, Evanston, Illinois.Google Scholar
- S. H. Cheng and N. J. Higham (1996). A modified Cholesky algorithm based on a symmetric indefinite factorization, Report 289, Department of Mathematics, University of Manchester, Manchester, United Kingdom.Google Scholar
- A. R. Conn, N. I. M. Gould, and P. L. Toint (1996). A primal-dual algorithm for minimizing a non-convex function subject to bound and linear equality constraints, Report RC 20639, IBM T. J. Watson Research Center, Yorktown Heights, New York.Google Scholar
- A. Forsgren añd P. E. Gill (1996). Primal-dual interior methods for non- convex nonlinear programming, Report NA 96-3, Department of Mathematics, University of California, San Diego.Google Scholar
- D. M. Gay, M. L. Overton, and M. H. Wright. Strategies for treating indef- initeness in a primal-dual method for nonconvex optimization, Technical Report, Bell Laboratories, Murray Hill, New Jersey, to appear.Google Scholar
- G. P. McCormick (1991). The superlinear convergence of a nonlinear primal-dual algorithm, Report T-550/91, Department of Operations Research, George Washington University, Washington, DC.Google Scholar
- M. H. Wright (1992). Interior methods for constrained optimization, in A. Iserles (ed.),Acta Numerica 1992, 341–407, Cambridge University Press, New York.Google Scholar
- M. H. Wright (1997). Ill-conditioning and computational error in primal- dual methods for nonlinear programming, Technical Report 97-4-04, Computing Sciences Research Center, Bell Laboratories, Murray Hill, New Jersey.Google Scholar
- S. J. Wright (1996). Modifying the Cholesky factorization in interior- point methods. Technical Report ANL/MCS-P600-0596, Argonne National Laboratory, Argonne, Illinois.Google Scholar