Pages that link to "Item:Q704736"
From MaRDI portal
The following pages link to Reflection-projection method for convex feasibility problems with an obtuse cone (Q704736):
Displaying 26 items.
- On Slater's condition and finite convergence of the Douglas-Rachford algorithm for solving convex feasibility problems in Euclidean spaces (Q288232) (← links)
- Optimal rates of linear convergence of relaxed alternating projections and generalized Douglas-Rachford methods for two subspaces (Q312177) (← links)
- Restricted normal cones and sparsity optimization with affine constraints (Q404252) (← links)
- A cyclic and simultaneous iterative method for solving the multiple-sets split feasibility problem (Q495732) (← links)
- Finding best approximation pairs relative to two closed convex sets in Hilbert spaces (Q596824) (← links)
- Inradius and circumradius of various convex cones arising in applications (Q618877) (← links)
- Asymptotics for some proximal-like method involving inertia and memory aspects (Q632230) (← links)
- A new characterization of nonnegativity of Moore-Penrose inverses of Gram operators (Q1007088) (← links)
- An improved semidefinite programming relaxation for the satisfiability problem (Q1774165) (← links)
- Method of alternating projections for the general absolute value equation (Q2111941) (← links)
- Regularization inertial proximal point algorithm for common solutions of a finite family of inverse-strongly monotone equations (Q2269621) (← links)
- A family of projection gradient methods for solving the multiple-sets split feasibility problem (Q2275325) (← links)
- On the finite convergence of a projected cutter method (Q2349845) (← links)
- How good are projection methods for convex feasibility problems? (Q2427393) (← links)
- On the Mann-type iteration and the convex feasibility problem (Q2468142) (← links)
- Extrapolation algorithm for affine-convex feasibility problems (Q2494384) (← links)
- On the circumcentered-reflection method for the convex feasibility problem (Q2661677) (← links)
- A log-quadratic projection method for convex feasibility problems (Q2768005) (← links)
- On the finite termination of the Douglas-Rachford method for the convex feasibility problem (Q2836088) (← links)
- Primal–dual first-order methods for a class of cone programming (Q2867434) (← links)
- Accelerated reflection projection algorithm and its application to the LMI problem (Q3453404) (← links)
- Using Nemirovski's Mirror-Prox method as basic procedure in Chubanov's method for solving homogeneous feasibility problems (Q5058382) (← links)
- Linear Convergence of Projection Algorithms (Q5219736) (← links)
- An Active-Set Method for Second-Order Conic-Constrained Quadratic Programming (Q5502239) (← links)
- On the Finite Convergence of the Douglas--Rachford Algorithm for Solving (Not Necessarily Convex) Feasibility Problems in Euclidean Spaces (Q5737718) (← links)
- Global convergence and acceleration of projection methods for feasibility problems involving union convex sets (Q6667563) (← links)
