DocServer

Global Behavior of the Douglas–Rachford Method for a Nonconvex Feasibility Problem

Aragón Artacho, Francisco J. and Borwein, Jonathan M. and Tam, Matthew K (2015) Global Behavior of the Douglas–Rachford Method for a Nonconvex Feasibility Problem. J. Global Optimization . (In Press)

[img] PDF
Download (315Kb)

    Abstract

    In recent times the Douglas–Rachford algorithm has been observed empirically to solve a variety of nonconvex feasibility problems including those of a combinatorial nature. For many of these problems current theory is not sufficient to explain this observed success and is mainly concerned with questions of local convergence. In this paper we analyze global behavior of the method for finding a point in the intersection of a half-space and a potentially non-convex set which is assumed to satisfy a property weaker than compactness. The special case in which the second set is finite provides a prototypical setting for combinatorial optimization problems.

    Item Type: Article
    Subjects: UNSPECIFIED
    Faculty: UNSPECIFIED
    Depositing User: Mrs Naghmana Tehseen
    Date Deposited: 28 Mar 2016 13:11
    Last Modified: 28 Mar 2016 13:11
    URI: https://docserver.carma.newcastle.edu.au/id/eprint/1701

    Actions (login required)

    View Item