A Convergence Analysis of Dykstra's Algorithm for Polyhedral Sets
From MaRDI portal
Recommendations
- Rate of convergence of the Pólya algorithm from polyhedral sets
- scientific article; zbMATH DE number 3985841
- The Pólya algorithm on convex sets
- scientific article; zbMATH DE number 1949107
- The rate of convergence of dykstra's cyclic projections algorithm: The polyhedral case
- scientific article; zbMATH DE number 1744825
- scientific article; zbMATH DE number 4120902
- Analysis of an algorithm for approximating convex bodies
- Numerical analysis of the efficiency of an algorithm for approximating convex bodies by polyhedra
- Dykstra's algorithm with strategies for projecting onto certain polyhedral cones
Cited in
(13)- Dykstra's algorithm with strategies for projecting onto certain polyhedral cones
- How good are projection methods for convex feasibility problems?
- On Dykstra's iterative fitting procedure
- A convergent algorithm for a generalized multivariate isotonic regression problem
- An acceleration scheme for Dykstra's algorithm
- Dykstra's splitting and an approximate proximal point algorithm for minimizing the sum of convex functions
- Convergence Rate Analysis of a Dykstra-Type Projection Algorithm
- scientific article; zbMATH DE number 1916748 (Why is no real title available?)
- Finding the projection of a point onto the intersection of convex sets via projections onto half-spaces.
- Rate of convergence of the Pólya algorithm from polyhedral sets
- The Pólya algorithm on convex sets
- Analysis of parametric evolution of polyhedral sets
- Fundamentals of cone regression
This page was built for publication: A Convergence Analysis of Dykstra's Algorithm for Polyhedral Sets
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4785796)