Computable centering methods for spiraling algorithms and their duals, with motivations from the theory of Lyapunov functions

DOI10.1007/s10589-022-00413-8zbMath1518.90077arXiv2001.10784OpenAlexW3003347710MaRDI QIDQ6043138

Scott B. Lindstrom

Publication date: 4 May 2023

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

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

zbMATH Keywords

ADMMiterative methodsLyapunov functionsdiscrete dynamical systemsprojection methodscircumcenterDouglas-Rachfordcircumcentered-reflection methodreflection methodsprimal/dual

Mathematics Subject Classification ID

Nonconvex programming, global optimization (90C26) Nonlinear operators and their properties (47H99) Numerical aspects of recurrence relations (65Q30)

Related Items

On the centralization of the circumcentered-reflection method, A successive centralized circumcentered-reflection method for the convex feasibility problem

Cites Work

• Unnamed Item
• Unnamed Item
• Distributed Optimization and Statistical Learning via the Alternating Direction Method of Multipliers
• On the order of the operators in the Douglas-Rachford algorithm
• Douglas-Rachford splitting for nonconvex optimization with application to nonconvex feasibility problems
• A Lyapunov-type approach to convergence of the Douglas-Rachford algorithm for a nonconvex setting
• The Douglas-Rachford algorithm for the case of the sphere and the line
• Convex analysis and nonlinear optimization. Theory and examples.
• Circumcentering the Douglas-Rachford method
• Dynamics of the Douglas-Rachford method for ellipses and \(p\)-spheres
• A Lyapunov function construction for a non-convex Douglas-Rachford iteration
• The circumcentered-reflection method achieves better rates than alternating projections
• Circumcentering reflection methods for nonconvex feasibility problems
• The Douglas-Rachford algorithm for convex and nonconvex feasibility problems
• The rate of linear convergence of the Douglas-Rachford algorithm for subspaces is the cosine of the Friedrichs angle
• On the linear convergence of the circumcentered-reflection method
• The Douglas-Rachford algorithm for a hyperplane and a doubleton
• Global convergence of a non-convex Douglas-Rachford iteration
• On the circumcentered-reflection method for the convex feasibility problem
• The Douglas–Rachford Algorithm in the Absence of Convexity
• APPLICATION OF PROJECTION ALGORITHMS TO DIFFERENTIAL EQUATIONS: BOUNDARY VALUE PROBLEMS
• Splitting Algorithms for the Sum of Two Nonlinear Operators
• Variational Analysis
• SURVEY: SIXTY YEARS OF DOUGLAS–RACHFORD
• Improving “Fast Iterative Shrinkage-Thresholding Algorithm”: Faster, Smarter, and Greedier
• On circumcenters of finite sets in Hilbert spaces
• On circumcenter mappings induced by nonexpansive operators
• On the Robustness of $\mathcalKL$-stability for Difference Inclusions: Smooth Discrete-Time Lyapunov Functions
• Convex analysis and monotone operator theory in Hilbert spaces