Projection Methods: Swiss Army Knives for Solving Feasibility and Best Approximation Problems with Halfspaces
Not on the map. Why?
Abstract (arXiv)
We model a problem motivated by road design as a feasibility problem. Projections onto the constraint sets are obtained, and projection methods for solving the feasibility problem are studied. We present results of numerical experiments which demonstrate the efficacy of projection methods even for challenging nonconvex problems.
Key facts. Cited by 4 papers in the map (data through 7 Oct 2026). First posted on arXiv 18 Jan 2013.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2021: 2; 2022: 0; 2023: 0; 2024: 0; 2025: 0; 2026: 2.
4 papers.
- 2021Feasibility-based Fixed Point Networkscited by 17
- 2026Learning to accelerate Krasnosel'skii-Mann fixed-point iterations with guaranteescited by 2
- 2021OpReg-Boost: Learning to Accelerate Online Algorithms with Operator Regressioncited by 1
- 2026LPC-SM: Local Predictive Coding and Sparse Memory for Long-Context Language Modelingcited by 0
- 2026LPC-SM: Local Predictive Coding and Sparse Memory for Long-Context Language Modeling12 Mar 2026
- 2026Learning to accelerate Krasnosel'skii-Mann fixed-point iterations with guarantees12 Jan 2026
- 2021OpReg-Boost: Learning to Accelerate Online Algorithms with Operator Regression27 May 2021
- 2021Feasibility-based Fixed Point Networks29 Apr 2021