Projection methods: Swiss army knives for solving feasibility and best approximation problems with halfspaces

zbMATH Open1325.65080arXiv1301.4506MaRDI QIDQ2943971FDOQ2943971

Authors: Heinz H. Bauschke, Valentin R. Koch 

Publication date: 7 September 2015

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.

Full work available at URL: https://arxiv.org/abs/1301.4506

Recommendations

• The method of cyclic intrepid projections: convergence analysis and numerical experiments
• How good are projection methods for convex feasibility problems?
• A log-quadratic projection method for convex feasibility problems
• Block-iterative surrogate projection methods for convex feasibility problems
• On Projection Algorithms for Solving Convex Feasibility Problems

zbMATH Keywords

interpolationprojectionbest approximationcurve fittingnumerical experimentconvex setlinear inequalitiesfeasibilityroad designsuperiorizationhalfspacenonconvex problemDouglas-Rachford splitting algorithmDykstra's methodmethod of cyclic projections

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Nonconvex programming, global optimization (90C26) Best approximation, Chebyshev systems (41A50)

Cited In (39)

• SDP-Based Bounds for the Quadratic Cycle Cover Problem via Cutting-Plane Augmented Lagrangian Methods and Reinforcement Learning
• A generalized projection-based scheme for solving convex constrained optimization problems
• Closed-Form Expressions for Projectors onto Polyhedral Sets in Hilbert Spaces
• A new projection method for finding the closest point in the intersection of convex sets
• String-averaging methods for best approximation to common fixed point sets of operators: the finite and infinite cases
• Linear convergence of projection algorithms
• Fast feasibility check of the multi-material vertical alignment problem in road design
• An asynchronous inertial algorithm for solving convex feasibility problems with strict pseudo-contractions in Hilbert spaces
• CONVERGENCE OF INEXACT ITERATES OF UNIFORMLY LOCALLY NONEXPANSIVE MAPPINGS WITH SUMMABLE ERRORS
• Global behavior of the Douglas-Rachford method for a nonconvex feasibility problem
• Global convergence of splitting methods for nonconvex composite optimization
• Fixed Point and Convergence Results for Nonexpansive Set-Valued Mappings
• An adaptive alternating direction method of multipliers
• Feasibility-based fixed point networks
• Projection onto the exponential cone: a univariate root-finding problem
• Title not available (Why is that?)
• Douglas--Rachford Splitting and ADMM for Nonconvex Optimization: Tight Convergence Results
• Solving graph coloring problems with the Douglas-Rachford algorithm
• A new convergence analysis and perturbation resilience of some accelerated proximal forward-backward algorithms with errors
• Stadium norm and Douglas-Rachford splitting: a new approach to road design optimization
• An enhanced formulation for solving graph coloring problems with the Douglas-Rachford algorithm
• How good are extrapolated bi-projection methods for linear feasibility problems?
• A real-time iterative projection scheme for solving the common fixed point problem and its applications
• Asymptotic behavior of two algorithms for solving common fixed point problems
• The rate of linear convergence of the Douglas-Rachford algorithm for subspaces is the cosine of the Friedrichs angle
• Conic optimization via operator splitting and homogeneous self-dual embedding
• On the local convergence of the Douglas-Rachford algorithm
• Optimization of triangular networks with spatial constraints
• How good are projection methods for convex feasibility problems?
• Finding a best approximation pair of points for two polyhedra
• Can linear superiorization be useful for linear optimization problems?
• Convergence analysis of processes with valiant projection operators in Hilbert space
• Strict Fejér monotonicity by superiorization of feasibility-seeking projection methods
• The method of cyclic intrepid projections: convergence analysis and numerical experiments
• The method of cyclic projections for closed convex sets in a Hilbert space under the presence of computational errors
• A fixed point theorem for nonself nonlinear contractions in length spaces
• Partitioning through projections: strong SDP bounds for large graph partition problems
• Speedup of lexicographic optimization by superiorization and its applications to cancer radiotherapy treatment
• Randomized Douglas–Rachford Methods for Linear Systems: Improved Accuracy and Efficiency

This page was built for publication: Projection methods: Swiss army knives for solving feasibility and best approximation problems with halfspaces

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2943971)