scientific article
From MaRDI portal
Publication:2713568
DOI<461::AID-NLA141>3.0.CO;2-V 10.1002/(SICI)1099-1506(199811/12)5:6<461::AID-NLA141>3.0.CO;2-VzbMath0979.65035MaRDI QIDQ2713568
Pablo Tarazaga, María Mendoza, Marcos Raydan
Publication date: 10 June 2001
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
numerical experimentsDykstra's algorithmdiagonally dominant matricesalternating projection algorithmmatrix conesKuhn-Tucker conditions
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (5)
Selective alternating projections to find the nearest SDD\(^{+}\) matrix ⋮ Diagonally Dominant Principal Component Analysis ⋮ Computational acceleration of projection algorithms for the linear best approximation problem ⋮ An acceleration scheme for Dykstra's algorithm ⋮ Dykstra's algorithm with strategies for projecting onto certain polyhedral cones
Cites Work
- Computing a nearest symmetric positive semidefinite matrix
- Approximation by matrices positive semidefinite on a subspace
- A cyclic projection algorithm via duality
- Dykstra's algorithm for constrained least-squares rectangular matrix problems
- Theory of cones
- A numerical procedure for finding the positive definite matrix closest to a patterned matrix
- A lower bound for the smallest singular value of a matrix
- The structure of cones of matrices
- On the cone of positive semidefinite matrices
- Cones of diagonally dominant matrices
- Positive definite constrained least-squares estimation of matrices
- A New Modified Cholesky Factorization
- An Alternating Projection Algorithm for Computing the Nearest Euclidean Distance Matrix
- Semi-Definite Matrix Constraints in Optimization
- Positive Semidefinite Matrices: Characterization via Conical Hulls and Least-Squares Solution of a Matrix Equation
- A Nonlinear Programming Problem in Statistics (Educational Testing)
- A Modified Cholesky Algorithm Based on a Symmetric Indefinite Factorization
- Dykstra's Algorithm for a Constrained Least-squares Matrix Problem
- The rate of convergence of dykstra's cyclic projections algorithm: The polyhedral case
This page was built for publication:
