A QUADRATICALLY CONVERGENT NEWTON METHOD FOR COMPUTING THE NEAREST CORRELATION MATRIX
Bachelor's
Saved in:
Main Author: | ZHANG CHANG |
---|---|
Other Authors: | MATHEMATICS |
Published: |
2021
|
Online Access: | https://scholarbank.nus.edu.sg/handle/10635/202805 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | National University of Singapore |
Similar Items
-
A quadratically convergent newton method for computing the nearest correlation matrix
by: Qi, H., et al.
Published: (2014) -
CHARACTERIZATION OF QUADRATIC CONVERGENCE OF NEWTON'S METHOD ON SEMIDEFINITE PROGRAMMING
by: CHAN ZI XIAN
Published: (2021) -
A smoothing newton-type algorithm of stronger convergence for the quadratically constrained convex quadratic programming
by: Huang, Z.-H., et al.
Published: (2014) -
Sub-quadratic convergence of a smoothing Newton algorithm for the P 0 - And monotone LCP
by: Huang, Z.-H., et al.
Published: (2014) -
Applying a Newton method to strictly convex separable network quadratic programs
by: Sun, J., et al.
Published: (2013)