Computing a nearest symmetric positive semidefinite matrix

DOI10.1016/0024-3795(88)90223-6MaRDI QIDQ1105980zbMATH OpenOpenAlexWikidataFDO

Authors Nicholas J. Higham

Publication date 1988

Published in Linear Algebra and its Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0024-3795(88)90223-6

zbMATH Keywords

positive definitenessFrobenius norm2-normNumerical examplesbisection algorithmnearest positive semidefinite matrix

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Convex programming (90C25) Positive matrices and their generalizations; cones of matrices (15B48) Norms of matrices, numerical range, applications of functional analysis to matrix theory (15A60)

Recommendations

• scientific article; zbMATH DE number 2076014
• scientific article; zbMATH DE number 2112992
• Computing the nearest circulant positive semi-definite matrix to a noisy matrix
• Low rank approximation of the symmetric positive semidefinite matrix
• Approximating the inverse of a symmetric positive definite matrix
• Semi-definite programming for the nearest circulant semi-definite matrix problem
• Computing Closest Stable Nonnegative Matrix
• scientific article; zbMATH DE number 3874480
• scientific article; zbMATH DE number 69501
• Computing symmetric nonnegative rank factorizations

Cites work

• scientific article; zbMATH DE number 3920686 (Why is no real title available?)
• scientific article; zbMATH DE number 3942888 (Why is no real title available?)
• scientific article; zbMATH DE number 4002053 (Why is no real title available?)
• scientific article; zbMATH DE number 3748409 (Why is no real title available?)
• scientific article; zbMATH DE number 3793774 (Why is no real title available?)
• scientific article; zbMATH DE number 3892457 (Why is no real title available?)
• scientific article; zbMATH DE number 3313812 (Why is no real title available?)
• scientific article; zbMATH DE number 3414916 (Why is no real title available?)
• scientific article; zbMATH DE number 3424672 (Why is no real title available?)
• A new look at the Lanczos algorithm for solving symmetric systems of linear equations
• Computing the Minimum Eigenvalue of a Symmetric Positive Definite Toeplitz Matrix
• Computing the Polar Decomposition—with Applications
• On condition numbers and the distance to the nearest ill-posed problem
• Positive Approximants
• Progress in Numerical Analysis
• Refined Error Analyses of Cholesky Factorization
• Semi-Definite Matrix Constraints in Optimization
• Some Metric Inequalities in the Space of Matrices
• The Formulation and Analysis of Numerical Methods for Inverse Eigenvalue Problems

Cited in

(only showing first 100 items - show all)

• Linear matrix equations from an inverse problem of vibration theory
• A variational time discretization for compressible Euler equations
• Algorithms for Kullback-Leibler approximation of probability measures in infinite dimensions
• MDCGen: multidimensional dataset generator for clustering
• Modifying the inertia of matrices arising in optimization
• The solvability conditions for the inverse eigenvalue problems of centro-symmetric matrices
• Computing Closest Stable Nonnegative Matrix
• Clarke generalized Jacobian of the projection onto the cone of positive semidefinite matrices
• Restoring definiteness via shrinking, with an application to correlation matrices with a fixed block
• Critical points of matrix least squares distance functions
• Alternating convex projection methods for covariance control design
• Application of the alternating direction method for an inverse monic quadratic eigenvalue problem
• The least-squares solutions of inconsistent matrix equation over symmetric and antipersymmetric matrices
• Alternative gradient algorithms for computing the nearest correlation matrix
• Inexact variable metric method for convex-constrained optimization problems
• An inverse eigenvalue problem: Computing \(B\)-stable Runge-Kutta methods having real poles
• Simultaneous generation of multivariate mixed data with Poisson and normal marginals
• Parameter identification in financial market models with a feasible point SQP algorithm
• On the bridge between combinatorial optimization and nonlinear optimization: a family of semidefinite bounds for 0--1 quadratic problems leading to quasi-Newton methods
• A boundary point method to solve semidefinite programs
• An efficient algorithm for the least-squares reflexive solution of the matrix equation \(A_{1}XB_{1} = C_{1}, A_{2}XB_{2} = C_{2}\)
• The solvability conditions for the inverse eigenvalue problems of reflexive matrices
• A regularized Newton method for degenerate unconstrained optimization problems
• A fixed-point method for approximate projection onto the positive semidefinite cone
• Diffusion tensor regularization with metric double integrals
• Estimating the covariance matrix of the maximum likelihood estimator under linear cluster-weighted models
• Convergence analysis for distributionally robust optimization and equilibrium problems
• Least-square solutions for inverse problems of centrosymmetric matrices
• A numerical procedure for finding the positive definite matrix closest to a patterned matrix
• The matrix sign decomposition and its relation to the polar decomposition
• An iterative algorithm for the least squares bisymmetric solutions of the matrix equations \(A_{1}XB_{1}=C_{1},A_{2}XB_{2}=C_{2}\)
• scientific article; zbMATH DE number 6860781 (Why is no real title available?)
• An iterative algorithm for the reflexive solutions of the generalized coupled Sylvester matrix equations and its optimal approximation
• Stability analysis of discrete singular fuzzy systems
• Matrix iterative solutions to the least squares problem of \(BXA^{T} = F\) with some linear constraints
• The expansion problem of anti-symmetric matrix under a linear constraint and the optimal approximation
• A trust region method for solving semidefinite programs
• A proximal point-like method for symmetric finite element model updating problems
• Alternating convex projection methods for discrete-time covariance control design
• An iterative method for the least squares symmetric solution of the linear matrix equation \(AXB = C\)
• Successive projection iterative method for solving matrix equation \(AX=B\)
• Approximation by matrices positive semidefinite on a subspace
• The matrix nearness problem for symmetric matrices associated with the matrix equation \([A^{T}XA, B^{T}XB] = [C, D]\)
• The rate of convergence of the augmented Lagrangian method for nonlinear semidefinite programming
• An iteration method to solve multiple constrained least squares problems
• Bounds for the distance to the nearest correlation matrix
• Solving the matrix nearness problem in the maximum norm by applying a projection and contraction method
• The symmetric Procrustes problem
• A semi-analytical approach for the positive semidefinite Procrustes problem
• Construction of quantum states with special properties by projection methods
• Anderson acceleration of the alternating projections method for computing the nearest correlation matrix
• Generalized Matrix Nearness Problems
• The nearest definite pair for the Hermitian generalized eigenvalue problem
• Dual approaches to finite element model updating
• Multivariate spatio-temporal models for high-dimensional areal data with application to longitudinal employer-household dynamics
• An iterative method for the symmetric and skew symmetric solutions of a linear matrix equation \(AXB+CYD=E\)
• Asymmetric Multivariate Stochastic Volatility
• On the implementation of the eigenvalue method for limit cycle determination in nonlinear systems
• An iterative method for the least squares symmetric solution of matrix equation \(AXB = C\)
• Indefinite proximity learning: a review
• A complex projection scheme and applications
• A perturbation approach for an inverse quadratic programming problem
• Alternating projection method for sparse model updating problems
• The matrix pencil nearness problem in structural dynamic model updating
• A constrained matrix least-squares problem in structural dynamics model updating
• Alternating direction method for structure-persevering finite element model updating problem
• An iterative method for the least squares solutions of the linear matrix equations with some constraint
• Numerical methods for solving some matrix feasibility problems
• The inverse eigenvalue problem of generalized reflexive matrices and its approximation
• Bayesian nonparametric multivariate spatial mixture mixed effects models with application to American Community Survey special tabulations
• Douglas-Rachford splitting method for semidefinite programming
• Approximation by matrices with restricted spectra
• Projection Methods in Conic Optimization
• An introduction to a class of matrix cone programming
• Arnoldi decomposition, GMRES, and preconditioning for linear discrete ill-posed problems
• Inverse eigenvalue problems of tridiagonal symmetric matrices and tridiagonal bisymmetric matrices
• The inverse eigenvalue problem for Hermitian anti-reflexive matrices and its approximation
• Controlled sequential Monte Carlo
• Low-order control design for LMI problems using alternating projection methods
• On portmanteau-type tests for nonlinear multivariate time series
• Numerical low-rank approximation of matrix differential equations
• Decomposition methods for sparse matrix nearness problems
• Least-squares inner product shaping
• Nonsingularity, positive definiteness, and positive invertibility under fixed-point data rounding.
• Computing the nearest reversible Markov chain.
• Comparing unconstrained parametrization methods for return covariance matrix prediction
• Least-squares solution for inverse eigenpair problem of nonnegative definite matrices
• A projection scheme to stability analysis of discrete T-S fuzzy models.
• Iterative Tikhonov regularization of tensor equations based on the Arnoldi process and some of its generalizations
• Dykstra's algorithm for constrained least-squares rectangular matrix problems
• The general solutions on the minimum residual problem and the matrix nearness problem for symmetric matrices or anti-symmetric matrices
• A semidefinite programming approach for the projection onto the cone of negative semidefinite symmetric tensors with applications to solid mechanics
• Further results on Moore-Penrose inverses of tensors with application to tensor nearness problems
• Spatio-temporal change of support modeling with \texttt{R}
• scientific article; zbMATH DE number 2076014 (Why is no real title available?)
• Optimal matrix pencil approximation problem in structural dynamic model updating
• Iterative algorithm for solving a class of convex feasibility problem
• Proximal alternating direction method with relaxed proximal parameters for the least squares covariance adjustment problem
• Resource allocation for contingency planning: an inexact proximal bundle method for stochastic optimization
• Hybrid methods for solving the educational testing problem

Describes a project that uses

Uses Software

• LINPACK

This page was built for publication: Computing a nearest symmetric positive semidefinite matrix

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1105980)