Multistage convex relaxation approach to rank regularized minimization problems based on equivalent mathematical program with a generalized complementarity constraint
From MaRDI portal
Publication:5348478
DOI10.1137/15M1037160zbMATH Open1369.90173OpenAlexW2745004303MaRDI QIDQ5348478FDOQ5348478
Authors: Shujun Bi, Shaohua Pan 
Publication date: 18 August 2017
Published in: SIAM Journal on Control and Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/15m1037160
Recommendations
- A multi-stage convex relaxation approach to noisy structured low-rank matrix recovery
- Two-stage convex relaxation approach to low-rank and sparsity regularized least squares loss
- Two relaxation methods for rank minimization problems
- Two-stage convex relaxation approach to least squares loss constrained low-rank plus sparsity optimization problems
- Convex relaxation algorithm for a structured simultaneous low-rank and sparse recovery problem
Nonconvex programming, global optimization (90C26) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33) Numerical methods of relaxation type (49M20)
Cites Work
- A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
- Analysis of multi-stage convex relaxation for sparse regularization
- A Singular Value Thresholding Algorithm for Matrix Completion
- The sparsity and bias of the LASSO selection in high-dimensional linear regression
- Noisy low-rank matrix completion with general sampling distribution
- Exact matrix completion via convex optimization
- Minimax Rates of Estimation for High-Dimensional Linear Regression Over $\ell_q$-Balls
- Estimation of (near) low-rank matrices with noise and high-dimensional scaling
- Nuclear-norm penalization and optimal rates for noisy low-rank matrix completion
- Guaranteed minimum-rank solutions of linear matrix equations via nuclear norm minimization
- Tight Oracle Inequalities for Low-Rank Matrix Recovery From a Minimal Number of Noisy Random Measurements
- Restricted strong convexity and weighted matrix completion: optimal bounds with noise
- Convex Analysis
- Some sharp performance bounds for least squares regression with \(L_1\) regularization
- Mathematical programs with complementarity constraints: stationarity, optimality, and sensi\-tivity.
- Improved iteratively reweighted least squares for unconstrained smoothed \(\ell_q\) minimization
- An accelerated proximal gradient algorithm for nuclear norm regularized linear least squares problems
- Consistency of trace norm minimization
- Interior-point method for nuclear norm approximation with application to system identification
- Recovering Low-Rank Matrices From Few Coefficients in Any Basis
- A simpler approach to matrix completion
- Optimal low-rank approximation to a correlation matrix
- Review Paper. Interest–rate term–structure pricing models: a review
- A rank-corrected procedure for matrix completion with fixed basis coefficients
- First order optimality conditions for mathematical programs with semidefinite cone complementarity constraints
- Title not available (Why is that?)
- Constraint Qualifications and Necessary Optimality Conditions for Optimization Problems with Variational Inequality Constraints
- Trace norm regularization: reformulations, algorithms, and multi-task learning
- Mathematical programs with semidefinite cone complementarity constraints: constraint qualifications and optimality conditions
Cited In (8)
- Two-stage convex relaxation approach to low-rank and sparsity regularized least squares loss
- A multi-stage convex relaxation approach to noisy structured low-rank matrix recovery
- Two-stage convex relaxation approach to least squares loss constrained low-rank plus sparsity optimization problems
- Equivalent Lipschitz surrogates for zero-norm and rank optimization problems
- Several classes of stationary points for rank regularized minimization problems
- A global exact penalty for rank-constrained optimization problem and applications
- Calmness of partial perturbation to composite rank constraint systems and its applications
- Second-order optimality conditions for mathematical program with semidefinite cone complementarity constraints and applications
This page was built for publication: Multistage convex relaxation approach to rank regularized minimization problems based on equivalent mathematical program with a generalized complementarity constraint
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5348478)
