Pages that link to "Item:Q429491"
From MaRDI portal
The following pages link to On the effectiveness of projection methods for convex feasibility problems with linear inequality constraints (Q429491):
Displaying 50 items.
- Fundamentals of cone regression (Q289730) (← links)
- Conic optimization via operator splitting and homogeneous self-dual embedding (Q301735) (← links)
- A proximal point algorithm based on decomposition method for cone constrained multiobjective optimization problems (Q316185) (← links)
- Cyclic subgradient extragradient methods for equilibrium problems (Q317029) (← links)
- Single-projection procedure for linear optimization (Q330507) (← links)
- Distance majorization and its applications (Q403660) (← links)
- How good are extrapolated bi-projection methods for linear feasibility problems? (Q429520) (← links)
- Convex feasibility modeling and projection methods for sparse signal recovery (Q442713) (← links)
- Common solutions to variational inequalities (Q452274) (← links)
- A strongly polynomial-time algorithm for the strict homogeneous linear-inequality feasibility problem (Q486939) (← links)
- A relaxed projection method for split variational inequalities (Q493247) (← links)
- Zero-convex functions, perturbation resilience, and subgradient projections for feasibility-seeking methods (Q494329) (← links)
- On the existence of minimizers of proximity functions for split feasibility problems (Q495733) (← links)
- Algorithms for the split variational inequality problem (Q663488) (← links)
- A new modified hybrid steepest-descent by using a viscosity approximation method with a weakly contractive mapping for a system of equilibrium problems and fixed point problems with minimization problems (Q696010) (← 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)
- A non-interior continuation algorithm for solving the convex feasibility problem (Q1634140) (← links)
- Convergence and perturbation resilience of dynamic string-averaging projection methods (Q1938920) (← links)
- A novel low-cost method for generalized split inverse problem of finite family of demimetric mappings (Q1983860) (← links)
- Reconstruction of functions from prescribed proximal points (Q2037075) (← links)
- On the method of reflections (Q2038432) (← links)
- A stochastic approximation method for approximating the efficient frontier of chance-constrained nonlinear programs (Q2063194) (← links)
- Feasibility-based fixed point networks (Q2138454) (← links)
- A new self-adaptive accelerated method for generalized split system of common fixed-point problem of averaged mappings (Q2156698) (← links)
- A real-time iterative projection scheme for solving the common fixed point problem and its applications (Q2168968) (← links)
- An explicit algorithm for solving monotone variational inequalities (Q2238840) (← links)
- Projected subgradient minimization versus superiorization (Q2251567) (← links)
- Dykstra's splitting and an approximate proximal point algorithm for minimizing the sum of convex functions (Q2322367) (← links)
- Shrinking extragradient method for pseudomonotone equilibrium problems and quasi-nonexpansive mappings (Q2337918) (← links)
- Strict Fejér monotonicity by superiorization of feasibility-seeking projection methods (Q2346394) (← links)
- New subgradient extragradient methods for common solutions to equilibrium problems (Q2364128) (← links)
- Split equality monotone variational inclusions and fixed point problem of set-valued operator (Q2399844) (← links)
- Parallel and cyclic hybrid subgradient extragradient methods for variational inequalities (Q2404133) (← links)
- The optimal error bound for the method of simultaneous projections (Q2406901) (← links)
- Asynchronous sequential inertial iterations for common fixed points problems with an application to linear systems (Q2423796) (← links)
- Tomography (Q2789814) (← links)
- (Q3384243) (← links)
- Projection methods: an annotated bibliography of books and reviews (Q3453406) (← links)
- Nonasymptotic convergence of stochastic proximal point algorithms for constrained convex optimization (Q4558525) (← links)
- On the convergence of general projection methods for solving convex feasibility problems with applications to the inverse problem of image recovery (Q4559404) (← links)
- Choosing the relaxation parameter in sequential block-iterativemethods for linear systems (Q4633311) (← links)
- General alternative regularization methods for split equality common fixed-point problem (Q4643684) (← links)
- Strong convergence of over-relaxed multi-parameter proximal scaled gradient algorithm and superiorization (Q4986410) (← links)
- Common Solutions to Variational Inequality Problem via Parallel and Cyclic Hybrid Inertial CQ-Subgradient Extragradient Algorithms in (HSs) (Q5050902) (← links)
- Weak and strong convergence adaptive algorithms for generalized split common fixed point problems (Q5054731) (← links)
- Strong convergence theorem for common zero points of inverse strongly monotone mappings and common fixed points of generalized demimetric mappings (Q5057977) (← links)
- Stochastic block projection algorithms with extrapolation for convex feasibility problems (Q5058397) (← links)
- An asynchronous inertial algorithm for solving convex feasibility problems with strict pseudo-contractions in Hilbert spaces (Q5065443) (← links)
- Optimization of triangular networks with spatial constraints (Q5085265) (← links)
