Error bounds for rank constrained optimization problems and applications
From MaRDI portal
Publication:1790190
DOI10.1016/j.orl.2016.03.002zbMath1408.90279arXiv1603.07070OpenAlexW2299239058MaRDI QIDQ1790190
Publication date: 2 October 2018
Published in: Operations Research Letters (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1603.07070
Convex programming (90C25) Nonlinear programming (90C30) Derivative-free methods and methods using generalized derivatives (90C56) Nonsmooth analysis (49J52)
Related Items (9)
Exact penalization for cardinality and rank-constrained optimization problems via partial regularization ⋮ An inexact proximal DC algorithm with sieving strategy for rank constrained least squares semidefinite programming ⋮ A low-rank spectral method for learning Markov models ⋮ Calmness of partial perturbation to composite rank constraint systems and its applications ⋮ A global exact penalty for rank-constrained optimization problem and applications ⋮ A matrix nonconvex relaxation approach to unconstrained binary polynomial programs ⋮ A multi-stage convex relaxation approach to noisy structured low-rank matrix recovery ⋮ A proximal DC approach for quadratic assignment problem ⋮ Matrix optimization over low-rank spectral sets: stationary points and local and global minimizers
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- An implementable proximal point algorithmic framework for nuclear norm minimization
- On the rank minimization problem and its control applications
- Error bounds for nondifferentiable convex inequalities under a strong Slater constraint qualification
- Error bounds for inconsistent linear inequalities and programs
- Error bounds in mathematical programming
- Optimal low-rank approximation to a correlation matrix
- Solving a low-rank factorization model for matrix completion by a nonlinear successive over-relaxation algorithm
- Exact matrix completion via convex optimization
- Improved Iteratively Reweighted Least Squares for Unconstrained Smoothed $\ell_q$ Minimization
- Penalty decomposition methods for rank minimization
- Implicit Functions and Solution Mappings
- Guaranteed Minimum-Rank Solutions of Linear Matrix Equations via Nuclear Norm Minimization
- Generalized equations and their solutions, Part I: Basic theory
- Global Error Bounds for Convex Conic Problems
- Recovering Low-Rank Matrices From Few Coefficients in Any Basis
- Greedy Sparsity-Constrained Optimization
This page was built for publication: Error bounds for rank constrained optimization problems and applications
