Reflection Methods for Inverse Problems with Applications to Protein Conformation Determination
From MaRDI portal
Publication:4557875
DOI10.1007/978-981-10-4774-9_5zbMath1403.49012arXiv1408.4213OpenAlexW279846129MaRDI QIDQ4557875
Matthew K. Tam, Jonathan M. Borwein
Publication date: 27 November 2018
Published in: Forum for Interdisciplinary Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1408.4213
Set-valued and variational analysis (49J53) Protein sequences, DNA sequences (92D20) Inverse problems in optimal control (49N45)
Related Items
Dynamics of the Douglas-Rachford method for ellipses and \(p\)-spheres, Circumcentering reflection methods for nonconvex feasibility problems, Multiple-sets split quasi-convex feasibility problems: Adaptive subgradient methods with convergence guarantee, The Douglas-Rachford algorithm for convex and nonconvex feasibility problems, Constraint reduction reformulations for projection algorithms with applications to wavelet construction, SURVEY: SIXTY YEARS OF DOUGLAS–RACHFORD, Solving Nonconvex Feasibility Problem on a Sphere and a Closed Ball by Douglas–Rachford Algorithm
Cites Work
- Unnamed Item
- Linear and strong convergence of algorithms involving averaged nonexpansive operators
- Iterative methods for fixed point problems in Hilbert spaces
- Recent results on Douglas-Rachford methods for combinatorial optimization problems
- Finding best approximation pairs relative to two closed convex sets in Hilbert spaces
- Convex analysis and nonlinear optimization. Theory and examples.
- Equality relating Euclidean distance cone to positive semidefinite cone
- Approximation by matrices positive semidefinite on a subspace
- A cyclic Douglas-Rachford iteration scheme
- The rate of linear convergence of the Douglas-Rachford algorithm for subspaces is the cosine of the Friedrichs angle
- Global convergence of a non-convex Douglas-Rachford iteration
- Techniques of variational analysis
- The Douglas–Rachford Algorithm in the Absence of Convexity
- DOUGLAS–RACHFORD FEASIBILITY METHODS FOR MATRIX COMPLETION PROBLEMS
- The Cyclic Douglas-Rachford Method for Inconsistent Feasibility Problems
- Searching with iterated maps
- Nonconvex Notions of Regularity and Convergence of Fundamental Algorithms for Feasibility Problems
- Convex analysis and monotone operator theory in Hilbert spaces