A projected semismooth Newton method for problems of calibrating least squares covariance matrix
From MaRDI portal
Publication:2275573
DOI10.1016/j.orl.2011.01.004zbMath1218.90220MaRDI QIDQ2275573
Publication date: 9 August 2011
Published in: Operations Research Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.orl.2011.01.004
Related Items
An Efficient Quadratic Programming Relaxation Based Algorithm for Large-Scale MIMO Detection, On the generalized low rank approximation of the correlation matrices arising in the asset portfolio, An accelerated active-set algorithm for a quadratic semidefinite program with general constraints, Limited memory BFGS algorithm for the matrix approximation problem in Frobenius norm, A Euclidean distance matrix model for protein molecular conformation, Limited memory BFGS method for least squares semidefinite programming with banded structure
Cites Work
- Unnamed Item
- Computing the nearest correlation matrix--a problem from finance
- An inexact SQP Newton method for convex SC\(^{1}\) minimization problems
- Positive semidefinite matrix completions on chordal graphs and constraint nondegeneracy in semidefinite programming
- A QP-free constrained Newton-type method for variational inequality problems
- Complementarity and nondegeneracy in semidefinite programming
- Correlation stress testing for value-at-risk: an unconstrained convex optimization approach
- A Newton-CG Augmented Lagrangian Method for Semidefinite Programming
- A Quadratically Convergent Newton Method for Computing the Nearest Correlation Matrix
- Calibrating Least Squares Semidefinite Programming with Equality and Inequality Constraints
- Constraint Nondegeneracy, Strong Regularity, and Nonsingularity in Semidefinite Programming
- Solution of Sparse Indefinite Systems of Linear Equations
- On the Accurate Identification of Active Constraints
- A Dual Approach to Semidefinite Least-Squares Problems
- Projected Newton Methods for Optimization Problems with Simple Constraints
- A preconditioned Newton algorithm for the nearest correlation matrix
- The Strong Second-Order Sufficient Condition and Constraint Nondegeneracy in Nonlinear Semidefinite Programming and Their Implications
- Least-Squares Covariance Matrix Adjustment
- Semismooth Matrix-Valued Functions