On local convergence of the method of alternating projections

DOI10.1007/s10208-015-9253-0zbMath1339.65079arXiv1312.5681OpenAlexW2128475913MaRDI QIDQ285438

Publication date: 19 May 2016

Published in: Foundations of Computational Mathematics, Springer Proceedings in Mathematics & Statistics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1312.5681

zbMATH Keywords

algorithm convergence numerical example nonlinear optimization Hölder regularity local convergence descent method line search subanalytic set backtracking trust-region tangential intersection Gerchberg-Saxton error reduction method of alternating projections separable intersection Kurdyka-Łojasiewicz inequality memorized steplength

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Nonlinear programming (90C30) Interior-point methods (90C51)

Related Items

Forward-backward quasi-Newton methods for nonsmooth optimization problems, Further properties of the forward-backward envelope with applications to difference-of-convex programming, Primal necessary characterizations of transversality properties, Dual sufficient characterizations of transversality properties, Linear convergence of the generalized Douglas-Rachford algorithm for feasibility problems, Implicit error bounds for Picard iterations on Hilbert spaces, Phase retrieval with one or two diffraction patterns by alternating projections with the null initialization, Local Linear Convergence of Alternating Projections in Metric Spaces with Bounded Curvature, Some new characterizations of intrinsic transversality in Hilbert spaces, Transversality in variational analysis, Set regularities and feasibility problems, Perturbation of error bounds, Geometric and metric characterizations of transversality properties, Convergence Analysis of the Proximal Gradient Method in the Presence of the Kurdyka–Łojasiewicz Property Without Global Lipschitz Assumptions, Nonnegative low rank tensor approximations with multidimensional image applications, Transversality and alternating projections for nonconvex sets, Serial and parallel approaches for image segmentation by numerical minimization of a second-order functional, An accelerated proximal algorithm for regularized nonconvex and nonsmooth bi-level optimization, Provable Phase Retrieval with Mirror Descent, Error bounds and Hölder metric subregularity, The value function approach to convergence analysis in composite optimization, A Lyapunov-type approach to convergence of the Douglas-Rachford algorithm for a nonconvex setting, About intrinsic transversality of pairs of sets, Nonlinear error bounds via a change of function, About subtransversality of collections of sets, Finding a low-rank basis in a matrix subspace, Frame completion with prescribed norms via alternating projection method, Convergence of non-smooth descent methods using the Kurdyka-Łojasiewicz inequality, A convergent relaxation of the Douglas-Rachford algorithm, On the local convergence of the Douglas-Rachford algorithm, Unnamed Item, Transversality properties: primal sufficient conditions, Necessary conditions for linear convergence of iterated expansive, set-valued mappings, Quantitative Convergence Analysis of Iterated Expansive, Set-Valued Mappings, Linear Convergence of Projection Algorithms, A note on the finite convergence of alternating projections, Extremality, stationarity and generalized separation of collections of sets, Alternating projections with applications to Gerchberg-Saxton error reduction, Local linear convergence for inexact alternating projections on nonconvex sets

Cites Work