A Quadratically Convergent Newton Method for Computing the Nearest Correlation Matrix
From MaRDI portal
Publication:3435003
Recommendations
- Newton's method for computing the nearest correlation matrix with a simple upper bound
- Computing a nearest correlation matrix with factor structure
- A preconditioned Newton algorithm for the nearest correlation matrix
- scientific article; zbMATH DE number 7289878
- Computing the nearest low-rank correlation matrix by a simplified SQP algorithm
Cited in
(only showing first 100 items - show all)- Identifiability and estimation of meta-elliptical copula generators
- Fréchet regression for random objects with Euclidean predictors
- Computing the nearest correlation matrix--a problem from finance
- A penalty method for rank minimization problems in symmetric matrices
- Estimation of correlations in portfolio credit risk models based on noisy security prices
- Sparse estimation of high-dimensional correlation matrices
- Estimating large covariance matrix with network topology for high-dimensional biomedical data
- A primal majorized semismooth Newton-CG augmented Lagrangian method for large-scale linearly constrained convex programming
- Inexact SA method for constrained stochastic convex SDP and application in Chinese stock market
- Sparse Markowitz portfolio selection by using stochastic linear complementarity approach
- Proximal alternating direction method with relaxed proximal parameters for the least squares covariance adjustment problem
- Optimal graph Laplacian
- A family of inexact SQA methods for non-smooth convex minimization with provable convergence guarantees based on the Luo-Tseng error bound property
- QSDPNAL: a two-phase augmented Lagrangian method for convex quadratic semidefinite programming
- Solving \(k\)-cluster problems to optimality with semidefinite programming
- A large-update interior-point algorithm for convex quadratic semi-definite optimization based on a new kernel function
- An accelerated active-set algorithm for a quadratic semidefinite program with general constraints
- A dual based semismooth Newton-type algorithm for solving large-scale sparse Tikhonov regularization problems
- Efficient high-dimensional material reliability analysis with explicit voxel-level stochastic microstructure representation
- Global convergence of Riemannian line search methods with a Zhang-Hager-type condition
- A semidefinite programming approach for the projection onto the cone of negative semidefinite symmetric tensors with applications to solid mechanics
- t-copula from the viewpoint of tail dependence matrices
- Limited memory BFGS algorithm for the matrix approximation problem in Frobenius norm
- Alternating projection method for doubly stochastic inverse eigenvalue problems with partial eigendata
- A projected semismooth Newton method for problems of calibrating least squares covariance matrix
- On the efficient computation of a generalized Jacobian of the projector over the Birkhoff polytope
- Optimality conditions and global convergence for nonlinear semidefinite programming
- Accuracy of approximate projection to the semidefinite cone
- On the R-superlinear convergence of the KKT residuals generated by the augmented Lagrangian method for convex composite conic programming
- Semidefinite inverse eigenvalue problems with prescribed entries and partial eigendata
- Minimum rank (skew) Hermitian solutions to the matrix approximation problem in the spectral norm
- Correlation stress testing for value-at-risk: an unconstrained convex optimization approach
- A calibration method for non-positive definite covariance matrix in multivariate data analysis
- A semismooth Newton method for support vector classification and regression
- Alternative gradient algorithms for computing the nearest correlation matrix
- An application of the nearest correlation matrix on web document classification
- A lower bound for the nearest correlation matrix problem based on the circulant mean
- Adaptive estimation of the copula correlation matrix for semiparametric elliptical copulas
- Limited memory BFGS method for least squares semidefinite programming with banded structure
- On FISTA with a relative error rule
- A matrix nonconvex relaxation approach to unconstrained binary polynomial programs
- Structure methods for solving the nearest correlation matrix problem
- An inexact Riemannian proximal gradient method
- Projection Methods in Conic Optimization
- Restoring definiteness via shrinking, with an application to correlation matrices with a fixed block
- Bounds for the distance to the nearest correlation matrix
- Statistical corrections of invalid correlation matrices
- On how to solve large-scale log-determinant optimization problems
- A 2-block semi-proximal ADMM for solving the H-weighted nearest correlation matrix problem
- Computing the nearest low-rank correlation matrix by a simplified SQP algorithm
- Anderson acceleration of the alternating projections method for computing the nearest correlation matrix
- Computing a nearest correlation matrix with factor structure
- Statistical rehabilitation of improper correlation matrices
- A rank-corrected procedure for matrix completion with fixed basis coefficients
- Tri-criterion modeling for constructing more-sustainable mutual funds
- Modified multiplicative update algorithms for computing the nearest correlation matrix
- A sequential semismooth Newton method for the nearest low-rank correlation matrix problem
- Low-rank matrix iteration using polynomial-filtered subspace extraction
- The instanton method and its numerical implementation in fluid mechanics
- Decomposition methods for sparse matrix nearness problems
- Gradient methods and conic least-squares problems
- Estimation of Positive Semidefinite Correlation Matrices by Using Convex Quadratic Semidefinite Programming
- An inexact accelerated proximal gradient method and a dual Newton-CG method for the maximal entropy problem
- Pricing and hedging basket options to prespecified levels of acceptability
- Approximation of rank function and its application to the nearest low-rank correlation matrix
- On the generalized low rank approximation of the correlation matrices arising in the asset portfolio
- Composite difference-MAX programs for modern statistical estimation problems
- An interior point method with a primal-dual quadratic barrier penalty function for nonlinear semidefinite programming
- An Efficient Approximation of Spatial Correlation Based on Gauss–Hermite Quadrature
- scientific article; zbMATH DE number 6860781 (Why is no real title available?)
- Conditional quadratic semidefinite programming: examples and methods
- Primal-dual active-set methods for large-scale optimization
- A feasible filter method for the nearest low-rank correlation matrix problem
- A partial proximal point algorithm for nuclear norm regularized matrix least squares problems
- Three non-Gaussian models of dependence in returns
- Global and quadratic convergence of Newton hard-thresholding pursuit
- A primal-dual interior point trust-region method for nonlinear semidefinite programming
- Global convergence of the alternating projection method for the max-cut relaxation problem
- A dual active-set proximal Newton algorithm for sparse approximation of correlation matrices
- A new methodology to create valid time-dependent correlation matrices via isospectral flows
- An efficient augmented Lagrangian method for support vector machine
- Adjusting covariance matrix for risk management
- Orthogonal nonnegative Tucker decomposition
- A Three-Operator Splitting Perspective of a Three-Block ADMM for Convex Quadratic Semidefinite Programming and Beyond
- Correlation matrix nearness and completion under observation uncertainty
- A preconditioned Newton algorithm for the nearest correlation matrix
- Robust Causal Structure Learning with Some Hidden Variables
- Computing the best approximation over the intersection of a polyhedral set and the doubly nonnegative cone
- A Black-Litterman approach to correlation stress testing
- Constrained best Euclidean distance embedding on a sphere: a matrix optimization approach
- A convex quadratic semi-definite programming approach to the partial additive constant problem in multidimensional scaling
- Actuarial risk matrices: the nearest positive semidefinite matrix problem
- A convex matrix optimization for the additive constant problem in multidimensional scaling with application to locally linear embedding
- The supporting halfspace-quadratic programming strategy for the dual of the best approximation problem
- On the low rank solution of the Q-weighted nearest correlation matrix problem.
- A Filter Active-Set Algorithm for Ball/Sphere Constrained Optimization Problem
- Generating Correlation Matrices With Specified Eigenvalues Using the Method of Alternating Projections
- Complexity analysis of interior-point methods for second-order stationary points of nonlinear semidefinite optimization problems
- Sequences of random matrices modulated by a discrete-time Markov chain*
- A modified alternating direction method for convex quadratically constrained quadratic semidefinite programs
This page was built for publication: A Quadratically Convergent Newton Method for Computing the Nearest Correlation Matrix
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3435003)
