Pages that link to "Item:Q2943971"

The following pages link to Projection Methods: Swiss Army Knives for Solving Feasibility and Best Approximation Problems with Halfspaces (Q2943971):

Displaying 34 items.

• Global behavior of the Douglas-Rachford method for a nonconvex feasibility problem (Q288229) (← links)
• Conic optimization via operator splitting and homogeneous self-dual embedding (Q301735) (← links)
• A new projection method for finding the closest point in the intersection of convex sets (Q683336) (← links)
• A generalized projection-based scheme for solving convex constrained optimization problems (Q721952) (← links)
• Finding a best approximation pair of points for two polyhedra (Q1616942) (← links)
• Solving graph coloring problems with the Douglas-Rachford algorithm (Q1653324) (← links)
• Convergence analysis of processes with valiant projection operators in Hilbert space (Q1706406) (← links)
• The method of cyclic projections for closed convex sets in a Hilbert space under the presence of computational errors (Q2084269) (← links)
• An adaptive alternating direction method of multipliers (Q2095572) (← links)
• String-averaging methods for best approximation to common fixed point sets of operators: the finite and infinite cases (Q2138440) (← links)
• Feasibility-based fixed point networks (Q2138454) (← links)
• A real-time iterative projection scheme for solving the common fixed point problem and its applications (Q2168968) (← links)
• An enhanced formulation for solving graph coloring problems with the Douglas-Rachford algorithm (Q2176284) (← links)
• The rate of linear convergence of the Douglas-Rachford algorithm for subspaces is the cosine of the Friedrichs angle (Q2252928) (← links)
• Strict Fejér monotonicity by superiorization of feasibility-seeking projection methods (Q2346394) (← links)
• On the local convergence of the Douglas-Rachford algorithm (Q2510692) (← links)
• Stadium Norm and Douglas-Rachford Splitting: A New Approach to Road Design Optimization (Q2806070) (← links)
• The Method of Cyclic Intrepid Projections: Convergence Analysis and Numerical Experiments (Q3455009) (← links)
• Global Convergence of Splitting Methods for Nonconvex Composite Optimization (Q3457189) (← links)
• (Q5026414) (← links)
• An asynchronous inertial algorithm for solving convex feasibility problems with strict pseudo-contractions in Hilbert spaces (Q5065443) (← links)
• Fixed Point and Convergence Results for Nonexpansive Set-Valued Mappings (Q5067641) (← links)
• SDP-Based Bounds for the Quadratic Cycle Cover Problem via Cutting-Plane Augmented Lagrangian Methods and Reinforcement Learning (Q5084594) (← links)
• Optimization of triangular networks with spatial constraints (Q5085265) (← links)
• Douglas--Rachford Splitting and ADMM for Nonconvex Optimization: Tight Convergence Results (Q5210517) (← links)
• Linear Convergence of Projection Algorithms (Q5219736) (← links)
• A new convergence analysis and perturbation resilience of some accelerated proximal forward–backward algorithms with errors (Q5346620) (← links)
• Asymptotic behavior of two algorithms for solving common fixed point problems (Q5346623) (← links)
• Can linear superiorization be useful for linear optimization problems? (Q5346625) (← links)
• Speedup of lexicographic optimization by superiorization and its applications to cancer radiotherapy treatment (Q5346631) (← links)
• Closed-Form Expressions for Projectors onto Polyhedral Sets in Hilbert Spaces (Q5348473) (← links)
• Partitioning through projections: strong SDP bounds for large graph partition problems (Q6109293) (← links)
• Randomized Douglas–Rachford Methods for Linear Systems: Improved Accuracy and Efficiency (Q6130543) (← links)
• A fixed point theorem for nonself nonlinear contractions in length spaces (Q6545450) (← links)