Solving Nuclear Norm Regularized and Semidefinite Matrix Least Squares Problems with Linear Equality Constraints

DOI10.1007/978-3-319-00200-2_9zbMath1297.90085OpenAlexW68366368MaRDI QIDQ2848997

Kaifeng Jiang, Kim-Chuan Toh, Defeng Sun

Publication date: 13 September 2013

Published in: Discrete Geometry and Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-00200-2_9

zbMATH Keywords

nuclear norm minimizationEuclidean distance matrix completionpartial proximal-point algorithmsemidefinite least squares problem

Mathematics Subject Classification ID

Semidefinite programming (90C22) Convex programming (90C25) Large-scale problems in mathematical programming (90C06) Iterative numerical methods for linear systems (65F10)

Related Items (10)

A rank-corrected procedure for matrix completion with fixed basis coefficients ⋮ Augmented Lagrangian methods for convex matrix optimization problems ⋮ Quadratic Growth Conditions for Convex Matrix Optimization Problems Associated with Spectral Functions ⋮ Supervised distance preserving projection using alternating direction method of multipliers ⋮ A semismooth Newton based dual proximal point algorithm for maximum eigenvalue problem ⋮ Computing the nearest Euclidean distance matrix with low embedding dimensions ⋮ Robust Euclidean embedding via EDM optimization ⋮ A semismooth Newton-CG based dual PPA for matrix spectral norm approximation problems ⋮ On the R-superlinear convergence of the KKT residuals generated by the augmented Lagrangian method for convex composite conic programming ⋮ A semismooth Newton-based augmented Lagrangian algorithm for density matrix least squares problems

This page was built for publication: Solving Nuclear Norm Regularized and Semidefinite Matrix Least Squares Problems with Linear Equality Constraints