Skip to main content

Advertisement

Log in

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

  • Published:
Mathematical Programming Submit manuscript

Abstract.

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.

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.

Institutional subscriptions

Similar content being viewed by others

Author information

Authors and Affiliations

Authors

Additional information

Received: July 19, 1999 / Accepted: February 1, 2000¶Published online March 15, 2000

Rights and permissions

Reprints and permissions

About this article

Cite this article

Conn, A., Gould, N., Orban, D. et al. A primal-dual trust-region algorithm for non-convex nonlinear programming. Math. Program. 87, 215–249 (2000). https://doi.org/10.1007/s101070050112

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1007/s101070050112

Keywords

Navigation