Pages that link to "Item:Q3005390"

The following pages link to An augmented Lagrangian dual approach for the H-weighted nearest correlation matrix problem (Q3005390):

Displaying 28 items.

• Anderson acceleration of the alternating projections method for computing the nearest correlation matrix (Q306368) (← links)
• A rank-corrected procedure for matrix completion with fixed basis coefficients (Q312678) (← links)
• An augmented Lagrangian dual optimization approach to the \(H\)-weighted model updating problem (Q396261) (← links)
• On the generalized low rank approximation of the correlation matrices arising in the asset portfolio (Q406470) (← links)
• Conditional quadratic semidefinite programming: examples and methods (Q489109) (← links)
• A regularized strong duality for nonsymmetric semidefinite least squares problem (Q644518) (← links)
• An inexact spectral bundle method for convex quadratic semidefinite programming (Q694539) (← links)
• Exact augmented Lagrangian functions for nonlinear semidefinite programming (Q1616939) (← links)
• A primal majorized semismooth Newton-CG augmented Lagrangian method for large-scale linearly constrained convex programming (Q1694389) (← links)
• Lyapunov-type least-squares problems over symmetric cones (Q1758453) (← links)
• \(t\)-copula from the viewpoint of tail dependence matrices (Q2146466) (← links)
• Supervised distance preserving projection using alternating direction method of multipliers (Q2190310) (← links)
• A matrix nonconvex relaxation approach to unconstrained binary polynomial programs (Q2696928) (← links)
• Projection Methods in Conic Optimization (Q2802538) (← links)
• Restoring Definiteness via Shrinking, with an Application to Correlation Matrices with a Fixed Block (Q2805267) (← links)
• Penalty decomposition methods for rank minimization (Q2943834) (← links)
• A 2-block semi-proximal ADMM for solving the <i>H</i>-weighted nearest correlation matrix problem (Q2977629) (← links)
• Decomposition Methods for Sparse Matrix Nearness Problems (Q3456880) (← links)
• Gradient methods and conic least-squares problems (Q3458817) (← links)
• A note on the sufficient initial condition ensuring the convergence of directly extended 3-block ADMM for special semidefinite programming (Q4646527) (← links)
• A dual active-set proximal Newton algorithm for sparse approximation of correlation matrices (Q5058396) (← links)
• A Three-Operator Splitting Perspective of a Three-Block ADMM for Convex Quadratic Semidefinite Programming and Beyond (Q5149523) (← links)
• Proximal Gradient Method for Nonsmooth Optimization over the Stiefel Manifold (Q5210519) (← links)
• A convex quadratic semi-definite programming approach to the partial additive constant problem in multidimensional scaling (Q5300818) (← links)
• On the low rank solution of the Q‐weighted nearest correlation matrix problem (Q5739764) (← links)
• Calibrating low-rank correlation matrix problem: an SCA-based approach (Q5746715) (← links)
• Polynomial whitening for high-dimensional data (Q6178887) (← links)
• Nonsmooth optimization over the Stiefel manifold and beyond: proximal gradient method and recent variants (Q6540011) (← links)