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)- The spherical constraint in Boolean quadratic programs
- A matrix nonconvex relaxation approach to unconstrained binary polynomial programs
- On FISTA with a relative error rule
- Projection Methods in Conic Optimization
- A majorization algorithm for constrained correlation matrix approximation
- Global convergence of Riemannian line search methods with a Zhang-Hager-type condition
- Local convergence of primal-dual interior point methods for nonlinear semidefinite optimization using the Monteiro-Tsuchiya family of search directions
- A semidefinite programming approach for the projection onto the cone of negative semidefinite symmetric tensors with applications to solid mechanics
- QSDPNAL: a two-phase augmented Lagrangian method for convex quadratic semidefinite programming
- A semismooth Newton method for support vector classification and regression
- Inexact SA method for constrained stochastic convex SDP and application in Chinese stock market
- Newton's method for computing the nearest correlation matrix with a simple upper bound
- An application of the nearest correlation matrix on web document classification
- Approximation of rank function and its application to the nearest low-rank correlation matrix
- Statistical rehabilitation of improper correlation matrices
- Estimation of Positive Semidefinite Correlation Matrices by Using Convex Quadratic Semidefinite Programming
- Fréchet regression for random objects with Euclidean predictors
- A primal majorized semismooth Newton-CG augmented Lagrangian method for large-scale linearly constrained convex programming
- Correlation matrix nearness and completion under observation uncertainty
- Solving \(k\)-cluster problems to optimality with semidefinite programming
- scientific article; zbMATH DE number 6860781 (Why is no real title available?)
- A unified kernel function approach to primal-dual interior-point algorithms for convex quadratic SDO
- An inexact Riemannian proximal gradient method
- A new methodology to create valid time-dependent correlation matrices via isospectral flows
- Computing cardinality constrained portfolio selection efficient frontiers via closest correlation matrices
- Constrained best Euclidean distance embedding on a sphere: a matrix optimization approach
- Proximal alternating direction method with relaxed proximal parameters for the least squares covariance adjustment problem
- Decomposition methods for sparse matrix nearness problems
- \(t\)-copula from the viewpoint of tail dependence matrices
- Parameter-related projection-based iterative algorithm for a kind of generalized positive semidefinite least squares problem
- Primal-dual interior-point algorithm for convex quadratic semi-definite optimization
- An accelerated active-set algorithm for a quadratic semidefinite program with general constraints
- On the generalized low rank approximation of the correlation matrices arising in the asset portfolio
- A semismooth Newton-type method for the nearest doubly stochastic matrix problem
- Estimating Cell-Type-Specific Gene Co-Expression Networks from Bulk Gene Expression Data with an Application to Alzheimer’s Disease
- An Efficient Approximation of Spatial Correlation Based on Gauss–Hermite Quadrature
- 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
- Sparse estimation of high-dimensional correlation matrices
- Computing a nearest correlation matrix with factor structure
- A penalty method for rank minimization problems in symmetric matrices
- A Three-Operator Splitting Perspective of a Three-Block ADMM for Convex Quadratic Semidefinite Programming and Beyond
- Composite difference-MAX programs for modern statistical estimation problems
- Estimating large covariance matrix with network topology for high-dimensional biomedical data
- Sparse Markowitz portfolio selection by using stochastic linear complementarity approach
- Generating Correlation Matrices With Specified Eigenvalues Using the Method of Alternating Projections
- An inexact SQP Newton method for convex SC\(^{1}\) minimization problems
- Semidefinite inverse eigenvalue problems with prescribed entries and partial eigendata
- On how to solve large-scale log-determinant optimization problems
- On the R-superlinear convergence of the KKT residuals generated by the augmented Lagrangian method for convex composite conic programming
- A large-update interior-point algorithm for convex quadratic semi-definite optimization based on a new kernel function
- Positive semidefinite matrix completions on chordal graphs and constraint nondegeneracy in semidefinite programming
- Actuarial risk matrices: the nearest positive semidefinite matrix problem
- Computing the nearest low-rank correlation matrix by a simplified SQP algorithm
- A convex matrix optimization for the additive constant problem in multidimensional scaling with application to locally linear embedding
- An inexact projected gradient method with rounding and lifting by nonlinear programming for solving rank-one semidefinite relaxation of polynomial optimization
- Gradient methods and conic least-squares problems
- Alternating projection method for doubly stochastic inverse eigenvalue problems with partial eigendata
- Complexity analysis of interior-point methods for second-order stationary points of nonlinear semidefinite optimization problems
- Alternative gradient algorithms for computing the nearest correlation matrix
- Computing the best approximation over the intersection of a polyhedral set and the doubly nonnegative cone
- The supporting halfspace-quadratic programming strategy for the dual of the best approximation problem
- Three non-Gaussian models of dependence in returns
- Restoring definiteness via shrinking, with an application to correlation matrices with a fixed block
- Modified multiplicative update algorithms for computing the nearest correlation matrix
- Optimality conditions and global convergence for nonlinear semidefinite programming
- Adjusting covariance matrix for risk management
- An inexact primal-dual path following algorithm for convex quadratic SDP
- A Black-Litterman approach to correlation stress testing
- A rank-corrected procedure for matrix completion with fixed basis coefficients
- Tri-criterion modeling for constructing more-sustainable mutual funds
- Limited memory BFGS algorithm for the matrix approximation problem in Frobenius norm
- Bounds for the distance to the nearest correlation matrix
- scientific article; zbMATH DE number 7370529 (Why is no real title available?)
- A dual based semismooth Newton-type algorithm for solving large-scale sparse Tikhonov regularization problems
- A framework of constraint preserving update schemes for optimization on Stiefel manifold
- An interior point method with a primal-dual quadratic barrier penalty function for nonlinear semidefinite programming
- A partial proximal point algorithm for nuclear norm regularized matrix least squares problems
- A partial parallel splitting augmented Lagrangian method for solving constrained matrix optimization problems
- A 2-block semi-proximal ADMM for solving the H-weighted nearest correlation matrix problem
- Robust Causal Structure Learning with Some Hidden Variables
- A projected semismooth Newton method for problems of calibrating least squares covariance matrix
- An efficient augmented Lagrangian method for support vector machine
- A calibration method for non-positive definite covariance matrix in multivariate data analysis
- On cone of nonsymmetric positive semidefinite matrices
- Computing the nearest correlation matrix--a problem from finance
- Block relaxation and majorization methods for the nearest correlation matrix with factor structure
- Efficient high-dimensional material reliability analysis with explicit voxel-level stochastic microstructure representation
- A modified alternating direction method for convex quadratically constrained quadratic semidefinite programs
- A sequential semismooth Newton method for the nearest low-rank correlation matrix problem
- On the efficient computation of a generalized Jacobian of the projector over the Birkhoff polytope
- Estimation of correlations in portfolio credit risk models based on noisy security prices
- Pricing and hedging basket options to prespecified levels of acceptability
- Minimum rank (skew) Hermitian solutions to the matrix approximation problem in the spectral norm
- An inexact accelerated proximal gradient method and a dual Newton-CG method for the maximal entropy problem
- A Filter Active-Set Algorithm for Ball/Sphere Constrained Optimization Problem
- A lower bound for the nearest correlation matrix problem based on the circulant mean
- On the low rank solution of the Q-weighted nearest correlation matrix problem.
- Sequences of random matrices modulated by a discrete-time Markov chain*
- A convex quadratic semi-definite programming approach to the partial additive constant problem in multidimensional scaling
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)
