scientific article; zbMATH DE number 3229228

zbMATH Open0142.16804MaRDI QIDQ5517433FDOQ5517433

Authors: L. M. Bregman 

Publication date: 1965

Title of this publication is not available (Why is that?)

zbMATH Keywords

operations research

Cited In (only showing first 100 items - show all)

• Projection algorithms for linear programming
• About subtransversality of collections of sets
• A contraction proximal point algorithm with two monotone operators
• A simple algorithm for computing projection onto intersection of finite level sets
• A finite steps algorithm for solving convex feasibility problems
• A proximal point method involving two resolvent operators
• Linear convergence of the generalized Douglas-Rachford algorithm for feasibility problems
• New iterative methods for linear inequalities
• Cyclic projections in Hadamard spaces
• A new proximal point iteration that converges weakly but not in norm
• Linear convergence of projection algorithms
• Iterative selection methods for common fixed point problems
• Alternating projections in CAT(0) spaces
• Optimization of gene-environment networks in the presence of errors and uncertainty with Chebychev approximation
• Iterative methods for the computation of fixed points of demicontractive mappings
• Weak, strong, and linear convergence of a double-layer fixed point algorithm
• On the regularity condition in a convex feasibility problem
• Proximal splitting methods in signal processing
• About intrinsic transversality of pairs of sets
• A von Neumann alternating method for finding common solutions to variational inequalities
• Image recovery by convex combinations of projections
• Phase retrieval via matrix completion
• Quantitative inconsistent feasibility for averaged mappings
• On the effectiveness of projection methods for convex feasibility problems with linear inequality constraints
• A modular string averaging procedure for solving the common fixed point problem for quasi-nonexpansive mappings in Hilbert space
• On the method of alternating resolvents
• Monotonicity of Mangasarian's iterative algorithm for generalized linear complementarity problems
• Local linear convergence for alternating and averaged nonconvex projections
• Method of successive projections for finding a common point of sets in metric spaces
• Hilbertian convex feasibility problem: Convergence of projection methods
• The asymptotic behavior of the composition of two resolvents
• An iterative method for the extrapolation of band-limited functions
• A block coordinate variable metric forward-backward algorithm
• A generalized contraction proximal point algorithm with two monotone operators
• A note on alternating projections in Hilbert space
• A note on the behavior of the randomized Kaczmarz algorithm of Strohmer and Vershynin
• Projection and proximal point methods: Convergence results and counterexamples.
• An alternating projection that does not converge in norm
• The problem of image recovery by the metric projections in Banach spaces
• Summed squared distance error reduction by simultaneous multiprojections and applications
• Incorporation of a priori moment information into signal recovery and synthesis problems
• The rate of convergence for the cyclic projections algorithm. III: Regularity of convex sets
• Approximation common zero of two accretive operators in Banach spaces
• On Dykstra's algorithm: finite convergence, stalling, and the method of alternating projections
• On the Mann-type iteration and the convex feasibility problem
• A comparison of Fourier extrapolation methods for numerical solution of deconvolution
• Minimizing the Moreau envelope of nonsmooth convex functions over the fixed point set of certain quasi-nonexpansive mappings
• Wavelet domain signal deconvolution with singularity-preserving regularization
• The Douglas-Rachford algorithm for convex and nonconvex feasibility problems
• A cyclic Douglas-Rachford iteration scheme
• On optimization, dynamics and uncertainty: A tutorial for gene-environment networks
• Random products of contractions in metric and Banach spaces
• Single projection Kaczmarz extended algorithms
• The rate of convergence for the cyclic projections algorithm. I: Angles between convex sets
• Steered sequential projections for the inconsistent convex feasibility problem
• Projection methods for quantum channel construction
• Linear complementarity problems solvable by A single linear program
• Transversality and alternating projections for nonconvex sets
• Strongly relatively nonexpansive sequences generated by firmly nonexpansive-like mappings
• On stable least squares solution to the system of linear inequalities
• Numerical methods for solving some matrix feasibility problems
• Convergence of selections with applications in optimization
• Contraction and uniform convergence of isotonic regression
• A note on alternating projections for ill-posed semidefinite feasibility problems
• The rate of convergence for the cyclic projections algorithm. II: Norms of nonlinear operators
• Extrapolation algorithm for affine-convex feasibility problems
• Strong convergence to a solution of a variational inequality problem in Banach spaces
• The composition of projections onto closed convex sets in Hilbert space is asymptotically regular
• Alternating projections on nontangential manifolds
• Scalable Bayesian uncertainty quantification in imaging inverse problems via convex optimization
• Alternating projection method for intersection of convex sets, multi-agent consensus algorithms, and averaging inequalities
• On Cluster-Aware Supervised Learning: Frameworks, Convergent Algorithms, and Applications
• Asymptotic behavior of a periodic sequence of nonexpansive mappings with applications
• On phase retrieval via matrix completion and the estimation of low rank PSD matrices
• -CONVERGENCES OF WEIGHTED AVERAGED PROJECTIONS IN SPACES
• New POCS algorithms for regularization of inverse problems
• Approximate solution of zero point problem involving \(H\)-accretive maps in Banach spaces and applications
• Weak limits of consecutive projections and of greedy steps
• Envelope functions: unifications and further properties
• Regularity of sets under a reformulation in a product space with reduced dimension
• Method of alternating projections for the general absolute value equation
• Title not available (Why is that?)
• Entropic perturbation method for solving a system of linear inequalities
• An iteration scheme for a family of multivalued mappings in CAT(0) spaces with an application to image recovery
• Projection with \(\epsilon\)-depth and its application to the solution of homogeneous systems of linear inequalities
• Linear regularity and linear convergence of projection-based methods for solving convex feasibility problems
• Structure-preserving function approximation via convex optimization
• The geometry of monotone operator splitting methods
• Title not available (Why is that?)
• The combination projection method for solving convex feasibility problems
• Error bounds for parametric polynomial systems with applications to higher-order stability analysis and convergence rates
• Old and new challenges in Hadamard spaces
• Phase retrieval with one or two diffraction patterns by alternating projections with the null initialization
• Convex feasibility problems on uniformly convex metric spaces
• SURVEY: SIXTY YEARS OF DOUGLAS–RACHFORD
• Convergence of sequential parafirmly nonexpansive mappings in reflexive Banach spaces
• Approximation of common fixed points and the solution of image recovery problem
• A family of projection gradient methods for solving the multiple-sets split feasibility problem
• Iterative Fejér processes in ill-posed problems
• Piecewise linear retractions by reflexion

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5517433)