The Method of Cyclic Intrepid Projections: Convergence Analysis and Numerical Experiments

DOI10.1007/978-4-431-54907-9_14zbMath1326.65065arXiv1312.0534OpenAlexW2123805207MaRDI QIDQ3455009

Heinz H. Bauschke, Francesco Iorio, Valentin R. Koch

Publication date: 3 December 2015

Published in: The Impact of Applications on Mathematics (Search for Journal in Brave)

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

zbMATH Keywords

projectionconvex setlinear inequalitiesfeasibility problemroad designhalfspaceintrepid projection

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Convex programming (90C25) Linear programming (90C05)

Related Items

Asynchronous sequential inertial iterations for common fixed points problems with an application to linear systems, Convergence analysis of processes with valiant projection operators in Hilbert space, Linear Convergence of Projection Algorithms

Uses Software

• Gurobi

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Iterative methods for fixed point problems in Hilbert spaces
• Hilbertian convex feasibility problem: Convergence of projection methods
• An alternating projection that does not converge in norm
• Fundamentals of Computerized Tomography
• Minimizing the Moreau Envelope of Nonsmooth Convex Functions over the Fixed Point Set of Certain Quasi-Nonexpansive Mappings
• Projection Methods: Swiss Army Knives for Solving Feasibility and Best Approximation Problems with Halfspaces
• Efficient controls for finitely convergent sequential algorithms
• A relaxation method for reconstructing objects from noisy X-rays
• Variational Analysis
• Solving monotone inclusions via compositions of nonexpansive averaged operators
• Hybrid Steepest Descent Method for Variational Inequality Problem over the Fixed Point Set of Certain Quasi-nonexpansive Mappings
• On Projection Algorithms for Solving Convex Feasibility Problems
• The Adaptive Projected Subgradient Method Constrained by Families of Quasi-nonexpansive Mappings and Its Application to Online Learning
• A Weak-to-Strong Convergence Principle for Fejér-Monotone Methods in Hilbert Spaces
• Convex analysis and monotone operator theory in Hilbert spaces
• Inherently parallel algorithms in feasibility and optimization and their applications. Research workshop, Haifa, Israel, March 13--16, 2000
• Benchmarking optimization software with performance profiles.