A cyclic projection algorithm via duality

DOI10.1007/BF02614077zbMath0676.90054MaRDI QIDQ1123132

Norbert Gaffke, Rudolf Mathar

Publication date: 1989

Published in: Metrika (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/176213

zbMATH Keywords

convergence rates; Hilbert space; projection method; asymptotic behaviour of dual quantities

Mathematics Subject Classification ID

65K05: Numerical mathematical programming methods

90C25: Convex programming

90C48: Programming in abstract spaces

58E15: Variational problems concerning extremal problems in several variables; Yang-Mills functionals

Related Items

The rate of convergence of dykstra's cyclic projections algorithm: The polyhedral case, A Note on the Kuks-Olman Estimator, Finding projections onto the intersection of convex sets in hilbert spaces, Positive semidefinite relaxations for distance geometry problems., Proximity for sums of composite functions, Equality relating Euclidean distance cone to positive semidefinite cone, The embedding problem for predistance matrices, Nonlinear eigenvector algorithms for local optimization in multivariate data analysis, Finding the projection of a point onto the intersection of convex sets via projections onto half-spaces., Nonnegative minimum biased quadratic estimation in mixed linear models, Fenchel duality and the strong conical hull intersection property, Computational acceleration of projection algorithms for the linear best approximation problem, Unnamed Item, The cone of distance matrices, Dykstras algorithm with bregman projections: A convergence proof, Duality for optimization and best approximation over finite intersections

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The best Euclidean fit to a given distance matrix in prescribed dimensions
• An algorithm for least squares projections onto the intersection of translated, convex cones
• On the existence of unbiased nonnegative estimates of variance covariance components
• A successive projection method
• Proximity Maps for Convex Sets
• Iterates of Conditional Expectation Operators
• An Algorithm for Restricted Least Squares Regression
• Decomposition through formalization in a product space
• Inequalities for the Eigenvalues of a Non-Negative Definite Matrix and a Generalization
• M31. Least squares solutions over interval restrictions
• Linear models and convex geometry: aspects of non-negative variance estimation¹
• Methodes de Decomposition pour la Minimisation d’une Fonction sur un Espace Produit
• The method of projections for finding the common point of convex sets
• An “alternierende Verfahren” for general positive operators
• Functional Operators (AM-22), Volume 2