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 ratesHilbert spaceprojection methodasymptotic behaviour of dual quantities

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Convex programming (90C25) Programming in abstract spaces (90C48) Variational problems concerning extremal problems in several variables; Yang-Mills functionals (58E15)

Related Items

Fundamentals of cone regression, An iteration method to solve multiple constrained least squares problems, Unnamed Item, Decomposition Methods for Sparse Matrix Nearness Problems, The cone of distance matrices, DOUGLAS–RACHFORD FEASIBILITY METHODS FOR MATRIX COMPLETION PROBLEMS, Convex Euclidean distance embedding for collaborative position localization with NLOS mitigation, Nonlinear eigenvector algorithms for local optimization in multivariate data analysis, Model-based distance embedding with applications to chromosomal conformation biology, SDP-Based Bounds for the Quadratic Cycle Cover Problem via Cutting-Plane Augmented Lagrangian Methods and Reinforcement Learning, The rate of convergence of dykstra's cyclic projections algorithm: The polyhedral case, Finding projections onto the intersection of convex sets in hilbert spaces, Linearly-convergent FISTA variant for composite optimization with duality, Partitioning through projections: strong SDP bounds for large graph partition problems, A Distributed Boyle--Dykstra--Han Scheme, Perturbation analysis of the Euclidean distance matrix optimization problem and its numerical implications, Feature selection algorithm in classification learning using support vector machines, Convergence Rate Analysis of a Dykstra-Type Projection Algorithm, Statistical multiresolution Dantzig estimation in imaging: fundamental concepts and algorithmic framework, Finding the projection of a point onto the intersection of convex sets via projections onto half-spaces., Dykstras algorithm with bregman projections: A convergence proof, Equality relating Euclidean distance cone to positive semidefinite cone, Distributed Deterministic Asynchronous Algorithms in Time-Varying Graphs Through Dykstra Splitting, Robust Euclidean embedding via EDM optimization, The embedding problem for predistance matrices, Conditional quadratic semidefinite programming: examples and methods, Proximity for sums of composite functions, Computational acceleration of projection algorithms for the linear best approximation problem, Positive semidefinite relaxations for distance geometry problems., A remark on accelerated block coordinate descent for computing the proximity operators of a sum of convex functions, Nonlinear Gossip, Fenchel duality and the strong conical hull intersection property, Coordinate Difference Matrices, Parallel Statistical Multiresolution Estimation for Image Reconstruction, Active-set Methods for Submodular Minimization Problems, Dykstra's splitting and an approximate proximal point algorithm for minimizing the sum of convex functions, A Convex Matrix Optimization for the Additive Constant Problem in Multidimensional Scaling with Application to Locally Linear Embedding, The Supporting Halfspace--Quadratic Programming Strategy for the Dual of the Best Approximation Problem, Duality for optimization and best approximation over finite intersections, Constrained Best Euclidean Distance Embedding on a Sphere: A Matrix Optimization Approach, Nonnegative minimum biased quadratic estimation in mixed linear models, A Note on the Kuks-Olman Estimator, On Degenerate Doubly Nonnegative Projection Problems

Cites Work

• 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
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item