Fixed point algorithms for nonconvex feasibility with applications

MaRDI QIDQ5248559zbMATH OpenFDO

Authors Robert Hesse

Publication date 7 May 2015

Full work available at URL http://d-nb.info/1054542392/34

zbMATH Keywords

fixed-point iterationsnonconvex feasibilitynonexpansiveness

Mathematics Subject Classification ID

Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02) Nonconvex programming, global optimization (90C26) Applications of mathematical programming (90C90)

Recommendations

• Nonconvex notions of regularity and convergence of fundamental algorithms for feasibility problems
• Fixed point analysis of Douglas-Rachford splitting for ptychography and phase retrieval
• Algorithms for structured nonconvex optimization: theory and practice
• Convex combination of alternating projection and Douglas-Rachford operators for phase retrieval
• The Douglas-Rachford algorithm for convex and nonconvex feasibility problems

Cited in

(8)

• A feasibility approach for constructing combinatorial designs of circulant type
• Convex combination of alternating projection and Douglas-Rachford operators for phase retrieval
• Fixed point analysis of Douglas-Rachford splitting for ptychography and phase retrieval
• Algorithms for structured nonconvex optimization: theory and practice
• Non-Convex feasibility problems and proximal point methods
• scientific article; zbMATH DE number 7532327 (Why is no real title available?)
• scientific article; zbMATH DE number 7195209 (Why is no real title available?)
• Nonconvex notions of regularity and convergence of fundamental algorithms for feasibility problems

This page was built for publication: Fixed point algorithms for nonconvex feasibility with applications

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