On the public citation graph
Decomposition through formalization in a product space
0 signed · 253 inferred · view as graph
Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.
Is this your work? Sign in with ORCID and put your name on the
claims that are yours.
Reference health. See whether every reference in this work resolves to a
known work and none has been retracted — and get a dated CiteStamped
badge you can embed.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1007/3-540-07623-9_288openalex-snapshot
Eclatement de contraintes en parallele pour la minimisation d'une forme quadratique
inferredcites →https://doi.org/10.1007/bf01585003openalex-snapshot
An iterative method, having linear rate of convergence, for solving a pair of dual linear programs
inferredcites →https://doi.org/10.1007/bfb0066681openalex-snapshot
Methodes Duales pour le Calcul du Minimum d'une Fonction Convexe sur une Intersection de Convexes
inferredcites →https://doi.org/10.1007/bfb0066683openalex-snapshot
Eclatement et Decentralisation en Calcul des Variations
inferredcites →https://doi.org/10.1016/0041-5553(63)90460-9openalex-snapshot
Self-organizing systems and the abstract theory of automata
inferredcites →https://doi.org/10.1016/0041-5553(63)90463-4openalex-snapshot
On a relaxation method of solving systems of linear inequalities
inferredcites →https://doi.org/10.1016/0041-5553(67)90113-9openalex-snapshot
The method of projections for finding the common point of convex sets
inferredcites →https://doi.org/10.1016/0307-904x(76)90037-8openalex-snapshot
Large scale systems theory and applications
inferredcites →https://doi.org/10.1016/s0076-5392(08)x6134-xopenalex-snapshot
Theory of Hierarchical, Multilevel, Systems
inferredcites →https://doi.org/10.1016/s1474-6670(17)67353-1openalex-snapshot
Crossing of Algorithms in Decomposition Methods
inferredcites →https://doi.org/10.1051/m2an/196802r300131openalex-snapshot
Sur l'analogie entre les méthodes de régularisation et de pénalisation
inferredcites →https://doi.org/10.1090/s0002-9947-1979-0517685-5openalex-snapshot
Symmetrized Separable Convex Programming
inferredcites →https://doi.org/10.1108/ir.1999.04926fae.001openalex-snapshot
Lecture Notes in Computer Science 1205
inferredcites →https://doi.org/10.1109/tssc.1968.300143openalex-snapshot
Parametric Optimization by Primal Method in Multilevel Systems
inferredcites →https://doi.org/10.1137/0106002openalex-snapshot
An Application of Linear Programming to Curve Fitting
inferredcites →https://doi.org/10.1137/0108053openalex-snapshot
The Cutting-Plane Method for Solving Convex Programs
inferredcites →https://doi.org/10.1137/0312047openalex-snapshot
Methodes de Decomposition pour la Minimisation d’une Fonction sur un Espace Produit
inferredcites →https://doi.org/10.1137/0314056openalex-snapshot
Monotone Operators and the Proximal Point Algorithm
inferredcites →https://doi.org/10.1287/moor.5.3.388openalex-snapshot
The Relaxation Method for Solving Systems of Linear Inequalities
inferredcites →https://doi.org/10.24033/bsmf.1625openalex-snapshot
Proximité et dualité dans un espace hilbertien
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/mop.20006openalex-snapshot
Solution of “switched element” array synthesis problems using the parallel generalized projection algorithm
inferred← citeshttps://doi.org/10.1002/mrm.20285openalex-snapshot
POCSENSE: POCS‐based reconstruction for sensitivity encoded magnetic resonance imaging
inferred← citeshttps://doi.org/10.1002/nla.2444openalex-snapshot
Fast randomized tensor singular value thresholding for low‐rank tensor optimization
inferred← citeshttps://doi.org/10.1002/nla.70066openalex-snapshot
Robust Quaternion Matrix Completion via Fast Randomized Low‐Rank Approximation
inferred← citeshttps://doi.org/10.1006/jath.1994.1136openalex-snapshot
Dykstra′s Alternating Projection Algorithm for Two Sets
inferred← citeshttps://doi.org/10.1007/978-1-4419-9569-8_10openalex-snapshot
Proximal Splitting Methods in Signal Processing
inferred← citeshttps://doi.org/10.1007/978-1-4419-9569-8_17openalex-snapshot
Minimizing the Moreau Envelope of Nonsmooth Convex Functions over the Fixed Point Set of Certain Quasi-Nonexpansive Mappings
inferred← citeshttps://doi.org/10.1007/978-3-030-36568-4_5openalex-snapshot
Comparing Averaged Relaxed Cutters and Projection Methods: Theory and Examples
inferred← citeshttps://doi.org/10.1007/978-3-030-87502-2_66openalex-snapshot
Centering Projection Methods for Wavelet Feasibility Problems
inferred← citeshttps://doi.org/10.1007/978-3-319-97478-1_1openalex-snapshot
Large-Scale and Distributed Optimization: An Introduction
inferred← citeshttps://doi.org/10.1007/978-3-642-30901-4openalex-snapshot
Iterative Methods for Fixed Point Problems in Hilbert Spaces
inferred← citeshttps://doi.org/10.1007/978-3-642-30901-4_3openalex-snapshot
Convergence of Iterative Methods
inferred← citeshttps://doi.org/10.1007/978-3-642-30901-4_4openalex-snapshot
Algorithmic Projection Operators
inferred← citeshttps://doi.org/10.1007/bf00939552openalex-snapshot
Strong convergence of projection-like methods in Hilbert spaces
inferred← citeshttps://doi.org/10.1007/bf00941285openalex-snapshot
Decomposition method of descent for minimizing the sum of convex nonsmooth functions
inferred← citeshttps://doi.org/10.1007/bf01027691openalex-snapshot
On the convergence of von Neumann's alternating projection algorithm for two sets
inferred← citeshttps://doi.org/10.1007/bf01582891openalex-snapshot
On the convergence of Han's method for convex programming with quadratic objective
inferred← citeshttps://doi.org/10.1007/bf02017349openalex-snapshot
Relaxed outer projections, weighted averages and convex feasibility
inferred← citeshttps://doi.org/10.1007/bf02142692openalex-snapshot
A multiprojection algorithm using Bregman projections in a product space
inferred← citeshttps://doi.org/10.1007/bf02591749openalex-snapshot
Asymmetric variational inequality problems over product sets: Applications and iterative methods
inferred← citeshttps://doi.org/10.1007/bf02614077openalex-snapshot
A cyclic projection algorithm via duality
inferred← citeshttps://doi.org/10.1007/bf02683333openalex-snapshot
Hilbertian Convex Feasibility Problem: Convergence of Projection Methods
inferred← citeshttps://doi.org/10.1007/bfb0035467openalex-snapshot
Projection onto an acute cone and convex feasibility problem
inferred← citeshttps://doi.org/10.1007/s00186-019-00691-9openalex-snapshot
The Douglas–Rachford algorithm for convex and nonconvex feasibility problems
inferred← citeshttps://doi.org/10.1007/s00211-021-01207-6openalex-snapshot
On the method of reflections
inferred← citeshttps://doi.org/10.1007/s00723-023-01584-1openalex-snapshot
In Vivo Myelin Water Quantification Using Diffusion–Relaxation Correlation MRI: A Comparison of 1D and 2D Methods
inferred← citeshttps://doi.org/10.1007/s10013-018-0278-yopenalex-snapshot
About Extensions of the Extremal Principle
inferred← citeshttps://doi.org/10.1007/s10092-024-00628-7openalex-snapshot
Efficient randomized block Kaczmarz method for linear feasibility
inferred← citeshttps://doi.org/10.1007/s10107-014-0759-zopenalex-snapshot
Set intersection problems: supporting hyperplanes and quadratic programming
inferred← citeshttps://doi.org/10.1007/s10107-023-01978-wopenalex-snapshot
On the centralization of the circumcentered-reflection method
inferred← citeshttps://doi.org/10.1007/s10208-008-9036-yopenalex-snapshot
Local Linear Convergence for Alternating and Averaged Nonconvex Projections
inferred← citeshttps://doi.org/10.1007/s10444-021-09861-yopenalex-snapshot
Convex combination of alternating projection and Douglas–Rachford operators for phase retrieval
inferred← citeshttps://doi.org/10.1007/s10492-014-0040-zopenalex-snapshot
A new simultaneous subgradient projection algorithm for solving a multiple-sets split feasibility problem
inferred← citeshttps://doi.org/10.1007/s10589-007-9073-5openalex-snapshot
How good are projection methods for convex feasibility problems?
inferred← citeshttps://doi.org/10.1007/s10589-011-9401-7openalex-snapshot
On the effectiveness of projection methods for convex feasibility problems with linear inequality constraints
inferred← citeshttps://doi.org/10.1007/s10589-011-9414-2openalex-snapshot
How good are extrapolated bi-projection methods for linear feasibility problems?
inferred← citeshttps://doi.org/10.1007/s10589-015-9768-yopenalex-snapshot
An acceleration scheme for Dykstra’s algorithm
inferred← citeshttps://doi.org/10.1007/s10589-017-9942-5openalex-snapshot
A new projection method for finding the closest point in the intersection of convex sets
inferred← citeshttps://doi.org/10.1007/s10589-021-00275-6openalex-snapshot
The circumcentered-reflection method achieves better rates than alternating projections
inferred← citeshttps://doi.org/10.1007/s10589-021-00291-6openalex-snapshot
Strengthened splitting methods for computing resolvents
inferred← citeshttps://doi.org/10.1007/s10589-022-00395-7openalex-snapshot
A product space reformulation with reduced dimension for splitting algorithms
inferred← citeshttps://doi.org/10.1007/s10589-023-00516-wopenalex-snapshot
A successive centralized circumcentered-reflection method for the convex feasibility problem
inferred← citeshttps://doi.org/10.1007/s10878-018-0250-5openalex-snapshot
A feasibility approach for constructing combinatorial designs of circulant type
inferred← citeshttps://doi.org/10.1007/s10898-019-00744-7openalex-snapshot
The Douglas–Rachford algorithm for a hyperplane and a doubleton
inferred← citeshttps://doi.org/10.1007/s10898-019-00867-xopenalex-snapshot
An enhanced formulation for solving graph coloring problems with the Douglas–Rachford algorithm
inferred← citeshttps://doi.org/10.1007/s10957-017-1113-4openalex-snapshot
The Forward–Backward Algorithm and the Normal Problem
inferred← citeshttps://doi.org/10.1007/s10957-019-01481-3openalex-snapshot
Computing the Resolvent of the Sum of Maximally Monotone Operators with the Averaged Alternating Modified Reflections Algorithm
inferred← citeshttps://doi.org/10.1007/s10957-019-01512-zopenalex-snapshot
Dykstra’s Splitting and an Approximate Proximal Point Algorithm for Minimizing the Sum of Convex Functions
inferred← citeshttps://doi.org/10.1007/s10957-021-01878-zopenalex-snapshot
Constraint Reduction Reformulations for Projection Algorithms with Applications to Wavelet Construction
inferred← citeshttps://doi.org/10.1007/s11075-005-9010-6openalex-snapshot
Extrapolation algorithm for affine-convex feasibility problems
inferred← citeshttps://doi.org/10.1007/s11075-011-9490-5openalex-snapshot
Algorithms for the Split Variational Inequality Problem
inferred← citeshttps://doi.org/10.1007/s11075-015-0045-zopenalex-snapshot
A modular string averaging procedure for solving the common fixed point problem for quasi-nonexpansive mappings in Hilbert space
inferred← citeshttps://doi.org/10.1007/s11075-017-0310-4openalex-snapshot
Convergence properties of dynamic string-averaging projection methods in the presence of perturbations
inferred← citeshttps://doi.org/10.1007/s11075-017-0449-zopenalex-snapshot
Iterative algorithms for solving fixed point problems and variational inequalities with uniformly continuous monotone operators
inferred← citeshttps://doi.org/10.1007/s11075-020-00941-6openalex-snapshot
On the circumcentered-reflection method for the convex feasibility problem
inferred← citeshttps://doi.org/10.1007/s11075-021-01143-4openalex-snapshot
On a fast deterministic block Kaczmarz method for solving large-scale linear systems
inferred← citeshttps://doi.org/10.1007/s11075-022-01405-9openalex-snapshot
A primal-dual splitting algorithm for composite monotone inclusions with minimal lifting
inferred← citeshttps://doi.org/10.1007/s11075-022-01430-8openalex-snapshot
A dynamic distributed conjugate gradient method for variational inequality problem over the common fixed-point constraints
inferred← citeshttps://doi.org/10.1007/s11075-023-01533-wopenalex-snapshot
Polynomial estimates for the method of cyclic projections in Hilbert spaces
inferred← citeshttps://doi.org/10.1007/s11075-023-01623-9openalex-snapshot
Strict pseudocontractions and demicontractions, their properties, and applications
inferred← citeshttps://doi.org/10.1007/s11228-011-0192-xopenalex-snapshot
Common Solutions to Variational Inequalities
inferred← citeshttps://doi.org/10.1007/s11228-017-0461-4openalex-snapshot
Solving Graph Coloring Problems with the Douglas-Rachford Algorithm
inferred← citeshttps://doi.org/10.1007/s11228-021-00626-9openalex-snapshot
Circumcentering Reflection Methods for Nonconvex Feasibility Problems
inferred← citeshttps://doi.org/10.1007/s11228-022-00631-6openalex-snapshot
A Direct Proof of Convergence of Davis–Yin Splitting Algorithm Allowing Larger Stepsizes
inferred← citeshttps://doi.org/10.1007/s11228-023-00678-zopenalex-snapshot
Resolvent and Proximal Compositions
inferred← citeshttps://doi.org/10.1007/s11228-023-00702-2openalex-snapshot
Regularity of Sets Under a Reformulation in a Product Space with Reduced Dimension
inferred← citeshttps://doi.org/10.1007/s11263-013-0611-6openalex-snapshot
Linearized Alternating Direction Method with Adaptive Penalty and Warm Starts for Fast Solving Transform Invariant Low-Rank Textures
inferred← citeshttps://doi.org/10.1007/s11766-014-3070-0openalex-snapshot
Bi-extrapolated subgradient projection algorithm for solving multiple-sets split feasibility problem
inferred← citeshttps://doi.org/10.1016/0024-3795(90)90203-oopenalex-snapshot
On the asymtotic behavior of some alternate smoothing series expansion iterative methods
inferred← citeshttps://doi.org/10.1016/0024-3795(93)00089-iopenalex-snapshot
Block-iterative surrogate projection methods for convex feasibility problems
inferred← citeshttps://doi.org/10.1016/0096-3003(93)90077-ropenalex-snapshot
Weak and norm convergence of a parallel projection method in Hilbert spaces
inferred← citeshttps://doi.org/10.1016/0168-9274(87)90028-6openalex-snapshot
On some optimization techniques in image reconstruction from projections
inferred← citeshttps://doi.org/10.1016/0377-0427(92)00123-qopenalex-snapshot
Strong convergence of almost simultaneous block-iterative projection methods in Hilbert spaces
inferred← citeshttps://doi.org/10.1016/b978-0-12-801522-3.00008-2openalex-snapshot
Parameter Learning
inferred← citeshttps://doi.org/10.1016/b978-0-12-818803-3.00017-9openalex-snapshot
Parameter Learning: a Convex Analytic Path
inferred← citeshttps://doi.org/10.1016/b978-0-44-329238-5.00014-7openalex-snapshot
Parameter learning: a convex analytic path
inferred← citeshttps://doi.org/10.1016/b978-012119792-6/50108-xopenalex-snapshot
Recovery Methods for Postprocessing of Compressed Images
inferred← citeshttps://doi.org/10.1016/j.amc.2022.127627openalex-snapshot
The superiorization method with restarted perturbations for split minimization problems with an application to radiotherapy treatment planning
inferred← citeshttps://doi.org/10.1016/j.jat.2003.08.004openalex-snapshot
Finding the projection of a point onto the intersection of convex sets via projections onto half-spaces
inferred← citeshttps://doi.org/10.1016/j.jat.2008.04.001openalex-snapshot
The rate of convergence for the cyclic projections algorithm III: Regularity of convex sets
inferred← citeshttps://doi.org/10.1016/j.jat.2012.01.001openalex-snapshot
Convergence of non-periodic infinite products of orthogonal projections and nonexpansive operators in Hilbert space
inferred← citeshttps://doi.org/10.1016/j.jat.2017.08.005openalex-snapshot
The optimal error bound for the method of simultaneous projections
inferred← citeshttps://doi.org/10.1016/j.jat.2021.105648openalex-snapshot
Error bounds for the method of simultaneous projections with infinitely many subspaces
inferred← citeshttps://doi.org/10.1016/j.jmaa.2006.05.010openalex-snapshot
Perturbed projections and subgradient projections for the multiple-sets split feasibility problem
inferred← citeshttps://doi.org/10.1016/j.jmaa.2009.07.012openalex-snapshot
Metric subregularity and the proximal point method
inferred← citeshttps://doi.org/10.1016/j.laa.2014.11.035openalex-snapshot
Accelerating the alternating projection algorithm for the case of affine subspaces using supporting hyperplanes
inferred← citeshttps://doi.org/10.1016/j.laa.2016.07.023openalex-snapshot
Projection on the intersection of convex sets
inferred← citeshttps://doi.org/10.1016/j.na.2007.06.003openalex-snapshot
Visco-penalization of the sum of two monotone operators
inferred← citeshttps://doi.org/10.1016/j.na.2009.10.027openalex-snapshot
Coincidence points by generalized Mann iterates with applications in Hilbert spaces
inferred← citeshttps://doi.org/10.1016/j.orl.2016.03.010openalex-snapshot
The Douglas–Rachford algorithm in the affine-convex case
inferred← citeshttps://doi.org/10.1016/s0022-247x(02)00221-4openalex-snapshot
Generalized Mann iterates for constructing fixed points in Hilbert spaces
inferred← citeshttps://doi.org/10.1016/s0096-3003(00)00144-2openalex-snapshot
Summed squared distance error reduction by simultaneous multiprojections and applications
inferred← citeshttps://doi.org/10.1016/s0167-8191(00)00100-9openalex-snapshot
Component averaging: An efficient iterative parallel algorithm for large and sparse unstructured problems
inferred← citeshttps://doi.org/10.1016/s1076-5670(08)70157-5openalex-snapshot
The Convex Feasibility Problem in Image Recovery
inferred← citeshttps://doi.org/10.1016/s1570-579x(01)80009-4openalex-snapshot
Averaging Strings of Sequential Iterations for Convex Feasibility Problems
inferred← citeshttps://doi.org/10.1016/s1570-579x(01)80010-0openalex-snapshot
Quasi-Fejérian Analysis of Some Optimization Algorithms
inferred← citeshttps://doi.org/10.1016/s1570-579x(01)80012-4openalex-snapshot
From Parallel to Sequential Projection Methods and Vice Versa in Convex Feasibility: Results and Conjectures
inferred← citeshttps://doi.org/10.1016/s1570-579x(01)80013-6openalex-snapshot
Accelerating the Convergence of the Method of Alternating Projections Via a Line Search: a Brief Survey
inferred← citeshttps://doi.org/10.1016/s1570-579x(01)80017-3openalex-snapshot
Superlinear Rate of Convergence and Optimal Acceleration Schemes in the Solution of Convex Inequality Problems
inferred← citeshttps://doi.org/10.1016/s1570-579x(01)80028-8openalex-snapshot
The Hybrid Steepest Descent Method for the Variational Inequality Problem Over the Intersection of Fixed Point Sets of Nonexpansive Mappings
inferred← citeshttps://doi.org/10.1017/s1446181118000391openalex-snapshot
APPLICATION OF PROJECTION ALGORITHMS TO DIFFERENTIAL EQUATIONS: BOUNDARY VALUE PROBLEMS
inferred← citeshttps://doi.org/10.1017/s1446788719000570openalex-snapshot
SURVEY: SIXTY YEARS OF DOUGLAS–RACHFORD
inferred← citeshttps://doi.org/10.1023/a:1013349430987openalex-snapshot
Proximity Function Minimization Using Multiple Bregman Projections, with Applications to Split Feasibility and Kullback–Leibler Distance Minimization
inferred← citeshttps://doi.org/10.1051/m2an/1993270303751openalex-snapshot
Partial regularization of the sum of two maximal monotone operators
inferred← citeshttps://doi.org/10.1051/ro/2015065openalex-snapshot
A survey on operator splitting and decomposition of convex programs
inferred← citeshttps://doi.org/10.1080/00036819708840536openalex-snapshot
Solving convex feasibility problems by a parallel projection method with geometrically-defined parameters
inferred← citeshttps://doi.org/10.1080/01630563.2011.591954openalex-snapshot
Unconstrained Optimization Techniques for the Acceleration of Alternating Projection Methods
inferred← citeshttps://doi.org/10.1080/01630563.2021.2006695openalex-snapshot
On Componental Operators in Hilbert Space
inferred← citeshttps://doi.org/10.1080/01630569508816635openalex-snapshot
Strong convergence of expected-projection methods in hilbert spaces
inferred← citeshttps://doi.org/10.1080/01630569608816731openalex-snapshot
Solving stochastic convex feasibility problems in hilbert spaces
inferred← citeshttps://doi.org/10.1080/01630569808816813openalex-snapshot
Minimizing certain convex functions over the intersection of the fixed point sets of nonexpansive mappings
inferred← citeshttps://doi.org/10.1080/01630569808816822openalex-snapshot
Quadratic optimization of fixed points of nonexpansive mappings in hubert space
inferred← citeshttps://doi.org/10.1080/02331934.2018.1512108openalex-snapshot
On the strong convergence of sequences of Halpern type in Hilbert spaces
inferred← citeshttps://doi.org/10.1080/02331934.2018.1512109openalex-snapshot
Linear convergence rates for extrapolated fixed point algorithms
inferred← citeshttps://doi.org/10.1080/02331934.2020.1839068openalex-snapshot
A splitting method for finding the resolvent of the sum of two maximal monotone operators
inferred← citeshttps://doi.org/10.1080/02331939608844225openalex-snapshot
Iterations of paracontractions and firmaly nonexpansive operators with applications to feasibility and optimization
inferred← citeshttps://doi.org/10.1080/10556780310001610484openalex-snapshot
Convergence of String-Averaging Projection Schemes for Inconsistent Convex Feasibility Problems
inferred← citeshttps://doi.org/10.1080/10556788.2014.902056openalex-snapshot
Distributed solutions for loosely coupled feasibility problems using proximal splitting methods
inferred← citeshttps://doi.org/10.1080/10556788.2016.1209500openalex-snapshot
Convergence of string-averaging method for a class of operators
inferred← citeshttps://doi.org/10.1080/10556788.2018.1504049openalex-snapshot
The cyclic Douglas–Rachford algorithm with r-sets-Douglas–Rachford operators
inferred← citeshttps://doi.org/10.1080/10556788.2021.1998492openalex-snapshot
Stochastic block projection algorithms with extrapolation for convex feasibility problems
inferred← citeshttps://doi.org/10.1081/nfa-120003670openalex-snapshot
PARALLEL ALGORITHMS FOR FINDING COMMON FIXED POINTS OF PARACONTRACTIONS
inferred← citeshttps://doi.org/10.1081/nfa-200045806openalex-snapshot
Adaptive Projected Subgradient Method for Asymptotic Minimization of Sequence of Nonnegative Convex Functions
inferred← citeshttps://doi.org/10.1088/0266-5611/26/5/055007openalex-snapshot
The split common fixed-point problem for demicontractive mappings
inferred← citeshttps://doi.org/10.1088/0266-5611/26/6/065008openalex-snapshot
Perturbation resilience and superiorization of iterative algorithms
inferred← citeshttps://doi.org/10.1088/1361-6420/33/4/044003openalex-snapshot
Nonexpansiveness of a linearized augmented Lagrangian operator for hierarchical convex optimization
inferred← citeshttps://doi.org/10.1088/1361-6420/ab551eopenalex-snapshot
Linearly involved generalized Moreau enhanced models and their proximal splitting algorithm under overall convexity condition
inferred← citeshttps://doi.org/10.1088/1361-6420/ac3322openalex-snapshot
Projection methods for high numerical aperture phase retrieval
inferred← citeshttps://doi.org/10.1090/conm/636/12731openalex-snapshot
Reformulating the Pascoletti-Serafini Problem as a Bi-Level Optimization Problem
inferred← citeshttps://doi.org/10.1090/s0002-9947-1995-1277105-1openalex-snapshot
Viewing Parallel Projection Methods as Sequential Ones in Convex Feasibility Problems
inferred← citeshttps://doi.org/10.1090/s1061-0022-2012-01202-1openalex-snapshot
The rate of convergence in the method of alternating projections
inferred← citeshttps://doi.org/10.1109/5.214546openalex-snapshot
The foundations of set theoretic estimation
inferred← citeshttps://doi.org/10.1109/78.330356openalex-snapshot
Inconsistent signal feasibility problems: least-squares solutions in a product space
inferred← citeshttps://doi.org/10.1109/78.995065openalex-snapshot
An efficient robust adaptive filtering algorithm based on parallel subgradient projection techniques
inferred← citeshttps://doi.org/10.1109/acssc.2010.5757553openalex-snapshot
Two product-space formulations for unifying multiple metrics in set-theoretic adaptive filtering
inferred← citeshttps://doi.org/10.1109/apsipa.2015.7415442openalex-snapshot
A nonexpansive operator for computationally efficient hierarchical convex optimization
inferred← citeshttps://doi.org/10.1109/ccdc65474.2025.11091074openalex-snapshot
Extrapolated Gradient for Accelerating Online Distributed Stochastic Optimization
inferred← citeshttps://doi.org/10.1109/cvpr.2015.7299078openalex-snapshot
Fast randomized Singular Value Thresholding for Nuclear Norm Minimization
inferred← citeshttps://doi.org/10.1109/icassp.1998.678136openalex-snapshot
A block-iterative quadratic signal recovery algorithm
inferred← citeshttps://doi.org/10.1109/icassp.2001.940652openalex-snapshot
An efficient robust adaptive filtering scheme based on parallel subgradient projection techniques
inferred← citeshttps://doi.org/10.1109/icassp.2001.940679openalex-snapshot
Allpass filter design using projection-based method under group delay constraints
inferred← citeshttps://doi.org/10.1109/icip.1995.537406openalex-snapshot
Constrained image recovery in a product space
inferred← citeshttps://doi.org/10.1109/icip.1996.560371openalex-snapshot
Constrained parallel projection methods for optimal signal estimation and design-constrained inconsistent signal feasibility problems
inferred← citeshttps://doi.org/10.1109/icip.1996.560883openalex-snapshot
Generalized convex set theoretic image recovery
inferred← citeshttps://doi.org/10.1109/icip.1998.727173openalex-snapshot
Super-resolution inducing of an image
inferred← citeshttps://doi.org/10.1109/icosp.2002.1181048openalex-snapshot
An efficient robust stereophonic acoustic echo canceler based on parallel subgradient projection techniques
inferred← citeshttps://doi.org/10.1109/jstsp.2022.3221681openalex-snapshot
Federated Learning Using Three-Operator ADMM
inferred← citeshttps://doi.org/10.1109/msp.2010.938752openalex-snapshot
Adaptive Learning in a World of Projections
inferred← citeshttps://doi.org/10.1109/msp.2024.3379753openalex-snapshot
Holistic Processing of Color Images Using Novel Quaternion-Valued Wavelets on the Plane: A promising transformative tool
inferred← citeshttps://doi.org/10.1109/tap.2004.836408openalex-snapshot
Wide-Band Smart Antenna Design Using Vector Space Projection Methods
inferred← citeshttps://doi.org/10.1109/tpami.2017.2677440openalex-snapshot
Fast Randomized Singular Value Thresholding for Low-Rank Optimization
inferred← citeshttps://doi.org/10.1109/tsp.2007.907896openalex-snapshot
Multiaccess Interference Suppression in Orthogonal Space–Time Block Coded MIMO Systems by Adaptive Projected Subgradient Method
inferred← citeshttps://doi.org/10.1109/tsp.2008.917376openalex-snapshot
Online Kernel-Based Classification Using Adaptive Projection Algorithms
inferred← citeshttps://doi.org/10.1109/tsp.2009.2027771openalex-snapshot
Adaptive Constrained Learning in Reproducing Kernel Hilbert Spaces: The Robust Beamforming Case
inferred← citeshttps://doi.org/10.1109/tsp.2011.2163066openalex-snapshot
Optimal Distributed Beamforming for MISO Interference Channels
inferred← citeshttps://doi.org/10.1109/tsp.2014.2339801openalex-snapshot
Alternating Projections and Douglas-Rachford for Sparse Affine Feasibility
inferred← citeshttps://doi.org/10.1109/tsp.2014.2373318openalex-snapshot
Hierarchical Convex Optimization With Primal-Dual Splitting
inferred← citeshttps://doi.org/10.1109/tsp.2020.3044445openalex-snapshot
Robust Recovery of Jointly-Sparse Signals Using Minimax Concave Loss Function
inferred← citeshttps://doi.org/10.1109/tsp.2021.3069677openalex-snapshot
Fixed Point Strategies in Data Science
inferred← citeshttps://doi.org/10.1109/twc.2021.3068207openalex-snapshot
Efficient Optimization for Large-Scale MIMO-OFDM Spectral Precoding
inferred← citeshttps://doi.org/10.1111/j.1475-3995.2008.00684.xopenalex-snapshot
On the string averaging method for sparse common fixed‐point problems
inferred← citeshttps://doi.org/10.1111/j.1475-3995.2009.00695.xopenalex-snapshot
Perturbation‐resilient block‐iterative projection methods with application to image reconstruction from projections
inferred← citeshttps://doi.org/10.1137/040609458openalex-snapshot
Component-Averaged Row Projections: A Robust, Block-Parallel Scheme for Sparse Linear Systems
inferred← citeshttps://doi.org/10.1137/070689127openalex-snapshot
On The Behavior of Subgradient Projections Methods for Convex Feasibility Problems in Euclidean Spaces
inferred← citeshttps://doi.org/10.1137/070711712openalex-snapshot
Incremental Subgradients for Constrained Convex Optimization: A Unified Framework and New Methods
inferred← citeshttps://doi.org/10.1137/0802021openalex-snapshot
On the Convergence of the Products of Firmly Nonexpansive Mappings
inferred← citeshttps://doi.org/10.1137/15m1034830openalex-snapshot
A Distributed Boyle--Dykstra--Han Scheme
inferred← citeshttps://doi.org/10.1137/16m106090xopenalex-snapshot
The Supporting Halfspace--Quadratic Programming Strategy for the Dual of the Best Approximation Problem
inferred← citeshttps://doi.org/10.1137/16m1087333openalex-snapshot
Weak, Strong, and Linear Convergence of a Double-Layer Fixed Point Algorithm
inferred← citeshttps://doi.org/10.1137/19m1251643openalex-snapshot
Faster Randomized Block Kaczmarz Algorithms
inferred← citeshttps://doi.org/10.1137/20m1358669openalex-snapshot
Infeasibility and Error Bound Imply Finite Convergence of Alternating Projections
inferred← citeshttps://doi.org/10.1137/20m1379344openalex-snapshot
Proximal Splitting Algorithms for Convex Optimization: A Tour of Recent Advances, with New Twists
inferred← citeshttps://doi.org/10.1137/21m1448112openalex-snapshot
Degenerate Preconditioned Proximal Point Algorithms
inferred← citeshttps://doi.org/10.1137/23m1595412openalex-snapshot
A Finitely Convergent Circumcenter Method for the Convex Feasibility Problem
inferred← citeshttps://doi.org/10.1137/24m1638008openalex-snapshot
Splitting the Conditional Gradient Algorithm
inferred← citeshttps://doi.org/10.1137/24m166721xopenalex-snapshot
Forward-Backward Algorithms Devised by Graphs
inferred← citeshttps://doi.org/10.1137/s0036144593251710openalex-snapshot
On Projection Algorithms for Solving Convex Feasibility Problems
inferred← citeshttps://doi.org/10.1137/s0363012902407120openalex-snapshot
Bregman Monotone Optimization Algorithms
inferred← citeshttps://doi.org/10.1137/s0363012902415487openalex-snapshot
An Outer Approximation Method for the Variational Inequality Problem
inferred← citeshttps://doi.org/10.1137/s036301299732626xopenalex-snapshot
Strong Convergence of Block-Iterative Outer Approximation Methods for Convex Optimization
inferred← citeshttps://doi.org/10.1137/s1052623402410557openalex-snapshot
Iterating Bregman Retractions
inferred← citeshttps://doi.org/10.1137/s1052623494278347openalex-snapshot
A Projection-Based Algorithm for Consistent and Inconsistent Constraints
inferred← citeshttps://doi.org/10.1142/s0218001421540185openalex-snapshot
Alternating Primal-Dual Algorithm for Minimizing Multiple-Summed Separable Problems with Application to Image Restoration
inferred← citeshttps://doi.org/10.1155/2012/149508openalex-snapshot
An Extrapolated Iterative Algorithm for Multiple‐Set Split Feasibility Problem
inferred← citeshttps://doi.org/10.1155/s108533750321201xopenalex-snapshot
Iterative algorithms with seminorm‐induced oblique projections
inferred← citeshttps://doi.org/10.11606/d.45.2020.tde-07012021-170531openalex-snapshot
Completamento de matrizes de distâncias Euclidianas
inferred← citeshttps://doi.org/10.1186/s13663-021-00711-6openalex-snapshot
Circumcentering approximate reflections for solving the convex feasibility problem
inferred← citeshttps://doi.org/10.1287/ijoc.2021.1075openalex-snapshot
SDP-Based Bounds for the Quadratic Cycle Cover Problem via Cutting-Plane Augmented Lagrangian Methods and Reinforcement Learning
inferred← citeshttps://doi.org/10.1287/moor.1100.0456openalex-snapshot
Randomized Methods for Linear Constraints: Convergence Rates and Conditioning
inferred← citeshttps://doi.org/10.1364/ao.34.003883openalex-snapshot
Application of serial- and parallel-projection methods to correlation-filter design
inferred← citeshttps://doi.org/10.1364/josaa.16.000149openalex-snapshot
Factors affecting convergence in the design of diffractive optics by iterative vector-space methods
inferred← citeshttps://doi.org/10.1364/josaa.16.001602openalex-snapshot
Signal processing under uncertain conditions by parallel projections onto fuzzy sets
inferred← citeshttps://doi.org/10.1364/ol.20.001172openalex-snapshot
Image restoration by a novel method of parallel projection onto constraint sets
inferred← citeshttps://doi.org/10.14317/jami.2012.30.1_2.093openalex-snapshot
A STRONGLY CONVERGENT PARALLEL PROJECTION ALGORITHM FOR CONVEX FEASIBILITY PROBLEM y
showing the first 200 of 230 · page through all 230
Editorial review for independent work. ICSAC — the Institute for Complexity
Science and Advanced Computing — runs a structured editorial panel for researchers
publishing outside journals, and publishes on CiteStamp rails. Submission is free
and goes through ORCID: icsacinstitute.org/submit.