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