A globally convergent Lagrangian barrier algorithm for optimization with general inequality constraints and simple bounds

A.R. Conn, N. Gould, Ph. Toint

    Research output: Contribution to journalArticlepeer-review

    78 Downloads (Pure)

    Abstract

    We consider the global and local convergence properties of a class of Lagrangian barrier methods for solving nonlinear programming problems. In such methods, simple bound constraints may be treated separately from more general constraints. The objective and general constraint functions are combined in a Lagrangian barrier function. A sequence of such functions are approximately minimized within the domain defined by the simple bounds. Global convergence of the sequence of generated iterates to a first-order stationary point for the original problem is established. Furthermore, possible numerical difficulties associated with barrier function methods are avoided as it is shown that a potentially troublesome penalty parameter is bounded away from zero. This paper is a companion to previous work of ours on augmented Lagrangian methods.
    Original languageEnglish
    Pages (from-to)261-288
    Number of pages28
    JournalMathematics Of Computation
    Volume66
    Publication statusPublished - 1 Jan 1997

    Fingerprint Dive into the research topics of 'A globally convergent Lagrangian barrier algorithm for optimization with general inequality constraints and simple bounds'. Together they form a unique fingerprint.

    Cite this