Multistage convex relaxation approach to rank regularized minimization problems based on equivalent mathematical program with a generalized complementarity constraint
From MaRDI portal
Publication:5348478
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
Cites work
- scientific article; zbMATH DE number 6276219 (Why is no real title available?)
- A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
- A Singular Value Thresholding Algorithm for Matrix Completion
- A rank-corrected procedure for matrix completion with fixed basis coefficients
- A simpler approach to matrix completion
- An accelerated proximal gradient algorithm for nuclear norm regularized linear least squares problems
- Analysis of multi-stage convex relaxation for sparse regularization
- Consistency of trace norm minimization
- Constraint Qualifications and Necessary Optimality Conditions for Optimization Problems with Variational Inequality Constraints
- Convex Analysis
- Estimation of (near) low-rank matrices with noise and high-dimensional scaling
- Exact matrix completion via convex optimization
- First order optimality conditions for mathematical programs with semidefinite cone complementarity constraints
- Guaranteed minimum-rank solutions of linear matrix equations via nuclear norm minimization
- Improved iteratively reweighted least squares for unconstrained smoothed \(\ell_q\) minimization
- Interior-point method for nuclear norm approximation with application to system identification
- Mathematical programs with complementarity constraints: stationarity, optimality, and sensi\-tivity.
- Mathematical programs with semidefinite cone complementarity constraints: constraint qualifications and optimality conditions
- Minimax Rates of Estimation for High-Dimensional Linear Regression Over $\ell_q$-Balls
- Noisy low-rank matrix completion with general sampling distribution
- Nuclear-norm penalization and optimal rates for noisy low-rank matrix completion
- Optimal low-rank approximation to a correlation matrix
- Recovering Low-Rank Matrices From Few Coefficients in Any Basis
- Restricted strong convexity and weighted matrix completion: optimal bounds with noise
- Review Paper. Interest–rate term–structure pricing models: a review
- Some sharp performance bounds for least squares regression with L₁ regularization
- The sparsity and bias of the LASSO selection in high-dimensional linear regression
- Tight Oracle Inequalities for Low-Rank Matrix Recovery From a Minimal Number of Noisy Random Measurements
- Trace norm regularization: reformulations, algorithms, and multi-task learning
Cited in
(8)- Second-order optimality conditions for mathematical program with semidefinite cone complementarity constraints and applications
- 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
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)
