Un problème d'approximation matricielle : quelle est la matrice bistochastique la plus proche d'une matrice donnée ?

DOI10.1051/ro:2005003zbMath1102.90043OpenAlexW2126642927MaRDI QIDQ5710542

Pawoumodom L. Takouda

Publication date: 2 December 2005

Published in: RAIRO - Operations Research (Search for Journal in Brave)

Full work available at URL: http://www.numdam.org/item?id=RO_2005__39_1_35_0

zbMATH Keywords

matrix approximationalternating projection method

Mathematics Subject Classification ID

Convex programming (90C25) Stochastic matrices (15B51)

Related Items (3)

Projecting onto rectangular matrices with prescribed row and column sums ⋮ DOUGLAS–RACHFORD FEASIBILITY METHODS FOR MATRIX COMPLETION PROBLEMS ⋮ Strengthened splitting methods for computing resolvents

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Computing the nearest correlation matrix--a problem from finance
• Hilbertian convex feasibility problem: Convergence of projection methods
• Closest matrices in the space of generalized doubly stochastic matrices
• Dykstra's alternating projection algorithm for two sets
• The nearest ‘doubly stochastic’ matrix to a real matrix with the same first moment
• An Alternating Projection Algorithm for Computing the Nearest Euclidean Distance Matrix
• Matrix Analysis
• Dykstra's Algorithm for a Constrained Least-squares Matrix Problem
• Variational Analysis
• On Projection Algorithms for Solving Convex Feasibility Problems

This page was built for publication: Un problème d'approximation matricielle : quelle est la matrice bistochastique la plus proche d'une matrice donnée ?