A trust region method based on interior point techniques for nonlinear programming

Abstract.An algorithm for minimizing a nonlinear function subject to nonlinear inequality constraints is described. It applies sequential quadratic programming techniques to a sequence of barrier problems, and uses trust regions to ensure the robustness of the iteration and to allow the direct use of second order derivatives. This framework permits primal and primal-dual steps, but the paper focuses on the primal version of the new algorithm. An analysis of the convergence properties of this method is presented.

[1]  Philip E. Gill,et al.  Practical optimization , 1981 .

[2]  T. Steihaug.  The Conjugate Gradient Method and Trust Regions in Large Scale Optimization , 1983 .

[3]  Richard A. Tapia,et al.  A trust region strategy for nonlinear equality constrained op-timization , 1984 .

[4]  A. Vardi.  A Trust Region Algorithm for Equality Constrained Minimization: Convergence Properties and Implementation , 1985 .

[5]  Richard H. Byrd,et al.  A Trust Region Algorithm for Nonlinearly Constrained Optimization , 1987 .

[6]  E. Panier,et al.  A QP-Free, globally convergent, locally superlinearly convergent algorithm for inequality constrained optimization , 1988 .

[7]  E. Omojokun.  Trust region algorithms for optimization with nonlinear equality and inequality constraints , 1990 .

[8]  Ya-Xiang Yuan,et al.  A trust region algorithm for equality constrained optimization , 1990, Math. Program..

[9]  Margaret H. Wright,et al.  Interior methods for constrained optimization , 1992, Acta Numerica.

[10]  Clóvis C. Gonzaga,et al.  Path-Following Methods for Linear Programming , 1992, SIAM Rev..

[11]  J. Herskovits.  An interior point technique for nonlinear optimization , 1992 .

[12]  R. E. Marsten,et al.  A direct nonlinear predictor-corrector primal-dual interior point algorithm for optimal power flows , 1993 .

[13]  K. Anstreicher,et al.  On the convergence of an infeasible primal-dual interior-point method for convex programming , 1994 .

[14]  Roy E. Marsten,et al.  Feature Article - Interior Point Methods for Linear Programming: Computational State of the Art , 1994, INFORMS J. Comput..

[15]  S. Granville.  Optimal reactive dispatch through interior point methods , 1994 .

[16]  Michael A. Saunders,et al.  A Practical Interior-Point Method for Convex Programming , 1995, SIAM J. Optim..

[17]  Michael A. Saunders,et al.  Primal—dual methods for linear programming , 1995, Math. Program..

[18]  L. N. Vicente,et al.  Trust-Region Interior-Point SQP Algorithms for a Class of Nonlinear Programming Problems , 1998 .

[19]  T. Tsuchiya,et al.  On the formulation and theory of the Newton interior-point method for nonlinear programming , 1996 .

[20]  Thomas F. Coleman,et al.  An Interior Trust Region Approach for Nonlinear Minimization Subject to Bounds , 1993, SIAM J. Optim..

[21]  Jorge Nocedal,et al.  On the Local Behavior of an Interior Point Method for Nonlinear Programming , 1997 .

[22]  Hiroshi Yamashita.  A globally convergent primal-dual interior point method for constrained optimization , 1998 .

[23]  Jorge Nocedal,et al.  On the Implementation of an Algorithm for Large-Scale Equality Constrained Optimization , 1998, SIAM J. Optim..

[24]  Siam J. Sci,et al.  A TRUST REGION METHOD FOR NONLINEAR PROGRAMMING BASED ON PRIMAL INTERIOR-POINT TECHNIQUES , 1998 .

[25]  J. Herskovits.  Feasible Direction Interior-Point Technique for Nonlinear Optimization , 1998 .

[26]  Todd Plantenga,et al.  A Trust Region Method for Nonlinear Programming Based on Primal Interior-Point Techniques , 1998, SIAM J. Sci. Comput..

[27]  Jorge Nocedal,et al.  An Interior Point Algorithm for Large-Scale Nonlinear Programming , 1999, SIAM J. Optim..

[28]  Wenying Guo.  A Trust Region Algorithm for Inequality Constrained Optimization , 2002 .