A local convergence property of primal-dual methods for nonlinear programming (Q948957)

From MaRDI portal
Revision as of 18:33, 30 January 2024 by Import240129110113 (talk | contribs) (Added link to MaRDI item.)
scientific article
Language Label Description Also known as
English
A local convergence property of primal-dual methods for nonlinear programming
scientific article

    Statements

    A local convergence property of primal-dual methods for nonlinear programming (English)
    0 references
    0 references
    0 references
    16 October 2008
    0 references
    The authors consider a nonlinear, finite dimensional, smooth, constraint optimization problem, with general equalities and nonnegativity constraints. A standard primal-dual method for solving this problem is introduced. In each iteration the complementary condition for the inequalities is perturbed by a small parameter. During the Newton-type method it gradually is reduced to zero such that in the limit the problem solution fulfills the first order conditions of the optimization problem. Under standard nondegeneracy assumptions, a good first guess, a suitable line-search that guarantees strict feasibility the authors prove that the iterates converge to the optimum with the same rate as the penalty parameter converges to zero. However, to guarantee the iterates to be asymptotically tangent to the central trajectory, the convergence rate of the small parameter must not be faster than superlinear as shown by a simple counter example.
    0 references
    local convergence
    0 references
    primal-dual method
    0 references
    constrained nonlinear programming
    0 references
    interior point method
    0 references
    penalty parameter
    0 references
    numerical example
    0 references
    Newton-type method
    0 references
    convergence
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references