Alternating projection methods.
From MaRDI portal
Publication:3172946
zbMATH Open1275.65031MaRDI QIDQ3172946FDOQ3172946
Publication date: 7 October 2011
Recommendations
convergencealgorithmconvergence accelerationHilbert spaceconvex settextbookstopping criteriaalternating projection methodlinear varietiesintersection of several given sets
Research exposition (monographs, survey articles) pertaining to numerical analysis (65-02) Computer aspects of numerical algorithms (65Y99) General theory of numerical analysis in abstract spaces (65J05)
Cited In (70)
- Alternating projection method for intersection of convex sets, multi-agent consensus algorithms, and averaging inequalities
- Sampled limited memory methods for massive linear inverse problems
- Generating Correlation Matrices With Specified Eigenvalues Using the Method of Alternating Projections
- Stochastic variance reduced gradient for affine rank minimization problem
- Alternating projection method for solving doubly stochastic inverse singular value problems with prescribed entries
- A low-cost alternating projection approach for a continuous formulation of convex and cardinality constrained optimization
- How to project onto the intersection of a closed affine subspace and a hyperplane
- Projection methods for finding the greatest element of the intersection of max-closed convex sets
- A hybrid direct search and projected simplex gradient method for convex constrained minimization
- A Computational Framework for Solving Nonlinear Binary Optimization Problems in Robust Causal Inference
- An assessment of numerical and geometrical quality of bases on surface fitting on Powell-Sabin triangulations
- Alternating cyclic vector extrapolation technique for accelerating nonlinear optimization algorithms and fixed-point mapping applications
- Dykstra's splitting and an approximate proximal point algorithm for minimizing the sum of convex functions
- Multi-dimensional summation-by-parts operators for general function spaces: theory and construction
- A new projection method for finding the closest point in the intersection of convex sets
- The superiorization method with restarted perturbations for split minimization problems with an application to radiotherapy treatment planning
- The Supporting Halfspace--Quadratic Programming Strategy for the Dual of the Best Approximation Problem
- Row-Oriented Decomposition in Large-Scale Linear Optimization
- Column-oriented algebraic iterative methods for nonnegative constrained least squares problems
- Product of two positive contractions
- Projected randomized Kaczmarz methods
- Alternating oblique projections for coupled linear systems
- A convex optimization approach for solving large scale linear systems
- Sampled Tikhonov regularization for large linear inverse problems
- A modular string averaging procedure for solving the common fixed point problem for quasi-nonexpansive mappings in Hilbert space
- Alternating projection method for doubly stochastic inverse eigenvalue problems with partial eigendata
- Title not available (Why is that?)
- Optimal design of multiphase composites under elastodynamic loading
- Title not available (Why is that?)
- Convolutional Wasserstein distances: efficient optimal transportation on geometric domains
- Iterative algorithm for solving a class of convex feasibility problem
- Markov chain lumpability and applications to credit risk modelling in compliance with the International Financial Reporting Standard 9 framework
- Distributed Deterministic Asynchronous Algorithms in Time-Varying Graphs Through Dykstra Splitting
- Title not available (Why is that?)
- Elasticity \(\mathcal{M} \)-tensors and the strong ellipticity condition
- Optimal rates of linear convergence of relaxed alternating projections and generalized Douglas-Rachford methods for two subspaces
- Rapid, robust, and reliable blind deconvolution via nonconvex optimization
- Some convergence strategies for the alternating generalized projection method
- An acceleration scheme for Dykstra's algorithm
- Convergence Rate Analysis for Averaged Fixed Point Iterations in Common Fixed Point Problems
- On sequential multiscale inversion and data assimilation
- On the coupled continuous knapsack problems: projection onto the volume constrained Gibbs \(N\)-simplex
- Scalable Bayesian Uncertainty Quantification in Imaging Inverse Problems via Convex Optimization
- A real-time iterative projection scheme for solving the common fixed point problem and its applications
- Low rank matrix completion by alternating steepest descent methods
- A cyclic Douglas-Rachford iteration scheme
- Accelerating the alternating projection algorithm for the case of affine subspaces using supporting hyperplanes
- Convergence and perturbation resilience of dynamic string-averaging projection methods
- Optimal rates of linear convergence of the averaged alternating modified reflections method for two subspaces
- Computationally efficient approach for the minimization of volume constrained vector-valued Ginzburg-Landau energy functional
- On the optimal separating hyperplane for arbitrary sets: a generalization of the SVM formulation and a convex hull approach
- Set intersection problems: supporting hyperplanes and quadratic programming
- Low-rank nonnegative tensor approximation via alternating projections and sketching
- Notes on flexible sequential block iterative methods
- On biunimodular vectors for unitary matrices
- Projection methods for quantum channel construction
- Title not available (Why is that?)
- Rates of convergence of randomized Kaczmarz algorithms in Hilbert spaces
- Duality and nonlinear graph Laplacians
- Anderson acceleration of the alternating projections method for computing the nearest correlation matrix
- Weak, Strong, and Linear Convergence of a Double-Layer Fixed Point Algorithm
- Finding a best approximation pair of points for two polyhedra
- Error minimizing relaxation strategies in Landweber and Kaczmarz type iterations
- Strict Fejér monotonicity by superiorization of feasibility-seeking projection methods
- Metric-Constrained Optimization for Graph Clustering Algorithms
- Multimaterial topology optimization by volume constrained Allen-Cahn system and regularized projected steepest descent method
- Worst-case complexity of cyclic coordinate descent: \(O(n^2)\) gap with randomized version
- Multi-step greedy Kaczmarz algorithms with simple random sampling for solving large linear systems
- A splitting method for finding the resolvent of the sum of two maximal monotone operators
- Convergence acceleration of Kaczmarz's method
This page was built for publication: Alternating projection methods.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3172946)
