Dykstra's Algorithm for a Constrained Least-squares Matrix Problem
From MaRDI portal
Publication:4220442
DOI<459::AID-NLA82>3.0.CO;2-S 10.1002/(SICI)1099-1506(199611/12)3:6<459::AID-NLA82>3.0.CO;2-SzbMath0908.90207OpenAlexW2040847644MaRDI QIDQ4220442
Publication date: 23 November 1998
Full work available at URL: https://doi.org/10.1002/(sici)1099-1506(199611/12)3:6<459::aid-nla82>3.0.co;2-s
Related Items (12)
An iteration method to solve multiple constrained least squares problems ⋮ Unnamed Item ⋮ Dykstra's algorithm for constrained least-squares rectangular matrix problems ⋮ A new iterative algorithm for solving a class of matrix nearness problem ⋮ On the employment of inexact restoration for the minimization of functions whose evaluation is subject to errors ⋮ Dykstras algorithm with bregman projections: A convergence proof ⋮ On first order optimality conditions for vector optimization ⋮ A constrained matrix least-squares problem in structural dynamics model updating ⋮ Un problème d'approximation matricielle : quelle est la matrice bistochastique la plus proche d'une matrice donnée ? ⋮ Dykstra's algorithm for constrained least-squares doubly symmetric matrix problems ⋮ Computational acceleration of projection algorithms for the linear best approximation problem ⋮ An acceleration scheme for Dykstra's algorithm
This page was built for publication: Dykstra's Algorithm for a Constrained Least-squares Matrix Problem