Nonconvex Notions of Regularity and Convergence of Fundamental Algorithms for Feasibility Problems
From MaRDI portal
Publication:5408225
DOI10.1137/120902653zbMath1288.65094arXiv1212.3349OpenAlexW2171505904MaRDI QIDQ5408225
Publication date: 9 April 2014
Published in: SIAM Journal on Optimization (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1212.3349
normal conelinear convergenceconvex setstrong regularityconstraint qualificationmetric regularityprojection operatormethod of alternating projectionsDouglas-Rachford algorithmnonexpansivenonconvex setsuperregularityfirmly nonexpansivereflection operatorlinear regularityFejér monotoneaveraged alternating reflectionsquasi nonexpansive
Numerical mathematical programming methods (65K05) Nonconvex programming, global optimization (90C26) Nonlinear programming (90C30) Numerical optimization and variational techniques (65K10) Nonsmooth analysis (49J52) Numerical methods based on nonlinear programming (49M37) Numerical methods of relaxation type (49M20)
Related Items (80)
On the order of the operators in the Douglas-Rachford algorithm ⋮ On the Douglas-Rachford algorithm ⋮ On local convergence of the method of alternating projections ⋮ Primal necessary characterizations of transversality properties ⋮ Global behavior of the Douglas-Rachford method for a nonconvex feasibility problem ⋮ On Slater's condition and finite convergence of the Douglas-Rachford algorithm for solving convex feasibility problems in Euclidean spaces ⋮ Linear convergence of the generalized Douglas-Rachford algorithm for feasibility problems ⋮ Eventual linear convergence of the Douglas-Rachford iteration for basis pursuit ⋮ Douglas-Rachford splitting and ADMM for nonconvex optimization: accelerated and Newton-type linesearch algorithms ⋮ Optimal rates of linear convergence of relaxed alternating projections and generalized Douglas-Rachford methods for two subspaces ⋮ Douglas-Rachford splitting for nonconvex optimization with application to nonconvex feasibility problems ⋮ Convergence rates with inexact non-expansive operators ⋮ Testable uniqueness conditions for empirical assessment of undersampling levels in total variation-regularized X-ray CT ⋮ Local Linear Convergence of the ADMM/Douglas--Rachford Algorithms without Strong Convexity and Application to Statistical Imaging ⋮ A Parallel Douglas–Rachford Algorithm for Minimizing ROF-like Functionals on Images with Values in Symmetric Hadamard Manifolds ⋮ Circumcentering the Douglas-Rachford method ⋮ Reflection Methods for Inverse Problems with Applications to Protein Conformation Determination ⋮ A remark on the convergence of the Douglas-Rachford iteration in a non-convex setting ⋮ Solving graph coloring problems with the Douglas-Rachford algorithm ⋮ DOUGLAS–RACHFORD FEASIBILITY METHODS FOR MATRIX COMPLETION PROBLEMS ⋮ Local convergence properties of Douglas-Rachford and alternating direction method of multipliers ⋮ Characterizations of stability of error bounds for convex inequality constraint systems ⋮ Some new characterizations of intrinsic transversality in Hilbert spaces ⋮ Transversality in variational analysis ⋮ An enhanced formulation for solving graph coloring problems with the Douglas-Rachford algorithm ⋮ A splitting method for finding the resolvent of the sum of two maximal monotone operators ⋮ Set regularities and feasibility problems ⋮ Perturbation of error bounds ⋮ Tight global linear convergence rate bounds for Douglas-Rachford splitting ⋮ Finding stationary points on bounded-rank matrices: a geometric hurdle and a smooth remedy ⋮ Peaceman-Rachford splitting for a class of nonconvex optimization problems ⋮ The Douglas-Rachford algorithm for convex and nonconvex feasibility problems ⋮ Convergence Rate Analysis for Averaged Fixed Point Iterations in Common Fixed Point Problems ⋮ The block-wise circumcentered-reflection method ⋮ Transversality and alternating projections for nonconvex sets ⋮ A weakly convergent fully inexact Douglas-Rachford method with relative error tolerance ⋮ A continuous dynamical splitting method for solving ‘strongly+weakly’ convex programming problems ⋮ Regularity of sets under a reformulation in a product space with reduced dimension ⋮ Provable Phase Retrieval with Mirror Descent ⋮ Subgradient projectors: extensions, theory, and characterizations ⋮ Unnamed Item ⋮ Recent results on Douglas-Rachford methods for combinatorial optimization problems ⋮ A Lyapunov function construction for a non-convex Douglas-Rachford iteration ⋮ Activity Identification and Local Linear Convergence of Douglas–Rachford/ADMM under Partial Smoothness ⋮ About \([q\)-regularity properties of collections of sets] ⋮ A Lyapunov-type approach to convergence of the Douglas-Rachford algorithm for a nonconvex setting ⋮ About intrinsic transversality of pairs of sets ⋮ A parameterized Douglas-Rachford splitting algorithm for nonconvex optimization ⋮ About subtransversality of collections of sets ⋮ A new projection method for finding the closest point in the intersection of convex sets ⋮ A cyclic Douglas-Rachford iteration scheme ⋮ The rate of linear convergence of the Douglas-Rachford algorithm for subspaces is the cosine of the Friedrichs angle ⋮ On the Finite Convergence of the Douglas--Rachford Algorithm for Solving (Not Necessarily Convex) Feasibility Problems in Euclidean Spaces ⋮ Quantitative characterizations of regularity properties of collections of sets ⋮ Douglas-Rachford splitting for the sum of a Lipschitz continuous and a strongly monotone operator ⋮ A convergent relaxation of the Douglas-Rachford algorithm ⋮ Linear convergence of the Douglas–Rachford method for two closed sets ⋮ Convex combination of alternating projection and Douglas-Rachford operators for phase retrieval ⋮ On the local convergence of the Douglas-Rachford algorithm ⋮ The Douglas--Rachford Algorithm for Two (Not Necessarily Intersecting) Affine Subspaces ⋮ Douglas--Rachford Splitting and ADMM for Nonconvex Optimization: Tight Convergence Results ⋮ Transversality properties: primal sufficient conditions ⋮ Necessary conditions for linear convergence of iterated expansive, set-valued mappings ⋮ REGULARITY PROPERTIES IN VARIATIONAL ANALYSIS AND APPLICATIONS IN OPTIMISATION ⋮ Convergence Analysis of the Relaxed Douglas--Rachford Algorithm ⋮ Ergodic behaviour of a Douglas-Rachford operator away from the origin ⋮ Quantitative Convergence Analysis of Iterated Expansive, Set-Valued Mappings ⋮ Nonconvex Lagrangian-Based Optimization: Monitoring Schemes and Global Convergence ⋮ Linear Convergence of Projection Algorithms ⋮ Norm convergence of realistic projection and reflection methods ⋮ Extremality, stationarity and generalized separation of collections of sets ⋮ Alternating projections with applications to Gerchberg-Saxton error reduction ⋮ Blind Ptychographic Phase Retrieval via Convergent Alternating Direction Method of Multipliers ⋮ SURVEY: SIXTY YEARS OF DOUGLAS–RACHFORD ⋮ Adaptive Douglas--Rachford Splitting Algorithm for the Sum of Two Operators ⋮ Projection methods for high numerical aperture phase retrieval ⋮ Optimization on Spheres: Models and Proximal Algorithms with Computational Performance Comparisons ⋮ Toward a Mathematical Theory of the Crystallographic Phase Retrieval Problem ⋮ Phase Retrieval with Sparse Phase Constraint ⋮ Convergence Analysis of Douglas--Rachford Splitting Method for “Strongly + Weakly” Convex Programming
This page was built for publication: Nonconvex Notions of Regularity and Convergence of Fundamental Algorithms for Feasibility Problems
