Estimation of the convergence rate of Dykstra's cyclic projections algorithm in polyhedral case

DOI10.1007/BF02677683MaRDI QIDQ1568258zbMATH OpenOpenAlexFDO

Authors Shusheng Xu

Publication date 3 May 2001

Published in Acta Mathematicae Applicatae Sinica. English Series (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/bf02677683

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57)

Cites work

• scientific article; zbMATH DE number 3230744 (Why is no real title available?)
• An Algorithm for Restricted Least Squares Regression
• The rate of convergence of dykstra's cyclic projections algorithm: The polyhedral case

Cited in

(7)

• Generalized isotone projection cones
• A semi-smooth Newton method for a special piecewise linear system with application to positively constrained convex quadratic programming
• How to project onto an isotone projection cone
• Statistical multiresolution Dantzig estimation in imaging: fundamental concepts and algorithmic framework
• Active-set Methods for Submodular Minimization Problems
• Projection onto simplicial cones by a semi-smooth Newton method
• Projection onto simplicial cones by Picard's method

This page was built for publication: Estimation of the convergence rate of Dykstra's cyclic projections algorithm in polyhedral case

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