A primal-dual trust-region algorithm for non-convex nonlinear programming

  title={A primal-dual trust-region algorithm for non-convex nonlinear programming},
  author={Andrew R. Conn and Nicholas I. M. Gould and Dominique Orban and Philippe L. Toint},
  journal={Math. Program.},
A new primal-dual algorithm is proposed for the minimization of non-convex objective functions subject to general inequality and linear equality constraints. The method uses a primal-dual trust-region model to ensure descent on a suitable merit function. Convergence is proved to second-order critical points from arbitrary starting points. Numerical results are presented for general quadratic programs. 
Highly Cited
This paper has 67 citations. REVIEW CITATIONS


Publications citing this paper.
Showing 1-10 of 37 extracted citations

68 Citations

Citations per Year
Semantic Scholar estimates that this publication has 68 citations based on the available data.

See our FAQ for additional information.


Publications referenced by this paper.
Showing 1-10 of 19 references

Implementation of interior point methods for large scale linear programming

  • E. D. Andersen, J. Gondzio, C. Mészáros, X. Xu
  • Interior Point Methods in Mathematical…
  • 1996
Highly Influential
5 Excerpts

Numerical stability and efficiency of penalty algorithms

  • J. P. Dussault
  • SIAM J. Numer. Anal
  • 1995
Highly Influential
4 Excerpts

Interior methods for constrained optimization

  • M. H. Wright
  • Acta Numer
  • 1992
Highly Influential
7 Excerpts

An algorithm for large-scale quadratic programming

  • N.I.M. Gould
  • IMA J. Numer. Anal
  • 1991
Highly Influential
5 Excerpts

A note on the second-order convergence of optimization algorithms using barrier functions

  • N.I.M. Gould, Toint, Ph.L
  • Math. Program
  • 1999
Highly Influential
5 Excerpts

Similar Papers

Loading similar papers…