Pages that link to "Item:Q1340505"
From MaRDI portal
The following pages link to Dykstra's alternating projection algorithm for two sets (Q1340505):
Displaying 50 items.
- On a result of Pazy concerning the asymptotic behaviour of nonexpansive mappings (Q300577) (← links)
- Conic optimization via operator splitting and homogeneous self-dual embedding (Q301735) (← links)
- Near equality, near convexity, sums of maximally monotone operators, and averages of firmly nonexpansive mappings (Q353136) (← links)
- Alternating projections on nontangential manifolds (Q387545) (← links)
- A new iterative algorithm for solving a class of matrix nearness problem (Q408473) (← links)
- On the existence of minimizers of proximity functions for split feasibility problems (Q495733) (← links)
- A note on alternating projections for ill-posed semidefinite feasibility problems (Q517318) (← links)
- Proximity for sums of composite functions (Q536271) (← links)
- Compositions and averages of two resolvents: relative geometry of fixed points sets and a partial answer to a question by C.\,Byrne (Q548635) (← links)
- Finding best approximation pairs relative to two closed convex sets in Hilbert spaces (Q596824) (← links)
- Variable target value relaxed alternating projection method (Q616797) (← links)
- There is no variational characterization of the cycles in the method of periodic projections (Q652441) (← links)
- A new projection method for finding the closest point in the intersection of convex sets (Q683336) (← links)
- Reflection-projection method for convex feasibility problems with an obtuse cone (Q704736) (← links)
- The asymptotic behavior of the composition of two resolvents (Q707223) (← links)
- Alternating-projection algorithms for operator-theoretic calculations (Q865433) (← links)
- The asymptotic behavior of the composition of firmly nonexpansive mappings (Q896178) (← links)
- Dykstra's algorithm for constrained least-squares doubly symmetric matrix problems (Q982653) (← links)
- On the convergence of von Neumann's alternating projection algorithm for two sets (Q1308949) (← links)
- Finding the projection of a point onto the intersection of convex sets via projections onto half-spaces. (Q1421503) (← links)
- Projection and proximal point methods: Convergence results and counterexamples. (Q1426419) (← links)
- Finding a best approximation pair of points for two polyhedra (Q1616942) (← links)
- Linear convergence of the generalized Douglas-Rachford algorithm for feasibility problems (Q1630271) (← links)
- The forward-backward algorithm and the normal problem (Q1752641) (← links)
- The Douglas-Rachford algorithm in the affine-convex case (Q1790199) (← links)
- The magnitude of the minimal displacement vector for compositions and convex combinations of firmly nonexpansive mappings (Q1800437) (← links)
- A note on alternating projections in Hilbert space (Q1950308) (← links)
- Markov chain lumpability and applications to credit risk modelling in compliance with the International Financial Reporting Standard 9 framework (Q2030488) (← links)
- Alternating conditional gradient method for convex feasibility problems (Q2044579) (← links)
- Finding best approximation pairs for two intersections of closed convex sets (Q2070342) (← links)
- The difference vectors for convex sets and a resolution of the geometry conjecture (Q2165589) (← links)
- Novel forward-backward algorithms for optimization and applications to compressive sensing and image inpainting (Q2167003) (← links)
- On Dykstra's algorithm: finite convergence, stalling, and the method of alternating projections (Q2228383) (← links)
- A cyclic Douglas-Rachford iteration scheme (Q2250057) (← links)
- Moduli of regularity and rates of convergence for Fejér monotone sequences (Q2317680) (← links)
- A geometrical approach to iterative isotone regression (Q2396476) (← links)
- Error bounds for parametric polynomial systems with applications to higher-order stability analysis and convergence rates (Q2413090) (← links)
- A parameterized Douglas-Rachford algorithm (Q2419571) (← links)
- Incomplete alternating projection method for large inconsistent linear systems (Q2472379) (← links)
- Computational acceleration of projection algorithms for the linear best approximation problem (Q2497243) (← links)
- Low-rank nonnegative tensor approximation via alternating projections and sketching (Q2685220) (← links)
- Dykstras algorithm with bregman projections: A convergence proof (Q2709445) (← links)
- Iterative isotonic regression (Q2786465) (← links)
- Proximal Splitting Methods in Signal Processing (Q2897282) (← links)
- DOUGLAS–RACHFORD FEASIBILITY METHODS FOR MATRIX COMPLETION PROBLEMS (Q2925693) (← links)
- Distributed solutions for loosely coupled feasibility problems using proximal splitting methods (Q2943811) (← links)
- ADMM-Based Methods for Nearness SkewSymmetric and Symmetric Solutions of Matrix Equation AXB = C (Q4986623) (← links)
- Un problème d'approximation matricielle : quelle est la matrice bistochastique la plus proche d'une matrice donnée ? (Q5710542) (← links)
- Double inertial proximal gradient algorithms for convex optimization problems and applications (Q6101867) (← links)
- Feature selection algorithm in classification learning using support vector machines (Q6191512) (← links)
