Projection Methods: Swiss Army Knives for Solving Feasibility and Best Approximation Problems with Halfspaces
From MaRDI portal
Publication:2943971
zbMath1325.65080arXiv1301.4506MaRDI QIDQ2943971
Heinz H. Bauschke, Valentin R. Koch
Publication date: 7 September 2015
Full work available at URL: https://arxiv.org/abs/1301.4506
interpolationprojectioncurve fittingconvex setbest approximationnumerical experimentnonconvex problemfeasibilitylinear inequalitiessuperiorizationroad designhalfspaceDouglas-Rachford splitting algorithmDykstra's methodmethod of cyclic projections
Numerical mathematical programming methods (65K05) Nonconvex programming, global optimization (90C26) Best approximation, Chebyshev systems (41A50)
Related Items
Finding a best approximation pair of points for two polyhedra, Global behavior of the Douglas-Rachford method for a nonconvex feasibility problem, Conic optimization via operator splitting and homogeneous self-dual embedding, String-averaging methods for best approximation to common fixed point sets of operators: the finite and infinite cases, Feasibility-based fixed point networks, The Method of Cyclic Intrepid Projections: Convergence Analysis and Numerical Experiments, Global Convergence of Splitting Methods for Nonconvex Composite Optimization, 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, Solving graph coloring problems with the Douglas-Rachford algorithm, A real-time iterative projection scheme for solving the common fixed point problem and its applications, 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, An enhanced formulation for 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, 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, Convergence analysis of processes with valiant projection operators in Hilbert space, Unnamed Item, A new projection method for finding the closest point in the intersection of convex sets, The rate of linear convergence of the Douglas-Rachford algorithm for subspaces is the cosine of the Friedrichs angle, A generalized projection-based scheme for solving convex constrained optimization problems, On the local convergence of the Douglas-Rachford algorithm, Stadium Norm and Douglas-Rachford Splitting: A New Approach to Road Design Optimization, Douglas--Rachford Splitting and ADMM for Nonconvex Optimization: Tight Convergence Results, Linear Convergence of Projection Algorithms, 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, Strict Fejér monotonicity by superiorization of feasibility-seeking projection methods
