Decomposition methods for sparse matrix nearness problems
From MaRDI portal
Recommendations
- On a general class of matrix nearness problems
- Selective alternating projections to find the nearest SDD\(^{+}\) matrix
- scientific article; zbMATH DE number 4115838
- An interior-point method for approximate positive semidefinite completions
- Approximate and exact completion problems for Euclidean distance matrices using semidefinite programming
Cites work
- scientific article; zbMATH DE number 4015993 (Why is no real title available?)
- scientific article; zbMATH DE number 3850830 (Why is no real title available?)
- scientific article; zbMATH DE number 3973706 (Why is no real title available?)
- scientific article; zbMATH DE number 51132 (Why is no real title available?)
- scientific article; zbMATH DE number 554762 (Why is no real title available?)
- scientific article; zbMATH DE number 1382772 (Why is no real title available?)
- A Dual Approach to Semidefinite Least-Squares Problems
- A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
- A Lagrangian Dual Approach to the Single-Source Localization Problem
- A Parallel Algorithm for a Class of Convex Programs
- A Quadratically Convergent Newton Method for Computing the Nearest Correlation Matrix
- A cyclic projection algorithm via duality
- A fast dual proximal gradient algorithm for convex minimization and applications
- A semismooth Newton method for the nearest Euclidean distance matrix problem
- A successive projection method
- An Algorithm for Restricted Least Squares Regression
- An Alternating Projection Algorithm for Computing the Nearest Euclidean Distance Matrix
- An augmented Lagrangian dual approach for the H-weighted nearest correlation matrix problem
- Applications of a Splitting Algorithm to Decomposition in Convex Programming and Variational Inequalities
- Applications of the method of partial inverses to convex programming: Decomposition
- Approximate and exact completion problems for Euclidean distance matrices using semidefinite programming
- Approximation by matrices positive semidefinite on a subspace
- Computing a nearest correlation matrix with factor structure
- Computing a nearest symmetric positive semidefinite matrix
- Computing the Minimum Fill-In is NP-Complete
- Computing the nearest correlation matrix--a problem from finance
- Convex Analysis
- Convex analysis and monotone operator theory in Hilbert spaces
- Coordinate shadows of semidefinite and Euclidean distance matrices
- Correlation matrix nearness and completion under observation uncertainty
- Correlation stress testing for value-at-risk: an unconstrained convex optimization approach
- Decomposition in conic optimization with partially separable structure
- Direct Methods for Sparse Linear Systems
- Dual coordinate ascent methods for non-strictly convex minimization
- Euclidean distance matrices and applications
- Faster convergence rates of relaxed Peaceman-Rachford and ADMM under regularity assumptions
- Further applications of a splitting algorithm to decomposition in variational inequalities and convex programming
- Introductory lectures on convex optimization. A basic course.
- Least-Squares Covariance Matrix Adjustment
- Minimal triangulations of graphs: a survey
- On the Douglas-Rachford splitting method and the proximal point algorithm for maximal monotone operators
- On the convergence of block coordinate descent type methods
- On the convergence of the iterates of the ``fast iterative shrinkage/thresholding algorithm
- On the existence of convex decompositions of partially separable functions
- Partial inverse of a monotone operator
- Positive definite completions of partial Hermitian matrices
- Positive semidefinite matrices with a given sparsity pattern
- Projection Methods in Conic Optimization
- Projection methods for conic feasibility problems: applications to polynomial sum-of-squares decompositions
- Proximité et dualité dans un espace hilbertien
- Remarks to Maurice Frechet's article ``Sur la definition axiomatique d'une classe d'espaces vectoriels distancies applicables vectoriellement sur l'espace de Hilbert
- Robust Stopping Criteria for Dykstra's Algorithm
- Solving Euclidean distance matrix completion problems via semidefinite progrmming
- Splitting Algorithms for the Sum of Two Nonlinear Operators
- Structure methods for solving the nearest correlation matrix problem
- The Euclidian Distance Matrix Completion Problem
- The University of Florida sparse matrix collection
- Triangulated graphs and the elimination process
Cited in
(16)- Chordal decomposition in operator-splitting methods for sparse semidefinite programs
- scientific article; zbMATH DE number 4115838 (Why is no real title available?)
- An accelerated active-set algorithm for a quadratic semidefinite program with general constraints
- Estimating Cell-Type-Specific Gene Co-Expression Networks from Bulk Gene Expression Data with an Application to Alzheimer’s Disease
- Matrix completion and decomposition in phase-bounded cones
- On a general class of matrix nearness problems
- Performance enhancements for a generic conic interior point algorithm
- Limited memory BFGS algorithm for the matrix approximation problem in Frobenius norm
- A sparse decomposition of low rank symmetric positive semidefinite matrices
- A sparsity for decomposing a symmetric matrix
- Bregman primal-dual first-order method and application to sparse semidefinite programming
- Modeling data locality for the sparse matrix-vector product using distance measures
- Numerical strategies for recursive least squares solutions to the matrix equation AX = B
- Limited memory BFGS method for least squares semidefinite programming with banded structure
- Fast spatial decomposition and closest pair computation for limited precision input
- Direct covariance matrix estimation with compositional data
This page was built for publication: Decomposition methods for sparse matrix nearness problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3456880)
