scientific article

Publication date: 7 October 2011

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

algorithm convergence stopping criteria Hilbert space convergence acceleration textbook convex set alternating projection method linear varieties intersection of several given sets

Mathematics Subject Classification ID

General theory of numerical analysis in abstract spaces (65J05) Research exposition (monographs, survey articles) pertaining to numerical analysis (65-02) Computer aspects of numerical algorithms (65Y99)

Related Items

On the optimal separating hyperplane for arbitrary sets: a generalization of the SVM formulation and a convex hull approach, Finding a best approximation pair of points for two polyhedra, Product of two positive contractions, A modular string averaging procedure for solving the common fixed point problem for quasi-nonexpansive mappings in Hilbert space, Anderson acceleration of the alternating projections method for computing the nearest correlation matrix, Optimal rates of linear convergence of relaxed alternating projections and generalized Douglas-Rachford methods for two subspaces, A Computational Framework for Solving Nonlinear Binary Optimization Problems in Robust Causal Inference, Some convergence strategies for the alternating generalized projection method, A convex optimization approach for solving large scale linear systems, Computationally efficient approach for the minimization of volume constrained vector-valued Ginzburg-Landau energy functional, Rates of convergence of randomized Kaczmarz algorithms in Hilbert spaces, A real-time iterative projection scheme for solving the common fixed point problem and its applications, Multimaterial topology optimization by volume constrained Allen-Cahn system and regularized projected steepest descent method, A splitting method for finding the resolvent of the sum of two maximal monotone operators, Optimal design of multiphase composites under elastodynamic loading, A low-cost alternating projection approach for a continuous formulation of convex and cardinality constrained optimization, Convergence Rate Analysis for Averaged Fixed Point Iterations in Common Fixed Point Problems, Multi-dimensional summation-by-parts operators for general function spaces: theory and construction, Convergence and perturbation resilience of dynamic string-averaging projection methods, Alternating cyclic vector extrapolation technique for accelerating nonlinear optimization algorithms and fixed-point mapping applications, Duality and nonlinear graph Laplacians, Low-rank nonnegative tensor approximation via alternating projections and sketching, On sequential multiscale inversion and data assimilation, Unnamed Item, Low rank matrix completion by alternating steepest descent methods, Worst-case complexity of cyclic coordinate descent: \(O(n^2)\) gap with randomized version, Distributed Deterministic Asynchronous Algorithms in Time-Varying Graphs Through Dykstra Splitting, Column-oriented algebraic iterative methods for nonnegative constrained least squares problems, Accelerating the alternating projection algorithm for the case of affine subspaces using supporting hyperplanes, Iterative algorithm for solving a class of convex feasibility problem, On biunimodular vectors for unitary matrices, Projection methods for quantum channel construction, Error minimizing relaxation strategies in Landweber and Kaczmarz type iterations, Unnamed Item, Alternating projection method for doubly stochastic inverse eigenvalue problems with partial eigendata, A new projection method for finding the closest point in the intersection of convex sets, A cyclic Douglas-Rachford iteration scheme, Convergence acceleration of Kaczmarz's method, Alternating oblique projections for coupled linear systems, Optimal rates of linear convergence of the averaged alternating modified reflections method for two subspaces, Markov chain lumpability and applications to credit risk modelling in compliance with the International Financial Reporting Standard 9 framework, An acceleration scheme for Dykstra's algorithm, On the coupled continuous knapsack problems: projection onto the volume constrained Gibbs \(N\)-simplex, Convolutional wasserstein distances, Set intersection problems: supporting hyperplanes and quadratic programming, Notes on flexible sequential block iterative methods, Elasticity \(\mathcal{M} \)-tensors and the strong ellipticity condition, Projected randomized Kaczmarz methods, Unnamed Item, Sampled Tikhonov regularization for large linear inverse problems, Weak, Strong, and Linear Convergence of a Double-Layer Fixed Point Algorithm, Scalable Bayesian Uncertainty Quantification in Imaging Inverse Problems via Convex Optimization, Dykstra's splitting and an approximate proximal point algorithm for minimizing the sum of convex functions, Multi-step greedy Kaczmarz algorithms with simple random sampling for solving large linear systems, Sampled limited memory methods for massive linear inverse problems, Rapid, robust, and reliable blind deconvolution via nonconvex optimization, The Supporting Halfspace--Quadratic Programming Strategy for the Dual of the Best Approximation Problem, The superiorization method with restarted perturbations for split minimization problems with an application to radiotherapy treatment planning, Strict Fejér monotonicity by superiorization of feasibility-seeking projection methods, Generating Correlation Matrices With Specified Eigenvalues Using the Method of Alternating Projections, Metric-Constrained Optimization for Graph Clustering Algorithms