The following pages link to (Q4718793):
Displaying 50 items.
- Metrics induced by Jensen-Shannon and related divergences on positive definite matrices (Q2656633) (← links)
- Strong convergence of alternating projections (Q2671450) (← links)
- Kaczmarz's anomaly: a surprising feature of Kaczmarz's method (Q2687250) (← links)
- Bregman three-operator splitting methods (Q2696977) (← links)
- Multialgorithms for parallel computing: A new paradigm for optimization (Q2752036) (← links)
- An algorithm with long steps for the simultaneous block projections approach for the linear feasibility problem (Q2766137) (← links)
- Duality and Convex Programming (Q2789804) (← links)
- Convergence of string-averaging method for a class of operators (Q2829581) (← links)
- Opial-Type Theorems and the Common Fixed Point Problem (Q2897281) (← links)
- Proximal Splitting Methods in Signal Processing (Q2897282) (← links)
- Minimizing the Moreau Envelope of Nonsmooth Convex Functions over the Fixed Point Set of Certain Quasi-Nonexpansive Mappings (Q2897289) (← links)
- Set-theoretic adaptive filtering based on data-driven sparsification (Q3100680) (← links)
- Unconstrained Optimization Techniques for the Acceleration of Alternating Projection Methods (Q3114578) (← links)
- Proximal Methods with Penalization Effects in Banach Spaces (Q3157819) (← links)
- Comparing Averaged Relaxed Cutters and Projection Methods: Theory and Examples (Q3298016) (← links)
- The Adaptive Projected Subgradient Method over the Fixed Point Set of Strongly Attracting Nonexpansive Mappings (Q3422786) (← links)
- Parallel Block-Iterative Reconstruction Algorithms for Binary Tomography (Q3439192) (← links)
- Application of Quasi-Nonexpansive Operators to an Iterative Method for Variational Inequality (Q3451760) (← links)
- Linear Convergence of Subgradient Algorithm for Convex Feasibility on Riemannian Manifolds (Q3454509) (← links)
- The Method of Cyclic Intrepid Projections: Convergence Analysis and Numerical Experiments (Q3455009) (← links)
- Decomposition Methods for Sparse Matrix Nearness Problems (Q3456880) (← links)
- Stable Convergence Theorems for Infinite Products and Powers of Nonexpansive Mappings (Q3506285) (← links)
- The Convergence of a Levenberg–Marquardt Method for Nonlinear Inequalities (Q3514746) (← links)
- Block‐iterative algorithms (Q3563613) (← links)
- On the string averaging method for sparse common fixed‐point problems (Q3563615) (← links)
- Perturbation‐resilient block‐iterative projection methods with application to image reconstruction from projections (Q3563617) (← links)
- Approximation Algorithms for Tensor Clustering (Q3648764) (← links)
- (Q4247464) (← links)
- (Q4375663) (← links)
- (Q4388450) (← links)
- Construction of best Bregman approximations in reflexive Banach spaces (Q4425413) (← links)
- Weak Convergence of Orbits of Nonlinear Operators in Reflexive Banach Spaces (Q4435186) (← links)
- Limited recourse in two-stage stochastic linear programs (Q4469157) (← links)
- PARALLEL ALGORITHMS FOR FINDING COMMON FIXED POINTS OF PARACONTRACTIONS (Q4546045) (← links)
- NON-STRICTLY CONVEX MINIMIZATION OVER THE FIXED POINT SET OF AN ASYMPTOTICALLY SHRINKING NONEXPANSIVE MAPPING (Q4546050) (← links)
- (Q4547460) (← links)
- Regularizing with Bregman--Moreau Envelopes (Q4561226) (← links)
- Re-examination of Bregman functions and new properties of their divergences (Q4613995) (← links)
- Choosing the relaxation parameter in sequential block-iterativemethods for linear systems (Q4633311) (← links)
- PRICING SOVEREIGN CONTINGENT CONVERTIBLE DEBT (Q4645326) (← links)
- Convergence of String-Averaging Projection Schemes for Inconsistent Convex Feasibility Problems (Q4653550) (← links)
- Adaptive Projected Subgradient Method for Asymptotic Minimization of Sequence of Nonnegative Convex Functions (Q4678768) (← links)
- Aggregating Large Sets of Probabilistic Forecasts by Weighted Coherent Adjustment (Q4691932) (← links)
- Nesterov perturbations and projection methods applied to IMRT (Q4959911) (← links)
- Weak, Strong, and Linear Convergence of a Double-Layer Fixed Point Algorithm (Q4976159) (← links)
- Perturbed iterative methods for a general family of operators: convergence theory and applications (Q4999746) (← links)
- Sampled limited memory methods for massive linear inverse problems (Q5000590) (← links)
- Distributed Bregman-Distance Algorithms for Min-Max Optimization (Q5023087) (← 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)
