An exact penalty method for semidefinite-box-constrained low-rank matrix optimization problems
From MaRDI portal
Publication:5857317
DOI10.1093/imanum/dry069zbMath1464.65066OpenAlexW2914773211MaRDI QIDQ5857317
Tianxiang Liu, Xiaojun Chen, Zhaosong Lu, Yu-Hong Dai
Publication date: 31 March 2021
Published in: IMA Journal of Numerical Analysis (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/a875e64fdf676f3178442a8678f8266b0386d407
Numerical optimization and variational techniques (65K10) Numerical methods for low-rank matrix approximation; matrix compression (65F55)
Related Items (6)
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 ⋮ Calmness of partial perturbation to composite rank constraint systems and its applications ⋮ A global exact penalty for rank-constrained optimization problem and applications ⋮ Spectral Operators of Matrices: Semismoothness and Characterizations of the Generalized Jacobian ⋮ A penalized method of alternating projections for weighted low-rank Hankel matrix optimization
This page was built for publication: An exact penalty method for semidefinite-box-constrained low-rank matrix optimization problems
