A new projection method for finding the closest point in the intersection of convex sets

DOI10.1007/s10589-017-9942-5zbMath1464.47035arXiv1605.07421OpenAlexW3102480021MaRDI QIDQ683336

Rubén Campoy, Francisco J. Aragón Artacho

Publication date: 6 February 2018

Published in: Computational Optimization and Applications (Search for Journal in Brave)

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

zbMATH Keywords

strong convergencereflectionprojectionconvex setDouglas-Rachford algorithmbest approximation problem

Mathematics Subject Classification ID

Convex programming (90C25) Iterative procedures involving nonlinear operators (47J25) Contraction-type mappings, nonexpansive mappings, (A)-proper mappings, etc. (47H09) Applications of operator theory in optimization, convex analysis, mathematical programming, economics (47N10)

Related Items (18)

String-averaging methods for best approximation to common fixed point sets of operators: the finite and infinite cases ⋮ A product space reformulation with reduced dimension for splitting algorithms ⋮ A splitting method for finding the resolvent of the sum of two maximal monotone operators ⋮ Closed-Form Expressions for Projectors onto Polyhedral Sets in Hilbert Spaces ⋮ A parameterized Douglas-Rachford algorithm ⋮ The Douglas-Rachford algorithm for convex and nonconvex feasibility problems ⋮ Computing the resolvent of the sum of maximally monotone operators with the averaged alternating modified reflections algorithm ⋮ Deep neural network structures solving variational inequalities ⋮ Douglas–Rachford algorithm for control-constrained minimum-energy control problems ⋮ The cyclic Douglas–Rachford algorithm with r-sets-Douglas–Rachford operators ⋮ Comparing Averaged Relaxed Cutters and Projection Methods: Theory and Examples ⋮ Strengthened splitting methods for computing resolvents ⋮ A parameterized Douglas-Rachford splitting algorithm for nonconvex optimization ⋮ Optimal rates of linear convergence of the averaged alternating modified reflections method for two subspaces ⋮ On the asymptotic behaviour of the Aragón Artacho-Campoy algorithm ⋮ Iterative methods for computing the resolvent of the sum of a maximal monotone operator and composite operator with applications ⋮ SURVEY: SIXTY YEARS OF DOUGLAS–RACHFORD ⋮ The superiorization method with restarted perturbations for split minimization problems with an application to radiotherapy treatment planning

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Global behavior of the Douglas-Rachford method for a nonconvex feasibility problem
• A modular string averaging procedure for solving the common fixed point problem for quasi-nonexpansive mappings in Hilbert space
• Iterative methods for fixed point problems in Hilbert spaces
• Recent results on Douglas-Rachford methods for combinatorial optimization problems
• The Douglas-Rachford algorithm for the case of the sphere and the line
• Local linear convergence for alternating and averaged nonconvex projections
• Constrained best approximation in Hilbert space. II
• On the convergence of von Neumann's alternating projection algorithm for two sets
• Dykstra's alternating projection algorithm for two sets
• The rate of convergence for the method of alternating projections. II
• A dual approach to constrained interpolation from a convex subset of Hilbert space
• Projection and proximal point methods: Convergence results and counterexamples.
• Constrained best approximation in Hilbert space
• An alternating projection that does not converge in norm
• The approximation of fixed points of compositions of nonexpansive mappings in Hilbert space
• The rate of linear convergence of the Douglas-Rachford algorithm for subspaces is the cosine of the Friedrichs angle
• On the Douglas-Rachford algorithm
• Set regularities and feasibility problems
• Global convergence of a non-convex Douglas-Rachford iteration
• A strongly convergent reflection method for finding the projection onto the intersection of two closed convex sets in a Hilbert space
• On the local convergence of the Douglas-Rachford algorithm
• Asymptotic behavior of contractions in Hilbert space
• Linear convergence of the Douglas–Rachford method for two closed sets
• The Douglas–Rachford Algorithm in the Absence of Convexity
• DOUGLAS–RACHFORD FEASIBILITY METHODS FOR MATRIX COMPLETION PROBLEMS
• Projection Methods: Swiss Army Knives for Solving Feasibility and Best Approximation Problems with Halfspaces
• On Weak Convergence of the Douglas–Rachford Method
• On the Numerical Solution of Heat Conduction Problems in Two and Three Space Variables
• An Algorithm for Restricted Least Squares Regression
• Projection methods: an annotated bibliography of books and reviews
• Decomposition through formalization in a product space
• Splitting Algorithms for the Sum of Two Nonlinear Operators
• A simple closure condition for the normal cone intersection formula
• Analysis of the Convergence Rate for the Cyclic Projection Algorithm Applied to Basic Semialgebraic Convex Sets
• Alternating Projections on Manifolds
• Nonconvex Notions of Regularity and Convergence of Fundamental Algorithms for Feasibility Problems
• Fixed points of nonexpanding maps
• Convex Analysis
• A Weak-to-Strong Convergence Principle for Fejér-Monotone Methods in Hilbert Spaces
• Theory of Reproducing Kernels
• Functional Operators (AM-22), Volume 2
• Convex analysis and monotone operator theory in Hilbert spaces
• Best approximation in inner product spaces

This page was built for publication: A new projection method for finding the closest point in the intersection of convex sets