Newton's method for computing the nearest correlation matrix with a simple upper bound
From MaRDI portal
(Redirected from Publication:620444)
Recommendations
- A Quadratically Convergent Newton Method for Computing the Nearest Correlation Matrix
- Structure methods for solving the nearest correlation matrix problem
- A preconditioned Newton algorithm for the nearest correlation matrix
- Computing the nearest correlation matrix--a problem from finance
- scientific article; zbMATH DE number 7289878
Cites work
- scientific article; zbMATH DE number 3465097 (Why is no real title available?)
- scientific article; zbMATH DE number 1502618 (Why is no real title available?)
- scientific article; zbMATH DE number 5239114 (Why is no real title available?)
- A Dual Approach to Semidefinite Least-Squares Problems
- A Newton-CG augmented Lagrangian method for semidefinite programming
- A Quadratically Convergent Newton Method for Computing the Nearest Correlation Matrix
- A nonsmooth version of Newton's method
- A preconditioned Newton algorithm for the nearest correlation matrix
- An inexact primal-dual path following algorithm for convex quadratic SDP
- Best approximation in inner product spaces
- Calibrating Least Squares Semidefinite Programming with Equality and Inequality Constraints
- Complementarity and nondegeneracy in semidefinite programming
- Computing the nearest correlation matrix--a problem from finance
- Constraint Nondegeneracy, Strong Regularity, and Nonsingularity in Semidefinite Programming
- Correlation stress testing for value-at-risk: an unconstrained convex optimization approach
- Equality relating Euclidean distance cone to positive semidefinite cone
- Global and superlinear convergence of the smoothing Newton method and its application to general box constrained variational inequalities
- Interior Point Methods in Semidefinite Programming with Applications to Combinatorial Optimization
- Least-Squares Covariance Matrix Adjustment
- Methods of conjugate gradients for solving linear systems
- Nondegeneracy and Quantitative Stability of Parameterized Optimization Problems with Multiple Solutions
- On Eigenvalue Optimization
- PENNON: A code for convex nonlinear and semidefinite programming
- Partially finite convex programming. I: Quasi relative interiors and duality theory
- Regularization methods for semidefinite programming
- Semismooth Matrix-Valued Functions
- The Strong Second-Order Sufficient Condition and Constraint Nondegeneracy in Nonlinear Semidefinite Programming and Their Implications
Cited in
(9)- Block relaxation and majorization methods for the nearest correlation matrix with factor structure
- Alternative gradient algorithms for computing the nearest correlation matrix
- A preconditioned Newton algorithm for the nearest correlation matrix
- Modified multiplicative update algorithms for computing the nearest correlation matrix
- Computing the nearest correlation matrix--a problem from finance
- Bounds for the distance to the nearest correlation matrix
- A Quadratically Convergent Newton Method for Computing the Nearest Correlation Matrix
- Complementarity problems with respect to Loewnerian cones
- A sequential semismooth Newton method for the nearest low-rank correlation matrix problem
This page was built for publication: Newton's method for computing the nearest correlation matrix with a simple upper bound
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q620444)
