Regularity of sets under a reformulation in a product space with reduced dimension
From MaRDI portal
Publication:6141904
DOI10.1007/s11228-023-00702-2arXiv2303.13146OpenAlexW4388826986MaRDI QIDQ6141904
Publication date: 23 January 2024
Published in: Set-Valued and Variational Analysis (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2303.13146
regularitylinear convergenceprojection methodsnonconvexfeasibility problemproduct space reformulationsuper-regular set
Nonlinear programming (90C30) Numerical optimization and variational techniques (65K10) Monotone operators and generalizations (47H05) Iterative procedures involving nonlinear operators (47J25) Decomposition methods (49M27)
Cites Work
- Unnamed Item
- Restricted normal cones and the method of alternating projections: theory
- Linear and strong convergence of algorithms involving averaged nonexpansive operators
- The method of alternating relaxed projections for two nonconvex sets
- Local linear convergence for alternating and averaged nonconvex projections
- Linear convergence of the generalized Douglas-Rachford algorithm for feasibility problems
- Constraint reduction reformulations for projection algorithms with applications to wavelet construction
- A product space reformulation with reduced dimension for splitting algorithms
- The Douglas-Rachford algorithm for convex and nonconvex feasibility problems
- Uniqueness of DRS as the 2 operator resolvent-splitting and impossibility of 3 operator resolvent-splitting
- A cyclic Douglas-Rachford iteration scheme
- Set regularities and feasibility problems
- About regularity of collections of sets
- A primal-dual splitting algorithm for composite monotone inclusions with minimal lifting
- Linear convergence of the Douglas–Rachford method for two closed sets
- On the Numerical Solution of Heat Conduction Problems in Two and Three Space Variables
- Decomposition through formalization in a product space
- Splitting Algorithms for the Sum of Two Nonlinear Operators
- Linear Convergence of Projection Algorithms
- Nonconvex Notions of Regularity and Convergence of Fundamental Algorithms for Feasibility Problems
- Functional Operators (AM-22), Volume 2
- Convex analysis and monotone operator theory in Hilbert spaces
- Best approximation in inner product spaces
- Distributed forward-backward methods for ring networks
- The Splitting Algorithms by Ryu, by Malitsky–Tam, and by Campoy Applied to Normal Cones of Linear Subspaces Converge Strongly to the Projection onto the Intersection
- Resolvent splitting for sums of monotone operators with minimal lifting
This page was built for publication: Regularity of sets under a reformulation in a product space with reduced dimension