On the centralization of the circumcentered-reflection method

DOI10.1007/s10107-023-01978-warXiv2111.07022OpenAlexW3211799454MaRDI QIDQ6126653

Luiz-Rafael Santos, Yunier Y. Bello Cruz, Alfredo Noel Iusem, Roger Behling

Publication date: 9 April 2024

Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)

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

zbMATH Keywords

projection methodsconvex feasibility problemcircumcentered-reflection method

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Convex programming (90C25) Decomposition methods (49M27) Acceleration of convergence in numerical analysis (65B99)

Related Items (1)

A successive centralized circumcentered-reflection method for the convex feasibility problem

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Comparison of several fast algorithms for projection onto an ellipsoid
• A note on alternating projections for ill-posed semidefinite feasibility problems
• Levenberg--Marquardt methods with strong local convergence properties for solving nonlinear equations with convex constraints
• Transversality and alternating projections for nonconvex sets
• Applications of second-order cone programming
• On the convergence of von Neumann's alternating projection algorithm for two sets
• Second-order cone programming
• Circumcentering the Douglas-Rachford method
• About intrinsic transversality of pairs of sets
• The effect of calmness on the solution set of systems of nonlinear equations
• On the linear convergence of circumcentered isometry methods
• Circumcentered methods induced by isometries
• The circumcentered-reflection method achieves better rates than alternating projections
• Best approximation mappings in Hilbert spaces
• Circumcentering approximate reflections for solving the convex feasibility problem
• Circumcentering reflection methods for nonconvex feasibility problems
• The Douglas-Rachford algorithm for convex and nonconvex feasibility problems
• The block-wise circumcentered-reflection method
• The rate of linear convergence of the Douglas-Rachford algorithm for subspaces is the cosine of the Friedrichs angle
• Solving second-order conic systems with variable precision
• On the linear convergence of the circumcentered-reflection method
• On the circumcentered-reflection method for the convex feasibility problem
• Bregman circumcenters: basic theory
• Bregman circumcenters: monotonicity and forward weak convergence
• Julia: A Fresh Approach to Numerical Computing
• On the Numerical Solution of Heat Conduction Problems in Two and Three Space Variables
• Decomposition through formalization in a product space
• Generalized equations and their solutions, part II: Applications to nonlinear programming
• Stability Theory for Systems of Inequalities, Part II: Differentiable Nonlinear Systems
• A Class of Methods for Projection on the Intersection of Several Ellipsoids
• On Projection Algorithms for Solving Convex Feasibility Problems
• Iterative Solution of Nonlinear Equations in Several Variables
• SURVEY: SIXTY YEARS OF DOUGLAS–RACHFORD
• Infeasibility and Error Bound Imply Finite Convergence of Alternating Projections
• On circumcenters of finite sets in Hilbert spaces
• On circumcenter mappings induced by nonexpansive operators
• Convex analysis and monotone operator theory in Hilbert spaces
• Benchmarking optimization software with performance profiles.
• Circumcentric directions of cones
• Computable centering methods for spiraling algorithms and their duals, with motivations from the theory of Lyapunov functions

This page was built for publication: On the centralization of the circumcentered-reflection method