Several Classes of Stationary Points for Rank Regularized Minimization Problems
From MaRDI portal
Publication:3300765
DOI10.1137/19M1270987zbMath1447.90041arXiv1906.08922OpenAlexW3038810201MaRDI QIDQ3300765
Shujun Bi, Shaohua Pan, Yu-Lan Liu
Publication date: 30 July 2020
Published in: SIAM Journal on Optimization (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1906.08922
Nonconvex programming, global optimization (90C26) Nonsmooth analysis (49J52) Set-valued and variational analysis (49J53)
Related Items
Second-order optimality conditions for mathematical program with semidefinite cone complementarity constraints and applications, Variational analysis perspective on linear convergence of some first order methods for nonsmooth convex optimization problems
Cites Work
- Unnamed Item
- Unnamed Item
- Lipschitz and Hölder stability of optimization problems and generalized equations
- A rank-corrected procedure for matrix completion with fixed basis coefficients
- First order optimality conditions for mathematical programs with semidefinite cone complementarity constraints
- Estimation of (near) low-rank matrices with noise and high-dimensional scaling
- On metric and calmness qualification conditions in subdifferential calculus
- Characterization of the subdifferential of some matrix norms
- Sensitivity analysis for nonsmooth generalized equations
- Restricted Robinson constraint qualification and optimality for cardinality-constrained cone programming
- Equivalent Lipschitz surrogates for zero-norm and rank optimization problems
- Implicit multifunction theorems for the sensitivity analysis of variational conditions
- Generalized subdifferentials of the rank function
- An introduction to a class of matrix cone programming
- On M-stationary points for mathematical programs with equilibrium constraints
- Nonsmooth analysis of singular values. I: Theory
- Improved Iteratively Reweighted Least Squares for Unconstrained Smoothed $\ell_q$ Minimization
- Hankel Matrix Rank Minimization with Applications to System Identification and Realization
- Computing B-Stationary Points of Nonsmooth DC Programs
- Implicit Functions and Solution Mappings
- Complete Characterization of Openness, Metric Regularity, and Lipschitzian Properties of Multifunctions
- Exact Penalization and Necessary Optimality Conditions for Generalized Bilevel Programming Problems
- Variational Analysis
- Rank reduction of correlation matrices by majorization
- Recovering Low-Rank Matrices From Few Coefficients in Any Basis
- Multistage Convex Relaxation Approach to Rank Regularized Minimization Problems Based on Equivalent Mathematical Program with a Generalized Complementarity Constraint
- Convex Analysis
- Mathematical Programs with Cardinality Constraints: Reformulation by Complementarity-Type Conditions and a Regularization Method
