An efficient method for convex constrained rank minimization problems based on DC programming

DOI10.1155/2016/7473041zbMath1400.90248OpenAlexW2500464928WikidataQ59141181 ScholiaQ59141181MaRDI QIDQ1793529

Jinkai Zhao, Wanping Yang, Feng-Min Xu

Publication date: 12 October 2018

Published in: Mathematical Problems in Engineering (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1155/2016/7473041

Mathematics Subject Classification ID

Convex programming (90C25) Nonconvex programming, global optimization (90C26)

Uses Software

• COL
• Max-AO

Cites Work

• Unnamed Item
• Unnamed Item
• Fixed point and Bregman iterative methods for matrix rank minimization
• Maximum stable set formulations and heuristics based on continuous optimization
• Distance matrix completion by numerical optimization
• Optimal low-rank approximation to a correlation matrix
• LMI-based relaxed nonquadratic stabilization conditions for nonlinear systems in the Takagi-Sugeno's form
• Identification of the position of an equilibrium attitude of the international space station as a problem of stable matrix completion
• Penalty decomposition methods for rank minimization
• Analysis of a Collaborative Filter Based on Popularity Amongst Neighbors
• A Singular Value Thresholding Algorithm for Matrix Completion
• Guaranteed Minimum-Rank Solutions of Linear Matrix Equations via Nuclear Norm Minimization
• Matrix Analysis
• Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
• A Spectral Bundle Method for Semidefinite Programming
• Solving Large-Scale Sparse Semidefinite Programs for Combinatorial Optimization
• A Channel Coding Perspective of Collaborative Filtering
• Matrix Completion From a Few Entries

This page was built for publication: An efficient method for convex constrained rank minimization problems based on DC programming