How good are extrapolated bi-projection methods for linear feasibility problems?
From MaRDI portal
(Redirected from Publication:429520)
Recommendations
- How good are projection methods for convex feasibility problems?
- Projection algorithms for linear programming
- An accelerated successive orthogonal projections method for solving large-scale linear feasibility problems
- Projection methods: Swiss army knives for solving feasibility and best approximation problems with halfspaces
- A note on the implementation of the accelerated successive orthogonal projections method for solving large scale linear feasibility problems
Cites work
- A sparse proximal implementation of the LP dual active set algorithm
- Benchmarking optimization software with performance profiles.
- CUTEr and SifDec
- Decomposition through formalization in a product space
- Dual multilevel optimization
- Extrapolation algorithm for affine-convex feasibility problems
- GALAHAD, a library of thread-safe Fortran 90 packages for large-scale nonlinear optimization
- Hilbertian convex feasibility problem: Convergence of projection methods
- How good are projection methods for convex feasibility problems?
- On the effectiveness of projection methods for convex feasibility problems with linear inequality constraints
This page was built for publication: How good are extrapolated bi-projection methods for linear feasibility problems?
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q429520)
