Related papers: Restricted normal cones and the method of alternat…

We develop and analyze an inexact regularized alternating projection method for nonconvex feasibility problems. Such a method employs inexact projections on one of the two sets, according to a set of well-defined conditions. We prove the…

This paper is about line search for the generalized alternating projections (GAP) method. This method is a generalization of the von Neumann alternating projections method, where instead of performing alternating projections, relaxed…

The method of alternating projections involves orthogonally projecting an element of a Hilbert space onto a collection of closed subspaces. It is known that the resulting sequence always converges in norm if the projections are taken…

This paper investigates regularity properties of two non-negative sparsity sets: non-negative sparse vectors, and low-rank positive semi-definite matrices. Novel formulae for their Mordukhovich normal cones are given and used to formulate…

Alternating projections and their variants are classical tools for computing points in intersections of sets. Existing analyses for smooth manifolds mainly focus on local convergence rates under transversality or related regularity…

The problem of finding a vector with the fewest nonzero elements that satisfies an underdetermined system of linear equations is an NP-complete problem that is typically solved numerically via convex heuristics or nicely-behaved nonconvex…

Alternating projection method has been used in a wide range of engineering applications since it is a gradient-free method (without requiring tuning the step size) and usually has fast speed of convergence. In this paper, we formalize two…

Convergence of projection-based methods for nonconvex set feasibility problems has been established for sets with ever weaker regularity assumptions. What has not kept pace with these developments is analogous results for convergence of…

This paper develops a uniformly valid and asymptotically nonconservative test based on projection for a class of shape restrictions. The key insight we exploit is that these restrictions form convex cones, a simple and yet elegant structure…

A new and extensive formalism is developed for monads and galaxies in non-standard enlargements. It is shown that monads and galaxies can be manipulated using order-preserving and order-reversing set-to-set maps, and that set properties…

In this paper, we extend the previous convergence results for the generalized alternating projection method applied to subspaces in [arXiv:1703.10547] to hold also for smooth manifolds. We show that the algorithm locally behaves similarly…

We derive analytic formulas for the alternating projection method applied to the cone $\mathbb{S}^n_+$ of positive semidefinite matrices and an affine subspace. More precisely, we find recursive relations on parameters representing a…

We present necessary conditions for monotonicity, in one form or another, of fixed point iterations of mappings that violate the usual nonexpansive property. We show that most reasonable notions of linear-type monotonicity of fixed point…

We derive a closed-form expression for the projection onto a capped rotated second-order cone -- a convex set that arises in perspective relaxations of nonlinear programs with binary indicator variables. The closed-form solution involves…

We consider the problem of projecting a convex set onto a subspace, or equivalently formulated, the problem of computing a set obtained by applying a linear mapping to a convex feasible set. This includes the problem of approximating convex…

This study focuses on defining normal and strictly convex structures within Menger cone PM-space. It also presents a shared fixed point theorem for the existence of two self-mappings constructed on a strictly convex probabilistic cone…

We prove global convergence of classical projection algorithms for feasibility problems involving union convex sets, which refer to sets expressible as the union of a finite number of closed convex sets. We present a unified strategy for…

In the setting of CAT(k) spaces, common fixed point iterations built from prox mappings (e.g. prox-prox, Krasnoselsky-Mann relaxations, nonlinear projected-gradients) converge locally linearly under the assumption of linear metric…

The numerical properties of algorithms for finding the intersection of sets depend to some extent on the regularity of the sets, but even more importantly on the regularity of the intersection. The alternating projection algorithm of von…

A geometric nonconvex conic optimization problem (COP) was recently proposed by Kim, Kojima and Toh as a unified framework for convex conic reformulation of a class of quadratic optimization problems and polynomial optimization problems.…