Decomposition Methods for Sparse Matrix Nearness Problems
From MaRDI portal
Publication:3456880
DOI10.1137/15M1011020zbMath1342.90128MaRDI QIDQ3456880
Lieven Vandenberghe, Yifan Sun
Publication date: 9 December 2015
Published in: SIAM Journal on Matrix Analysis and Applications (Search for Journal in Brave)
convex optimizationEuclidean distance matriceschordal graphsfirst order methodspositive semidefinite completion
Computational methods for sparse matrices (65F50) Semidefinite programming (90C22) Convex programming (90C25) Matrix completion problems (15A83)
Related Items
Limited memory BFGS algorithm for the matrix approximation problem in Frobenius norm, Limited memory BFGS method for least squares semidefinite programming with banded structure, Performance enhancements for a generic conic interior point algorithm, Numerical strategies for recursive least squares solutions to the matrix equation AX = B, An accelerated active-set algorithm for a quadratic semidefinite program with general constraints, Chordal decomposition in operator-splitting methods for sparse semidefinite programs, Bregman primal-dual first-order method and application to sparse semidefinite programming
Uses Software
Cites Work
- Computing the nearest correlation matrix--a problem from finance
- A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
- Structure methods for solving the nearest correlation matrix problem
- On the convergence of the iterates of the ``fast iterative shrinkage/thresholding algorithm
- Partial inverse of a monotone operator
- Positive definite completions of partial Hermitian matrices
- Minimal triangulations of graphs: a survey
- Computing a nearest symmetric positive semidefinite matrix
- Positive semidefinite matrices with a given sparsity pattern
- Approximation by matrices positive semidefinite on a subspace
- A cyclic projection algorithm via duality
- On the Douglas-Rachford splitting method and the proximal point algorithm for maximal monotone operators
- A successive projection method
- Solving Euclidean distance matrix completion problems via semidefinite progrmming
- Introductory lectures on convex optimization. A basic course.
- A fast dual proximal gradient algorithm for convex minimization and applications
- Further applications of a splitting algorithm to decomposition in variational inequalities and convex programming
- Dual coordinate ascent methods for non-strictly convex minimization
- Correlation stress testing for value-at-risk: an unconstrained convex optimization approach
- Triangulated graphs and the elimination process
- Approximate and exact completion problems for Euclidean distance matrices using semidefinite programming
- Remarks to Maurice Frechet's article ``Sur la definition axiomatique d'une classe d'espaces vectoriels distancies applicables vectoriellement sur l'espace de Hilbert
- Projection Methods in Conic Optimization
- Euclidean Distance Matrices and Applications
- The university of Florida sparse matrix collection
- An augmented Lagrangian dual approach for the H-weighted nearest correlation matrix problem
- Computing a Nearest Correlation Matrix with Factor Structure
- Projection methods for conic feasibility problems: applications to polynomial sum-of-squares decompositions
- Decomposition in Conic Optimization with Partially Separable Structure
- An Algorithm for Restricted Least Squares Regression
- An Alternating Projection Algorithm for Computing the Nearest Euclidean Distance Matrix
- Direct Methods for Sparse Linear Systems
- A Quadratically Convergent Newton Method for Computing the Nearest Correlation Matrix
- Applications of the method of partial inverses to convex programming: Decomposition
- A Parallel Algorithm for a Class of Convex Programs
- Splitting Algorithms for the Sum of Two Nonlinear Operators
- Computing the Minimum Fill-In is NP-Complete
- Applications of a Splitting Algorithm to Decomposition in Convex Programming and Variational Inequalities
- A Lagrangian Dual Approach to the Single-Source Localization Problem
- A Dual Approach to Semidefinite Least-Squares Problems
- The Euclidian Distance Matrix Completion Problem
- Correlation matrix nearness and completion under observation uncertainty
- On the existence of convex decompositions of partially separable functions
- Coordinate Shadows of Semidefinite and Euclidean Distance Matrices
- A Semismooth Newton Method for the Nearest Euclidean Distance Matrix Problem
- Robust Stopping Criteria for Dykstra's Algorithm
- Faster Convergence Rates of Relaxed Peaceman-Rachford and ADMM Under Regularity Assumptions
- On the Convergence of Block Coordinate Descent Type Methods
- Least-Squares Covariance Matrix Adjustment
- Proximité et dualité dans un espace hilbertien
- Convex Analysis
- Convex analysis and monotone operator theory in Hilbert spaces
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
