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

Andy Conn; Nick Gould; Dominique Orban; Philippe Toint

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

Andy Conn, Nick Gould, Dominique Orban, Philippe Toint

Research output: Contribution to journal › Article › peer-review

96 Downloads (Pure)

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.

Original language	English
Pages (from-to)	215-249
Number of pages	35
Journal	Mathematical Programming
Volume	87
Issue number	2
Publication status	Published - 1 Apr 2000

Access to Document

Technical ReportSubmitted manuscript, 270 KB

Cite this

@article{b8b3162996904868bb2facf00f552e69,

title = "A primal-dual trust-region algorithm for non-convex nonlinear programming",

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.",

author = "Andy Conn and Nick Gould and Dominique Orban and Philippe Toint",

year = "2000",

month = apr,

day = "1",

language = "English",

volume = "87",

pages = "215--249",

journal = "Mathematical Programming",

issn = "0025-5610",

publisher = "Springer-Verlag GmbH and Co. KG",

number = "2",

}

TY - JOUR

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

AU - Conn, Andy

AU - Gould, Nick

AU - Orban, Dominique

AU - Toint, Philippe

PY - 2000/4/1

Y1 - 2000/4/1

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

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

UR - http://www.scopus.com/inward/record.url?scp=0000317378&partnerID=8YFLogxK

M3 - Article

AN - SCOPUS:0000317378

SN - 0025-5610

VL - 87

SP - 215

EP - 249

JO - Mathematical Programming

JF - Mathematical Programming

IS - 2

ER -

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

Abstract

Access to Document

Other files and links

Fingerprint

ADALGOPT: ADALGOPT - Advanced algorithms in nonlinear optimization

Interior point algorithms

Cite this

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

Abstract

Access to Document

Other files and links

Fingerprint

Projects

ADALGOPT: ADALGOPT - Advanced algorithms in nonlinear optimization

Interior point algorithms

Cite this