Reflection Methods for Inverse Problems with Applications to Protein Conformation Determination

DOI10.1007/978-981-10-4774-9_5MaRDI QIDQ4557875zbMATH OpenOpenAlexFDO

Authors Jonathan M. Borwein, Matthew K. Tam

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

zbMATH Keywords

inverse problemsprotein conformationreflection methods

Mathematics Subject Classification ID

Set-valued and variational analysis (49J53) Inverse problems in optimal control (49N45) Protein sequences, DNA sequences (92D20)

Abstract: The Douglas-Rachford reflection method is a general purpose algorithm useful for solving the feasibility problem of finding a point in the intersection of finitely many sets. In this chapter we demonstrate that applied to a specific problem, the method can benefit from heuristics specific to said problem which exploit its special structure. In particular, we focus on the problem of protein conformation determination formulated within the framework of matrix completion, as was considered in a recent paper of the present authors.

Recommendations

• scientific article; zbMATH DE number 5209808
• Inverse problems: methods and applications
• Mathematical aspects of protein structure determination with NMR orientational restraints
• scientific article; zbMATH DE number 3926643
• Numerical Methods for Reflection Inverse Problems: Convergence and Nonimpulsive Sources
• Computational Methods for Inverse Problems
• Inverse problems of single molecule localization microscopy
• Methods of solving inverse problems
• An inverse problem for an immobilized enzyme model

Cites work

• A cyclic Douglas-Rachford iteration scheme
• Approximation by matrices positive semidefinite on a subspace
• Convex analysis and monotone operator theory in Hilbert spaces
• Convex analysis and nonlinear optimization. Theory and examples.
• Douglas-Rachford feasibility methods for matrix completion problems
• Equality relating Euclidean distance cone to positive semidefinite cone
• Finding best approximation pairs relative to two closed convex sets in Hilbert spaces
• Global convergence of a non-convex Douglas-Rachford iteration
• scientific article; zbMATH DE number 1933860 (Why is no real title available?)
• Iterative methods for fixed point problems in Hilbert spaces
• Linear and strong convergence of algorithms involving averaged nonexpansive operators
• Nonconvex notions of regularity and convergence of fundamental algorithms for feasibility problems
• Recent results on Douglas-Rachford methods for combinatorial optimization problems
• Searching with iterated maps
• Techniques of variational analysis
• The cyclic Douglas-Rachford method for inconsistent feasibility problems
• The Douglas-Rachford algorithm in the absence of convexity
• The rate of linear convergence of the Douglas-Rachford algorithm for subspaces is the cosine of the Friedrichs angle

Cited in

(9)

• Retro-leapfrog and structure elucidation
• Dynamics of the Douglas-Rachford method for ellipses and p-spheres
• Constraint reduction reformulations for projection algorithms with applications to wavelet construction
• Circumcentering reflection methods for nonconvex feasibility problems
• The Douglas-Rachford algorithm for convex and nonconvex feasibility problems
• Douglas-Rachford feasibility methods for matrix completion problems
• SURVEY: SIXTY YEARS OF DOUGLAS–RACHFORD
• Solving nonconvex feasibility problem on a sphere and a closed ball by Douglas-Rachford algorithm
• Multiple-sets split quasi-convex feasibility problems: adaptive subgradient methods with convergence guarantee

This page was built for publication: Reflection Methods for Inverse Problems with Applications to Protein Conformation Determination

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4557875)