How good are projection methods for convex feasibility problems?

DOI10.1007/S10589-007-9073-5zbMath1146.90039OpenAlexW2107980895MaRDI QIDQ2427393

Nicholas I. M. Gould

Publication date: 13 May 2008

Published in: Computational Optimization and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10589-007-9073-5

zbMATH Keywords

numerical evaluation

Mathematics Subject Classification ID

Derivative-free methods and methods using generalized derivatives (90C56) Linear programming (90C05)

Related Items (12)

Fundamentals of cone regression ⋮ A non-interior continuation algorithm for solving the convex feasibility problem ⋮ Anderson acceleration of the alternating projections method for computing the nearest correlation matrix ⋮ Single-projection procedure for linear optimization ⋮ Distance majorization and its applications ⋮ On the effectiveness of projection methods for convex feasibility problems with linear inequality constraints ⋮ How good are extrapolated bi-projection methods for linear feasibility problems? ⋮ Iterative algorithm for solving a class of convex feasibility problem ⋮ Convergence analysis of a parallel projection algorithm for solving convex feasibility problems ⋮ Numerical methods for solving some matrix feasibility problems ⋮ Perturbation‐resilient block‐iterative projection methods with application to image reconstruction from projections ⋮ Equivalence relations in convex optimization

Uses Software

• Unnamed Item
• Unnamed Item
• Unnamed Item
• CUTEr
• SifDec
• heapsort

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Reflection-projection method for convex feasibility problems with an obtuse cone
• A simultaneous projections method for linear inequalities
• On some optimization techniques in image reconstruction from projections
• On the convergence of Han's method for convex programming with quadratic objective
• A successive projection method
• On the convergence of von Neumann's alternating projection algorithm for two sets
• Extrapolation algorithm for affine-convex feasibility problems
• Computational acceleration of projection algorithms for the linear best approximation problem
• An Algorithm for Restricted Least Squares Regression
• The Multifrontal Solution of Indefinite Sparse Symmetric Linear
• Decomposition through formalization in a product space
• A Simultaneous Iterative Method for Computing Projections on Polyhedra
• Eigenvalues and Condition Numbers of Random Matrices
• Row-Action Methods for Huge and Sparse Systems and Their Applications
• The rate of convergence of dykstra's cyclic projections algorithm: The polyhedral case
• On Projection Algorithms for Solving Convex Feasibility Problems
• A Convergence Analysis of Dykstra's Algorithm for Polyhedral Sets
• GALAHAD, a library of thread-safe Fortran 90 packages for large-scale nonlinear optimization
• CUTEr and SifDec
• MA57---a code for the solution of sparse symmetric definite and indefinite systems
• The method of projections for finding the common point of convex sets
• On a relaxation method of solving systems of linear inequalities
• Functional Operators (AM-21), Volume 1
• Benchmarking optimization software with performance profiles.

This page was built for publication: How good are projection methods for convex feasibility problems?