A partial proximal point algorithm for nuclear norm regularized matrix least squares problems
From MaRDI portal
Publication:495943
DOI10.1007/s12532-014-0069-8zbMath1327.90109OpenAlexW2085013758MaRDI QIDQ495943
Kaifeng Jiang, Defeng Sun, Kim-Chuan Toh
Publication date: 16 September 2015
Published in: Mathematical Programming Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s12532-014-0069-8
Semidefinite programming (90C22) Convex programming (90C25) Large-scale problems in mathematical programming (90C06) Iterative numerical methods for linear systems (65F10)
Related Items
A rank-corrected procedure for matrix completion with fixed basis coefficients, An Adaptive Correction Approach for Tensor Completion, An inexact proximal DC algorithm with sieving strategy for rank constrained least squares semidefinite programming, A low-rank spectral method for learning Markov models, Learning Markov Models Via Low-Rank Optimization, A semismooth Newton based dual proximal point algorithm for maximum eigenvalue problem, A Corrected Tensor Nuclear Norm Minimization Method for Noisy Low-Rank Tensor Completion, 3D genome reconstruction from partially phased Hi-C data, A Highly Efficient Semismooth Newton Augmented Lagrangian Method for Solving Lasso Problems, Robust Euclidean embedding via EDM optimization, QSDPNAL: a two-phase augmented Lagrangian method for convex quadratic semidefinite programming, A semismooth Newton-CG based dual PPA for matrix spectral norm approximation problems, A Euclidean distance matrix model for protein molecular conformation, Relaxation algorithms for matrix completion, with applications to seismic travel-time data interpolation, A Stochastic Semismooth Newton Method for Nonsmooth Nonconvex Optimization
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- An implementable proximal point algorithmic framework for nuclear norm minimization
- Fixed point and Bregman iterative methods for matrix rank minimization
- Nuclear norm minimization for the planted clique and biclique problems
- Non-negative matrix factorization with fixed row and column sums
- A generalization of the Eckart-Young-Mirsky matrix approximation theorem
- Fat homeomorphisms and unbounded derivate containers
- Characterization of the subdifferential of some matrix norms
- On the Douglas-Rachford splitting method and the proximal point algorithm for maximal monotone operators
- A dual algorithm for the solution of nonlinear variational problems via finite element approximation
- Solving Euclidean distance matrix completion problems via semidefinite progrmming
- Solution of monotone complementarity problems with locally Lipschitzian functions
- Über monotone Matrixfunktionen
- Structured low rank approximation
- A nonsmooth version of Newton's method
- Estimating rating transition probabilities with missing data
- Concerning nonnegative matrices and doubly stochastic matrices
- Semismoothness of solutions to generalized equations and the Moreau-Yosida regularization
- Exact matrix completion via convex optimization
- A Newton-CG Augmented Lagrangian Method for Semidefinite Programming
- A Singular Value Thresholding Algorithm for Matrix Completion
- Trace Norm Regularization: Reformulations, Algorithms, and Multi-Task Learning
- SYMMETRIC GAUGE FUNCTIONS AND UNITARILY INVARIANT NORMS
- A Quadratically Convergent Newton Method for Computing the Nearest Correlation Matrix
- A Generalization of the Proximal Point Algorithm
- Calibrating Least Squares Semidefinite Programming with Equality and Inequality Constraints
- Guaranteed Minimum-Rank Solutions of Linear Matrix Equations via Nuclear Norm Minimization
- Optimization and nonsmooth analysis
- Bi-CGSTAB: A Fast and Smoothly Converging Variant of Bi-CG for the Solution of Nonsymmetric Linear Systems
- Monotone Operators and the Proximal Point Algorithm
- Semismooth and Semiconvex Functions in Constrained Optimization
- Augmented Lagrangians and Applications of the Proximal Point Algorithm in Convex Programming
- Partial Proximal Minimization Algorithms for Convex Pprogramming
- SDPT3 — A Matlab software package for semidefinite programming, Version 1.3
- Using SeDuMi 1.02, A Matlab toolbox for optimization over symmetric cones
- PARTIAL PROXIMAL METHOD OF MULTIPLIERS FOR CONVEX PROGRAMMING PROBLEMS
- Computing the Nearest Doubly Stochastic Matrix with A Prescribed Entry
- Proximité et dualité dans un espace hilbertien
- Convex Analysis
- On the basic theorem of complementarity
- Semismooth Matrix-Valued Functions
- A partial Padé-via-Lanczos method for reduced-order modeling
