The following pages link to (Q3172946):
Displaying 50 items.
- Product of two positive contractions (Q273158) (← links)
- A modular string averaging procedure for solving the common fixed point problem for quasi-nonexpansive mappings in Hilbert space (Q297551) (← links)
- Anderson acceleration of the alternating projections method for computing the nearest correlation matrix (Q306368) (← links)
- Optimal rates of linear convergence of relaxed alternating projections and generalized Douglas-Rachford methods for two subspaces (Q312177) (← links)
- Computationally efficient approach for the minimization of volume constrained vector-valued Ginzburg-Landau energy functional (Q350070) (← links)
- Accelerating the alternating projection algorithm for the case of affine subspaces using supporting hyperplanes (Q486223) (← links)
- On biunimodular vectors for unitary matrices (Q491106) (← links)
- Projection methods for quantum channel construction (Q496914) (← links)
- Error minimizing relaxation strategies in Landweber and Kaczmarz type iterations (Q511032) (← links)
- Convergence acceleration of Kaczmarz's method (Q525250) (← links)
- A new projection method for finding the closest point in the intersection of convex sets (Q683336) (← links)
- Low rank matrix completion by alternating steepest descent methods (Q905914) (← links)
- Finding a best approximation pair of points for two polyhedra (Q1616942) (← links)
- Some convergence strategies for the alternating generalized projection method (Q1653932) (← links)
- A convex optimization approach for solving large scale linear systems (Q1653970) (← links)
- Multimaterial topology optimization by volume constrained Allen-Cahn system and regularized projected steepest descent method (Q1667260) (← links)
- Duality and nonlinear graph Laplacians (Q1694674) (← links)
- On sequential multiscale inversion and data assimilation (Q1696453) (← links)
- Iterative algorithm for solving a class of convex feasibility problem (Q1736385) (← links)
- Alternating oblique projections for coupled linear systems (Q1773088) (← links)
- Convergence and perturbation resilience of dynamic string-averaging projection methods (Q1938920) (← links)
- Markov chain lumpability and applications to credit risk modelling in compliance with the International Financial Reporting Standard 9 framework (Q2030488) (← links)
- Multi-step greedy Kaczmarz algorithms with simple random sampling for solving large linear systems (Q2085033) (← links)
- The superiorization method with restarted perturbations for split minimization problems with an application to radiotherapy treatment planning (Q2101916) (← links)
- Rates of convergence of randomized Kaczmarz algorithms in Hilbert spaces (Q2168686) (← links)
- A real-time iterative projection scheme for solving the common fixed point problem and its applications (Q2168968) (← links)
- Worst-case complexity of cyclic coordinate descent: \(O(n^2)\) gap with randomized version (Q2220668) (← links)
- Column-oriented algebraic iterative methods for nonnegative constrained least squares problems (Q2225527) (← links)
- Alternating projection method for doubly stochastic inverse eigenvalue problems with partial eigendata (Q2244987) (← links)
- A cyclic Douglas-Rachford iteration scheme (Q2250057) (← links)
- Optimal rates of linear convergence of the averaged alternating modified reflections method for two subspaces (Q2274154) (← links)
- Notes on flexible sequential block iterative methods (Q2293554) (← links)
- Elasticity \(\mathcal{M} \)-tensors and the strong ellipticity condition (Q2293917) (← links)
- Projected randomized Kaczmarz methods (Q2297173) (← links)
- Dykstra's splitting and an approximate proximal point algorithm for minimizing the sum of convex functions (Q2322367) (← links)
- Rapid, robust, and reliable blind deconvolution via nonconvex optimization (Q2330939) (← links)
- Strict Fejér monotonicity by superiorization of feasibility-seeking projection methods (Q2346394) (← links)
- Optimal design of multiphase composites under elastodynamic loading (Q2414625) (← links)
- Set intersection problems: supporting hyperplanes and quadratic programming (Q2515044) (← links)
- Low-rank nonnegative tensor approximation via alternating projections and sketching (Q2685220) (← links)
- Convolutional wasserstein distances (Q2802296) (← links)
- Convergence Rate Analysis for Averaged Fixed Point Iterations in Common Fixed Point Problems (Q2954171) (← links)
- Distributed Deterministic Asynchronous Algorithms in Time-Varying Graphs Through Dykstra Splitting (Q4624929) (← links)
- Sampled Tikhonov regularization for large linear inverse problems (Q4973539) (← links)
- Weak, Strong, and Linear Convergence of a Double-Layer Fixed Point Algorithm (Q4976159) (← links)
- Sampled limited memory methods for massive linear inverse problems (Q5000590) (← links)
- Metric-Constrained Optimization for Graph Clustering Algorithms (Q5025762) (← links)
- On the optimal separating hyperplane for arbitrary sets: a generalization of the SVM formulation and a convex hull approach (Q5034937) (← links)
- (Q5055095) (← links)
- A Computational Framework for Solving Nonlinear Binary Optimization Problems in Robust Causal Inference (Q5060782) (← links)
