Alternating projection methods.
From MaRDI portal
Recommendations
Cited in
(83)- Finding a best approximation pair of points for two polyhedra
- Some convergence strategies for the alternating generalized projection method
- A convex optimization approach for solving large scale linear systems
- Multimaterial topology optimization by volume constrained Allen-Cahn system and regularized projected steepest descent method
- Duality and nonlinear graph Laplacians
- On sequential multiscale inversion and data assimilation
- Iterative algorithm for solving a class of convex feasibility problem
- Alternating oblique projections for coupled linear systems
- Convergence and perturbation resilience of dynamic string-averaging projection methods
- Markov chain lumpability and applications to credit risk modelling in compliance with the International Financial Reporting Standard 9 framework
- Multi-step greedy Kaczmarz algorithms with simple random sampling for solving large linear systems
- The superiorization method with restarted perturbations for split minimization problems with an application to radiotherapy treatment planning
- 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
- Worst-case complexity of cyclic coordinate descent: O(n^2) gap with randomized version
- Column-oriented algebraic iterative methods for nonnegative constrained least squares problems
- Alternating projection method for doubly stochastic inverse eigenvalue problems with partial eigendata
- A cyclic Douglas-Rachford iteration scheme
- Optimal rates of linear convergence of the averaged alternating modified reflections method for two subspaces
- Notes on flexible sequential block iterative methods
- Elasticity \(\mathcal{M} \)-tensors and the strong ellipticity condition
- Projected randomized Kaczmarz methods
- Dykstra's splitting and an approximate proximal point algorithm for minimizing the sum of convex functions
- Rapid, robust, and reliable blind deconvolution via nonconvex optimization
- Strict Fejér monotonicity by superiorization of feasibility-seeking projection methods
- Optimal design of multiphase composites under elastodynamic loading
- Set intersection problems: supporting hyperplanes and quadratic programming
- Low-rank nonnegative tensor approximation via alternating projections and sketching
- Product of two positive contractions
- Convolutional Wasserstein distances: efficient optimal transportation on geometric domains
- Convergence rate analysis for averaged fixed point iterations in common fixed point problems
- 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
- Computationally efficient approach for the minimization of volume constrained vector-valued Ginzburg-Landau energy functional
- On the application of alternating projection under the constraint of linear matrix inequalities
- Distributed deterministic asynchronous algorithms in time-varying graphs through Dykstra splitting
- scientific article; zbMATH DE number 2111135 (Why is no real title available?)
- An alternating projections method for certain linear problems in a Hilbert space
- Accelerating the alternating projection algorithm for the case of affine subspaces using supporting hyperplanes
- On biunimodular vectors for unitary matrices
- Projection methods for quantum channel construction
- Sampled Tikhonov regularization for large linear inverse problems
- Weak, strong, and linear convergence of a double-layer fixed point algorithm
- Sampled limited memory methods for massive linear inverse problems
- Metric-Constrained Optimization for Graph Clustering Algorithms
- On the optimal separating hyperplane for arbitrary sets: a generalization of the SVM formulation and a convex hull approach
- scientific article; zbMATH DE number 7632133 (Why is no real title available?)
- A Computational Framework for Solving Nonlinear Binary Optimization Problems in Robust Causal Inference
- A splitting method for finding the resolvent of the sum of two maximal monotone operators
- Error minimizing relaxation strategies in Landweber and Kaczmarz type iterations
- Scalable Bayesian uncertainty quantification in imaging inverse problems via convex optimization
- Convergence acceleration of Kaczmarz's method
- A new way of computing the orthogonal projection onto the intersection of two hyperplanes in a finite-dimensional Hilbert space
- The supporting halfspace-quadratic programming strategy for the dual of the best approximation problem
- Generating Correlation Matrices With Specified Eigenvalues Using the Method of Alternating Projections
- scientific article; zbMATH DE number 7656030 (Why is no real title available?)
- An acceleration scheme for Dykstra's algorithm
- On the coupled continuous knapsack problems: projection onto the volume constrained Gibbs \(N\)-simplex
- A low-cost alternating projection approach for a continuous formulation of convex and cardinality constrained optimization
- Multi-dimensional summation-by-parts operators for general function spaces: theory and construction
- Alternating cyclic vector extrapolation technique for accelerating nonlinear optimization algorithms and fixed-point mapping applications
- Row-Oriented Decomposition in Large-Scale Linear Optimization
- Alternating projection method for intersection of convex sets, multi-agent consensus algorithms, and averaging inequalities
- Stochastic variance reduced gradient for affine rank minimization problem
- Alternating projection method for solving doubly stochastic inverse singular value problems with prescribed entries
- 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
- An assessment of numerical and geometrical quality of bases on surface fitting on Powell-Sabin triangulations
- A new projection method for finding the closest point in the intersection of convex sets
- Centralized circumcentered-reflection method for solving the convex feasibility problem in sparse signal recovery
- Modular data assimilation for flow prediction
- On the randomized multiple row-action methods for solving linear least-squares problems
- An efficient CGA\_ADMM for the metric nearness problem
- An efficient algorithm for the _p norm based metric nearness problem
- Low-rank approximation algorithm using sparse projection and its applications
- Alternating generalized projection method applied to phase-only synthesis process of satellite reflectarray antennas
- An augmented Lagrangian approach for cardinality constrained minimization applied to variable selection problems
- A fuzzy numerical framework for inverse problems with -parameter optimization via optuna
- Dual adaptive stochastic block projection algorithm for solving convex feasibility problem in support vector machines
- An inexact alternating projection method with application to matrix completion
- Low rank matrix completion by alternating steepest descent methods
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)
