Skip to main content
Log in

A Projected Indefinite Dogleg Path Method for Equality Constrained Optimization

  • Published:
BIT Numerical Mathematics Aims and scope Submit manuscript

Abstract

In this paper, we propose a 2-step trust region indefinite dogleg path method for the solution of nonlinear equality constrained optimization problems. The method is a globally convergent modification of the locally convergent Fontecilla method and an indefinite dogleg path method is proposed to get approximate solutions of quadratic programming subproblems even if the Hessian in the model is indefinite. The dogleg paths lie in the null space of the Jacobian matrix of the constraints. An ℓ1 exact penalty function is used in the method to determine if a trial point is accepted. The global convergence and the local two-step superlinear convergence rate are proved. Some numerical results are presented.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

REFERENCES

  1. 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.

    Google Scholar 

  2. R. H. Byrd and J. Nocedal, An analysis of reduced Hessian methods for constrained optimization, Technical Report CU-CS–398–88, Department of Computer Science, University of Colorado, Boulder, CO, 1988.

    Google Scholar 

  3. R. H. Byrd and R. B. Schnabel, Continuity of the null space basis and constrained optimization, Math. Programming, 35 (1986), pp. 32–41.

    Google Scholar 

  4. 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.

    Google Scholar 

  5. M. R. Celis, J. E. Dennis, and R. A. Tapia, A trust region strategy for nonlinear equality constrained optimization, in Numerical Optimization, P. Boggs et al., eds., SIAM Philadelphia, 1985.

  6. T. F. Coleman and A. R. Conn, On the local convergence of a quasi-Newton method for the nonlinear programming problem, SIAM J. Numer. Anal., 21 (1984), pp. 755–769.

    Google Scholar 

  7. J. E. Dennis and H. H. W. Mei, Two new unconstrained optimization algorithms which use function and gradient values, J. Optim. Theory Appl., 28 (1979), pp. 453–482.

    Google Scholar 

  8. J. E. Dennis, M. El-Alem, and M. C. Maciel, A global convergence theory for general trust-region-based algorithms for equality constrained optimization, SIAM J. Optim., 7 (1997), pp. 177–207.

    Google Scholar 

  9. J. E. Dennis and L. N. Vicente, On the convergence theory of trust-region-based algorithms for equality constrained optimization, SIAM J. Optim., 7 (1997), pp. 927–950.

    Google Scholar 

  10. M. El-Alem, A global convergence theory for the Celis-Dennis-Tapia trust-region algorithm for constrained optimization, SIAM J. Numer. Anal., 28 (1991), pp. 266–290.

    Google Scholar 

  11. M. El-Alem, A robust trust-region algorithm with a non-monotonic penalty parameter scheme for constrained optimization, SIAM J. Optim., 5 (1995), pp. 348–378.

    Google Scholar 

  12. M. El-Alem, Convergence to a second-order point of a trust-region algorithm with a non-monotonic penalty parameter for constrained optimization, J. Optim. Theory Appl., 91 (1996), pp. 61–79.

    Google Scholar 

  13. M. El-Hallabi, A global convergence theory for arbitrary norm trust-region algorithms for equality constrained optimization, Technical Report TR 93–60, Department of Computational and Applied Mathematics, Rice University, 1993. Revised May 1995.

  14. R. Fletcher, Practical Methods of Optimization, 2nd ed., John Wiley, New York, 1987.

    Google Scholar 

  15. R. Fontecilla, Local convergence of secant methods for nonlinear constrained optimization, SIAM J. Numer. Anal., 25 (1988), pp. 691–712.

    Google Scholar 

  16. M. D. Hebden, An algorithm for minimization using exact second derivatives, Report TP515, Atomic Energi Research Establishment, Harwell, England, 1973.

    Google Scholar 

  17. W. Hock and K. Schittkowski, Test Examples for Nonlinear Programming Codes, Lecture Notes in Economics and Mathematical Systems 187, Springer-Verlag, Berlin, 1981.

    Google Scholar 

  18. J. J. Moré, The Levenberg Marquart algorithm: implementation and theory, in Proceedings of the 1977 Dundee Conference on Numerical Analysis, Lecture Notes in Mathematics 630, G. A. Watson, ed., Springer-Verlag, Berlin, 1978.

    Google Scholar 

  19. E. O. Omojokun, Trust region algorithms for optimization with nonlinear equality and inequality constraints, PhD Thesis, Department of Computer Science, University of Colorado, Boulder, CO, 1989.

    Google Scholar 

  20. J. Nocedal and M. L. Overton, Projected Hessian updating algorithms for nonlinearly constrained optimization, SIAM J. Numer. Anal., 22 (1985), pp. 821–850.

    Google Scholar 

  21. M. J. D. Powell, A hybrid method for nonlinear equations, In Numerical Methods for Nonlinear Algebraic Equations, P. Rabinowitz et al., eds., 1970, pp. 87–114.

  22. M. J. D. Powell, The convergence of variable metric methods for nonlinear constrained optimization calculations, in Nonlinear Programming 3, O. L. Mangasarian et al., eds., Academic Press, New York, 1978.

    Google Scholar 

  23. M. J. D. Powell and Y. X. Yuan, A trust region algorithm for equality constrained optimization, Math. Programming, 49 (1991), pp. 189–211.

    Google Scholar 

  24. D. C. Sorensen, Newton's method with a model trust-region modification, SIAM J. Numer. Anal., 19 (1982), pp. 406–426.

    Google Scholar 

  25. R. A. Tapia, Diagonalized multiplier methods and quasi-Newton methods for constrained optimization, J. Optim. Theory Appl., 22 (1977), pp. 135–194.

    Google Scholar 

  26. R. A. Tapia, Quasi-Newton methods for equality constrained optimization: equivalence of existing methods and a new implementation, in Nonlinear Programming 3, O. L. Mangasarian et al., eds., Academic Press, New York, 1978.

    Google Scholar 

  27. A. Vardi, A trust region algorithm for equality constrained minimization: convergence properties and implementation, SIAM J. Numer. Anal., 22 (1985), pp. 575–591.

    Google Scholar 

  28. J. Z. Zhang, D. T. Zhu, and S. Hou, Some improved two-sided projected quasi-Newton algorithems and their convergence, Part 1: method and global convergence, Acta Math. Appl. Sinica, 5 (1989), pp. 33–45.

    Google Scholar 

  29. J. Z. Zhang, D. T. Zhu and S. Hou, Some improved two-sided projected quasi-Newton algorithms and their convergence, Part 2: local convergence rate and numerical results, Acta Math. Appl. Sinica, 5 (1989), pp. 46–59.

    Google Scholar 

  30. J. Z. Zhang and D. T. Zhu, Projected quasi-Newton algorithm with trust region for constrained optimization, J. Optim. Theory Appl., 67 (1990), pp. 369–393.

    Google Scholar 

  31. J. Z. Zhang and D. T. Zhu, A trust region type dogleg method for nonlinear optimization, Optimization, 21 (1990), pp. 543–557.

    Google Scholar 

  32. J. Z. Zhang and D. T. Zhu, A projective quasi-Newton method for nonlinear optimization, J. Comput. Appl. Math., 53 (1994), pp. 291–307.

    Google Scholar 

  33. J. Z. Zhang and D. T. Zhu, A convergent secant method for constrained optimization, Japan Journal of Industrial and Applied Mathematics, 11 (1994), pp. 265–288.

    Google Scholar 

  34. J. Z. Zhang, D. T. Zhu and Y. Fan, A practical trust region method for equality constrained optimization problems, Optimization Methods and Software, 2 (1993), pp. 45–68.

    Google Scholar 

  35. J. Z. Zhang and C. X. Xu, A class of indefinite dogleg methods for unconstrained optimization, SIAM J. Optim., 9 (1999), pp. 646–667.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

About this article

Cite this article

Zhang, J., Xu, C. A Projected Indefinite Dogleg Path Method for Equality Constrained Optimization. BIT Numerical Mathematics 39, 555–578 (1999). https://doi.org/10.1023/A:1022326920990

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1023/A:1022326920990

Navigation