A Quadratically Convergent Alternating Projection Method for Nonconvex Sets

Abstract

In this paper, we consider the feasibility problem, which aims to find a feasible point for the constraint set \x ∈ Rn: c(x) = 0\ over a possibly non-regular subset X ⊂ Rn. Under the constraint nondegeneracy condition, we propose a modified alternating projection method. In our proposed method, based on the concept of projective mapping for X, we alternate a Newton step for finding an inexact solution within the limiting tangent cone of X and a projection to X. Under mild conditions, we prove the local quadratic convergence of our proposed method. Preliminary numerical experiments demonstrate the high efficiency of our proposed alternating projection method.

0

Turn this paper into a full lesson

ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…