A novel method for a class of structured low-rank minimizations with equality constraint
From MaRDI portal
Publication:1675980
DOI10.1016/j.cam.2017.09.021zbMath1376.65092OpenAlexW2756045499MaRDI QIDQ1675980
Jianchao Bai, Ping-Fan Dai, Ji-Cheng Li, Feng-Min Xu
Publication date: 3 November 2017
Published in: Journal of Computational and Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cam.2017.09.021
convergencenumerical experimentslow-rankequality constraintmatrix optimization problemsaccelerated augmented Lagrangian methodpositive semidefinite constraint
Numerical mathematical programming methods (65K05) Semidefinite programming (90C22) Convex programming (90C25)
Cites Work
- Unnamed Item
- Unnamed Item
- Computing the nearest correlation matrix--a problem from finance
- A class of weighted low rank approximation of the positive semidefinite Hankel matrix
- Accelerated Bregman method for linearly constrained \(\ell _1-\ell _2\) minimization
- On the generalized low rank approximation of the correlation matrices arising in the asset portfolio
- On the information in the interest rate term structure and option prices
- A majorization algorithm for constrained correlation matrix approximation
- Efficient rank reduction of correlation matrices
- Local minima and convergence in low-rank semidefinite programming
- Low rank approximation of the symmetric positive semidefinite matrix
- On the Global Convergence of the BFGS Method for Nonconvex Unconstrained Optimization Problems
- Penalty decomposition methods for rank minimization
- On rank-constrained Hermitian nonnegative-definite least squares solutions to the matrix equationAXAH=B
- Variational Analysis
- On the low rank solution of the Q‐weighted nearest correlation matrix problem
