Solving nuclear norm regularized and semidefinite matrix least squares problems with linear equality constraints
DOI10.1007/978-3-319-00200-2_9zbMATH Open1297.90085OpenAlexW68366368MaRDI QIDQ2848997FDOQ2848997
Authors: Kaifeng Jiang, Defeng Sun, Kim-Chuan Toh 
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
Recommendations
- A partial proximal point algorithm for nuclear norm regularized matrix least squares problems
- An accelerated proximal gradient algorithm for nuclear norm regularized linear least squares problems
- An implementable proximal point algorithmic framework for nuclear norm minimization
- Fixed point and Bregman iterative methods for matrix rank minimization
- An alternating direction method for linear-constrained matrix nuclear norm minimization.
nuclear norm minimizationEuclidean distance matrix completionpartial proximal-point algorithmsemidefinite least squares problem
Convex programming (90C25) Large-scale problems in mathematical programming (90C06) Semidefinite programming (90C22) Iterative numerical methods for linear systems (65F10)
Cited In (15)
- Selecting Regularization Parameters for Nuclear Norm--Type Minimization Problems
- On the R-superlinear convergence of the KKT residuals generated by the augmented Lagrangian method for convex composite conic programming
- A rank-corrected procedure for matrix completion with fixed basis coefficients
- A semismooth Newton-CG based dual PPA for matrix spectral norm approximation problems
- Quadratic growth conditions for convex matrix optimization problems associated with spectral functions
- A partial proximal point algorithm for nuclear norm regularized matrix least squares problems
- Distributed Design for Nuclear Norm Minimization of Linear Matrix Equations With Constraints
- Computing the nearest Euclidean distance matrix with low embedding dimensions
- A semismooth Newton stochastic proximal point algorithm with variance reduction
- Augmented Lagrangian methods for convex matrix optimization problems
- A semismooth Newton based dual proximal point algorithm for maximum eigenvalue problem
- A regularized strong duality for nonsymmetric semidefinite least squares problem
- Supervised distance preserving projection using alternating direction method of multipliers
- Robust Euclidean embedding via EDM optimization
- 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
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2848997)
