Projection Methods: Swiss Army Knives for Solving Feasibility and Best Approximation Problems with Halfspaces

2013/01/18 by Heinz H. Bauschke, Bauschke, Heinz H., Valentin Koch +1 · 3 citations
Computer Science · Mathematics · #49M45 #65K05 #90C05 (Secondary) #90C25 (Primary) 41A65 #Advanced Optimization Algorithms Research #FOS: Mathematics #Numerical Analysis (math.NA) #Optimization and Control (math.OC) #Optimization and Variational Analysis

paper · pdf · doi:10.48550/arxiv.1301.4506

openalex publication_date 2013/01/18 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

Abstract

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.

Cited by

• Fast-Forwarding Stalling in Dykstra's Algorithm
• Fundamental diagram constrained dynamic optimal transport via proximal splitting methods
• Efficient and Real-Time Motion Planning for Robotics Using Projection-Based Optimization

Related

• The method of cyclic intrepid projections: convergence analysis and numerical experiments
• Application of projection algorithms to differential equations: boundary value problems
• Numerical explorations of feasibility algorithms for finding points in the intersection of finite sets
• A learning-enhanced projection method for solving convex feasibility\n problems
• On the Effectiveness of Projection Methods for Convex Feasibility Problems with Linear Inequality Constraints