Pages that link to "Item:Q270046"
From MaRDI portal
The following pages link to Structure methods for solving the nearest correlation matrix problem (Q270046):
Displaying 16 items.
- Computing the nearest correlation matrix--a problem from finance (Q146787) (← links)
- Primal-dual active-set methods for large-scale optimization (Q493264) (← links)
- A feasible filter method for the nearest low-rank correlation matrix problem (Q494667) (← links)
- Newton's method for computing the nearest correlation matrix with a simple upper bound (Q620444) (← links)
- Block relaxation and majorization methods for the nearest correlation matrix with factor structure (Q763394) (← links)
- Alternative gradient algorithms for computing the nearest correlation matrix (Q2451348) (← links)
- An application of the nearest correlation matrix on web document classification (Q2468845) (← links)
- A lower bound for the nearest correlation matrix problem based on the circulant mean (Q2514033) (← links)
- Computing a Nearest Correlation Matrix with Factor Structure (Q3079761) (← links)
- Decomposition Methods for Sparse Matrix Nearness Problems (Q3456880) (← links)
- Estimation of Positive Semidefinite Correlation Matrices by Using Convex Quadratic Semidefinite Programming (Q3497617) (← links)
- A class of multilevel structured low-rank approximation arising in material processing (Q4641554) (← links)
- (Q5142497) (← links)
- Correlation matrix nearness and completion under observation uncertainty (Q5174190) (← links)
- A preconditioned Newton algorithm for the nearest correlation matrix (Q5189126) (← links)
- On the low rank solution of the Q‐weighted nearest correlation matrix problem (Q5739764) (← links)
