How good are extrapolated bi-projection methods for linear feasibility problems?
From MaRDI portal
Publication:429520
DOI10.1007/s10589-011-9414-2zbMath1244.90157OpenAlexW1966858705MaRDI QIDQ429520
Publication date: 19 June 2012
Published in: Computational Optimization and Applications (Search for Journal in Brave)
Full work available at URL: http://purl.org/net/epubs/manifestation/6506/RAL-TR-2011-009.pdf
Related Items (1)
Uses Software
Cites Work
- On the effectiveness of projection methods for convex feasibility problems with linear inequality constraints
- Hilbertian convex feasibility problem: Convergence of projection methods
- How good are projection methods for convex feasibility problems?
- A sparse proximal implementation of the LP dual active set algorithm
- Dual multilevel optimization
- Extrapolation algorithm for affine-convex feasibility problems
- Decomposition through formalization in a product space
- GALAHAD, a library of thread-safe Fortran 90 packages for large-scale nonlinear optimization
- CUTEr and SifDec
- Benchmarking optimization software with performance profiles.
This page was built for publication: How good are extrapolated bi-projection methods for linear feasibility problems?
