An implementable proximal point algorithmic framework for nuclear norm minimization
From MaRDI portal
Publication:431025
DOI10.1007/s10107-010-0437-8zbMath1262.90125MaRDI QIDQ431025
Defeng Sun, Kim-Chuan Toh, Yong-Jin Liu
Publication date: 26 June 2012
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10107-010-0437-8
proximal point method; gradient projection method; rank minimization; nuclear norm minimization; accelerated proximal gradient method
65K05: Numerical mathematical programming methods
90C22: Semidefinite programming
90C25: Convex programming
46N10: Applications of functional analysis in optimization, convex analysis, mathematical programming, economics
Related Items
Linearized augmented Lagrangian and alternating direction methods for nuclear norm minimization, A variational approach of the rank function, \(s\)-goodness for low-rank matrix recovery, Approximation of rank function and its application to the nearest low-rank correlation matrix, Convergence of fixed-point continuation algorithms for matrix rank minimization, Templates for convex cone problems with applications to sparse signal recovery, Accelerated linearized Bregman method, Solving a low-rank factorization model for matrix completion by a nonlinear successive over-relaxation algorithm
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Solving semidefinite-quadratic-linear programs using SDPT3
- Smooth minimization of non-smooth functions
- A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
- Fixed point and Bregman iterative methods for matrix rank minimization
- Convex optimization methods for dimension reduction and coefficient estimation in multivariate linear regression
- Nuclear norm minimization for the planted clique and biclique problems
- Solving Euclidean distance matrix completion problems via semidefinite progrmming
- Problems of distance geometry and convex properties of quadratic maps
- Second-order cone programming
- A nonlinear programming algorithm for solving semidefinite programs via low-rank factorization
- Introductory lectures on convex optimization. A basic course.
- The geometry of graphs and some of its algorithmic applications
- Local minima and convergence in low-rank semidefinite programming
- Exact matrix completion via convex optimization
- A Newton-CG Augmented Lagrangian Method for Semidefinite Programming
- A Singular Value Thresholding Algorithm for Matrix Completion
- Two-Metric Projection Methods for Constrained Optimization
- Near-Optimal Signal Recovery From Random Projections: Universal Encoding Strategies?
- Interior-Point Method for Nuclear Norm Approximation with Application to System Identification
- Guaranteed Minimum-Rank Solutions of Linear Matrix Equations via Nuclear Norm Minimization
- On the Goldstein-Levitin-Polyak gradient projection method
- Monotone Operators and the Proximal Point Algorithm
- Augmented Lagrangians and Applications of the Proximal Point Algorithm in Convex Programming
- Practical Aspects of the Moreau--Yosida Regularization: Theoretical Preliminaries
- Using SeDuMi 1.02, A Matlab toolbox for optimization over symmetric cones
- Prox-Method with Rate of Convergence O(1/t) for Variational Inequalities with Lipschitz Continuous Monotone Operators and Smooth Convex-Concave Saddle Point Problems
- Functional Analysis
- Framework for kernel regularization with application to protein clustering
- Proximité et dualité dans un espace hilbertien
- Convex programming in Hilbert space
- Convex Analysis
- Compressed sensing
