How good are projection methods for convex feasibility problems?
type: Item
instance of: scholarly article
title: How good are projection methods for convex feasibility problems?
zbMATH Open document ID: 1146.90039
author: Nicholas I. M. Gould
published in: Computational Optimization and Applications
publication date: 2008-05-13T00:00:00Z
Mathematics Subject Classification ID: 90C05
Mathematics Subject Classification ID: 90C56
zbMATH DE Number: 5274000
zbMATH Keywords: numerical evaluation
describes a project that uses: GALAHAD
describes a project that uses: SifDec
describes a project that uses: heapsort
describes a project that uses: HSL
describes a project that uses: MA57
describes a project that uses: CUTEr
MaRDI profile type: Publication
full work available at URL: s10589-007-9073-5
OpenAlex ID: W2107980895
cites work: On the convergence of von Neumann's alternating projection algorithm for two sets
cites work: On Projection Algorithms for Solving Convex Feasibility Problems
cites work: Q4336949
cites work: Extrapolation algorithm for affine-convex feasibility problems
cites work: Reflection-projection method for convex feasibility problems with an obtuse cone
cites work: Row-Action Methods for Huge and Sparse Systems and Their Applications
cites work: Computational acceleration of projection algorithms for the linear best approximation problem
cites work: On some optimization techniques in image reconstruction from projections
cites work: Q4718793
cites work: The rate of convergence of dykstra's cyclic projections algorithm: The polyhedral case
cites work: Benchmarking optimization software with performance profiles.
cites work: MA57---a code for the solution of sparse symmetric definite and indefinite systems
cites work: The Multifrontal Solution of Indefinite Sparse Symmetric Linear
cites work: An Algorithm for Restricted Least Squares Regression
cites work: Eigenvalues and Condition Numbers of Random Matrices
cites work: CUTEr and SifDec
cites work: GALAHAD, a library of thread-safe Fortran 90 packages for large-scale nonlinear optimization
cites work: The method of projections for finding the common point of convex sets
cites work: Q5518786
cites work: A successive projection method
cites work: A Simultaneous Iterative Method for Computing Projections on Polyhedra
cites work: On the convergence of Han's method for convex programming with quadratic objective
cites work: Q5768822
cites work: On a relaxation method of solving systems of linear inequalities
cites work: A Convergence Analysis of Dykstra's Algorithm for Polyhedral Sets
cites work: Decomposition through formalization in a product space
cites work: A simultaneous projections method for linear inequalities
cites work: Functional Operators (AM-21), Volume 1
DOI: 10.1007/S10589-007-9073-5
description: scientific article