On the minimal displacement vector of the Douglas-Rachford operator

DOI10.1016/j.orl.2021.01.003OpenAlexW3081581145WikidataQ120716987 ScholiaQ120716987MaRDI QIDQ2661617

Goran Banjac

Publication date: 7 April 2021

Published in: Operations Research Letters (Search for Journal in Brave)

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

zbMATH Keywords

convex optimizationDouglas-Rachford algorithmminimal displacement vectorinfeasibility detection

Mathematics Subject Classification ID

Operations research, mathematical programming (90-XX)

Related Items (2)

Infeasibility Detection with Primal-Dual Hybrid Gradient for Large-Scale Linear Programming ⋮ Operator Splitting for a Homogeneous Embedding of the Linear Complementarity Problem

Cites Work

• Unnamed Item
• Distributed Optimization and Statistical Learning via the Alternating Direction Method of Multipliers
• Finding best approximation pairs relative to two closed convex sets in Hilbert spaces
• The Douglas-Rachford algorithm in the affine-convex case
• Infeasibility detection in the alternating direction method of multipliers for convex optimization
• Douglas-Rachford splitting and ADMM for pathological convex optimization
• On the Douglas-Rachford algorithm
• Asymptotic behavior of contractions in Hilbert space
• The Douglas--Rachford Algorithm for Two (Not Necessarily Intersecting) Affine Subspaces
• On the Range of the Douglas–Rachford Operator
• Splitting Algorithms for the Sum of Two Nonlinear Operators
• Norm-closure of the barrier cone in normed linear spaces
• On the Behavior of the Douglas--Rachford Algorithm for Minimizing a Convex Function Subject to a Linear Constraint
• Convex analysis and monotone operator theory in Hilbert spaces

This page was built for publication: On the minimal displacement vector of the Douglas-Rachford operator